default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergei A. Obiedkov
Person information
- affiliation: National Research University Higher School of Economics, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Inma P. Cabrera, Sébastien Ferré, Sergei Obiedkov:
Selected papers from the First International Joint Conference on Conceptual Knowledge Structures. Int. J. Approx. Reason. 175: 109303 (2024)- [c20]Daniil Kosakin, Sergei Obiedkov, Ivan Smirnov, Ekaterina V. Rakhilina, Anastasia Vyrenkova, Ekaterina Zalivina:
Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian. LREC/COLING 2024: 14240-14258 - [c19]Sergei Obiedkov, Baris Sertkaya:
Probably Approximately Correct Ontology Completion with pacco (Extended Abstract). Description Logics 2024 - [e5]Inma P. Cabrera
, Sébastien Ferré, Sergei A. Obiedkov:
Conceptual Knowledge Structures - First International Joint Conference, CONCEPTS 2024, Cádiz, Spain, September 9-13, 2024, Proceedings. Lecture Notes in Computer Science 14914, Springer 2024, ISBN 978-3-031-67867-7 [contents] - 2023
- [c18]Sergei Obiedkov, Baris Sertkaya:
Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis. JELIA 2023: 176-191 - [i5]Nikita Remnev, Sergei Obiedkov, Ekaterina V. Rakhilina, Ivan Smirnov, Anastasia Vyrenkova:
A Language Model for Grammatical Error Correction in L2 Russian. CoRR abs/2307.01609 (2023) - 2021
- [c17]Saurabh Bansal, Sriram Kailasam, Sergei Obiedkov:
Approximate Computation of Exact Association Rules. ICFCA 2021: 107-122 - 2020
- [j12]Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
Probably approximately correct learning of Horn envelopes from queries. Discret. Appl. Math. 273: 30-42 (2020) - [j11]Ramil Yarullin, Sergei Obiedkov:
From equivalence queries to PAC learning: The case of implication theories. Int. J. Approx. Reason. 127: 1-16 (2020)
2010 – 2019
- 2019
- [c16]Sergei Obiedkov, Baris Sertkaya, Denis Zolotukhin:
Probably Approximately Correct Completion of Description Logic Knowledge Bases. Description Logics 2019 - [c15]Sergei Obiedkov:
Learning Implications from Data and from Queries. ICFCA 2019: 32-44 - [i4]Alexander Panchenko, Dmitry Babaev, Sergei A. Obiedkov:
Large-Scale Parallel Matching of Social Network Profiles. CoRR abs/1911.06861 (2019) - 2018
- [i3]Nikita Muravyev, Alexander Panchenko, Sergei A. Obiedkov:
Neologisms on Facebook. CoRR abs/1804.05831 (2018) - [i2]Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
Probably approximately correct learning of Horn envelopes from queries. CoRR abs/1807.06149 (2018) - 2017
- [j10]Sergei Obiedkov:
Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics. Theor. Comput. Sci. 658: 375-390 (2017) - [c14]Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
On the Usability of Probably Approximately Correct Implication Bases. ICFCA 2017: 72-88 - [e4]Rokia Missaoui, Sergei O. Kuznetsov, Sergei A. Obiedkov:
Formal Concept Analysis of Social Networks. Lecture Notes in Social Networks, Springer 2017, ISBN 978-3-319-64166-9 [contents] - [i1]Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
On the Usability of Probably Approximately Correct Implication Bases. CoRR abs/1701.00877 (2017) - 2016
- [b1]Bernhard Ganter, Sergei A. Obiedkov:
Conceptual Exploration. Springer 2016, ISBN 978-3-662-49290-1, pp. 1-315 - 2015
- [c13]Alexander Panchenko, Dmitry Babaev, Sergei A. Obiedkov:
Large-Scale Parallel Matching of Social Network Profiles. AIST 2015: 275-285 - [e3]Sergei O. Kuznetsov, Rokia Missaoui, Sergei A. Obiedkov:
Proceedings of the Workshop on Social Network Analysis using Formal Concept Analysis in conjunction with the 13th International Conference on Formal Concept Analysis (ICFCA 2015), Nerja (Malaga), Spain, June 25, 2015. CEUR Workshop Proceedings 1534, CEUR-WS.org 2015 [contents] - 2014
- [j9]Konstantin Bazhanov, Sergei A. Obiedkov:
Optimizations in computing the Duquenne-Guigues basis of implications. Ann. Math. Artif. Intell. 70(1-2): 5-24 (2014) - 2013
- [c12]Sergei A. Obiedkov:
Modeling Ceteris Paribus Preferences in Formal Concept Analysis. ICFCA 2013: 188-202 - 2012
- [j8]Marzena Kryszkiewicz, Sergei A. Obiedkov, Zbigniew W. Ras:
Preface. Fundam. Informaticae 115(4) (2012) - [c11]Sergei A. Obiedkov:
Modeling Preferences over Attribute Sets in Formal Concept Analysis. ICFCA 2012: 227-243 - 2011
- [c10]Konstantin Bazhanov, Sergei A. Obiedkov:
Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis. CLA 2011: 43-57 - 2010
- [c9]Mikhail Klimushkin, Sergei A. Obiedkov, Camille Roth:
Approaches to the Selection of Relevant Concepts in the Case of Noisy Data. ICFCA 2010: 255-266 - [e2]Marzena Kryszkiewicz, Sergei A. Obiedkov:
Proceedings of the 7th International Conference on Concept Lattices and Their Applications, Sevilla, Spain, October 19-21, 2010. CEUR Workshop Proceedings 672, CEUR-WS.org 2010 [contents]
2000 – 2009
- 2009
- [j7]Sergei A. Obiedkov, Derrick G. Kourie, Jan H. P. Eloff:
Building access control models with attribute exploration. Comput. Secur. 28(1-2): 2-7 (2009) - [j6]Derrick G. Kourie, Sergei A. Obiedkov, Bruce W. Watson, Dean van der Merwe:
An incremental algorithm to construct a lattice of set intersections. Sci. Comput. Program. 74(3): 128-142 (2009) - 2008
- [j5]Sergei O. Kuznetsov, Sergei A. Obiedkov:
Some decision and counting problems of the Duquenne-Guigues basis of implications. Discret. Appl. Math. 156(11): 1994-2003 (2008) - [j4]Camille Roth, Sergei A. Obiedkov, Derrick G. Kourie:
On Succinct Representation of Knowledge Community Taxonomies with Formal Concept Analysis. Int. J. Found. Comput. Sci. 19(2): 383-404 (2008) - [e1]Raoul Medina, Sergei A. Obiedkov:
Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings. Lecture Notes in Computer Science 4933, Springer 2008, ISBN 978-3-540-78136-3 [contents] - 2007
- [j3]Sergei A. Obiedkov, Vincent Duquenne:
Attribute-incremental construction of the canonical implication basis. Ann. Math. Artif. Intell. 49(1-4): 77-99 (2007) - [c8]Sergei O. Kuznetsov, Sergei A. Obiedkov, Camille Roth:
Reducing the Representation Complexity of Lattice-Based Taxonomies. ICCS 2007: 241-254 - 2006
- [j2]Loek G. Cleophas, Bruce W. Watson, Derrick G. Kourie, Andrew Boake, Sergei A. Obiedkov:
TABASCO: using concept-based taxonomies in domain engineering. South Afr. Comput. J. 37: 30-40 (2006) - [c7]Camille Roth, Sergei A. Obiedkov, Derrick G. Kourie:
Towards Concise Representation for Taxonomies of Epistemic Communities. CLA 2006: 240-255 - [c6]Sergei A. Obiedkov, Derrick G. Kourie, Jan H. P. Eloff:
On Lattices in Access Control Models. ICCS 2006: 374-387 - [c5]Sergei O. Kuznetsov, Sergei A. Obiedkov:
Counting Pseudo-intents and #P-completeness. ICFCA 2006: 306-308 - 2004
- [c4]Bernhard Ganter, Sergei A. Obiedkov:
Implications in Triadic Formal Contexts. ICCS 2004: 186-195 - [c3]Dean van der Merwe, Sergei A. Obiedkov, Derrick G. Kourie:
AddIntent: A New Incremental Algorithm for Constructing Concept Lattices. ICFCA 2004: 372-385 - 2002
- [j1]Sergei O. Kuznetsov, Sergei A. Obiedkov:
Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. 14(2-3): 189-216 (2002) - [c2]Sergei A. Obiedkov:
Modal Logic for Evaluating Formulas in Incomplete Contexts. ICCS 2002: 314-325 - 2001
- [c1]Sergei O. Kuznetsov, Sergei A. Obiedkov:
Algorithms for the Construction of Concept Lattices and Their Diagram Graphs. PKDD 2001: 289-300
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
