S. Obiedkov

Most-cited papers

Comparing performance of algorithms for generating concept lattices
S. Kuznetsov, S. Obiedkov
2002Journal of experimental and theoretical artificial intelligence (Print)597 citations
Semantic Scholar
Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings
Raoul Medina, S. Obiedkov
2008International Conference on Formal Concept Analysis355 citations
Semantic Scholar
AddIntent: A New Incremental Algorithm for Constructing Concept Lattices
Dean van der Merwe, S. Obiedkov, D. Kourie
2004International Conference on Formal Concept Analysis169 citations
Semantic Scholar
Conceptual Exploration
B. Ganter, S. Obiedkov
2016Springer Berlin Heidelberg132 citations
Semantic Scholar
Approaches to the Selection of Relevant Concepts in the Case of Noisy Data
M. Klimushkin, S. Obiedkov, C. Roth
2010International Conference on Formal Concept Analysis107 citations
Semantic Scholar
Reducing the Representation Complexity of Lattice-Based Taxonomies
S. Kuznetsov, S. Obiedkov, C. Roth
2007International Conference on Conceptual Structures106 citations
Semantic Scholar
Towards Concise Representation for Taxonomies of Epistemic Communities
C. Roth, S. Obiedkov, D. Kourie
2006International Conference on Concept Lattices and their Applications94 citations
Semantic Scholar
On Succinct Representation of Knowledge Community Taxonomies with Formal Concept Analysis
C. Roth, S. Obiedkov, D. Kourie
2008International Journal of Foundations of Computer Science71 citations Open access
Semantic Scholar
Algorithms for the Construction of Concept Lattices and Their Diagram Graphs
S. Kuznetsov, S. Obiedkov
2001European Conference on Principles of Data Mining and Knowledge Discovery63 citations Open access
Semantic Scholar
Some decision and counting problems of the Duquenne-Guigues basis of implications
S. Kuznetsov, S. Obiedkov
2008Discrete Applied Mathematics61 citations Open access
Semantic Scholar
Attribute-incremental construction of the canonical implication basis
S. Obiedkov, V. Duquenne
2007Annals of Mathematics and Artificial Intelligence54 citations
Semantic Scholar
An incremental algorithm to construct a lattice of set intersections
D. Kourie, S. Obiedkov, B. W. Watson, Dean van der Merwe
2009Science of Computer Programming53 citations Open access
Semantic Scholar
Implications in Triadic Formal Contexts
B. Ganter, S. Obiedkov
2004International Conference on Conceptual Structures51 citations
Semantic Scholar
Counting Pseudo-intents and #P-completeness
S. Kuznetsov, S. Obiedkov
2006International Conference on Formal Concept Analysis34 citations
Semantic Scholar
Modal Logic for Evaluating Formulas in Incomplete Contexts
S. Obiedkov
2002International Conference on Conceptual Structures33 citations
Semantic Scholar
Building access control models with attribute exploration
S. Obiedkov, D. Kourie, J. Eloff
2009Computers & security31 citations
Semantic Scholar
Optimizations in computing the Duquenne–Guigues basis of implications
Konstantin Bazhanov, S. Obiedkov
2014Annals of Mathematics and Artificial Intelligence21 citations
Semantic Scholar
Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis
Konstantin Bazhanov, S. Obiedkov
2011International Conference on Concept Lattices and their Applications17 citations
Semantic Scholar
Probably approximately correct learning of Horn envelopes from queries
D. Borchmann, Tom Hanika, S. Obiedkov
2018Discrete Applied Mathematics16 citations Open access
Semantic Scholar
Modeling Preferences over Attribute Sets in Formal Concept Analysis
S. Obiedkov
2012International Conference on Formal Concept Analysis15 citations
Semantic Scholar
TABASCO: using concept-based taxonomies in domain engineering
L. Cleophas, B. W. Watson, D. Kourie, A. Boake +1 more
2006S. Afr. Comput. J.14 citations
Semantic Scholar
Formal Concept Analysis of Social Networks
R. Missaoui, S. Kuznetsov, S. Obiedkov
2017Lecture Notes in Social Networks12 citations
Semantic Scholar
Large-Scale Parallel Matching of Social Network Profiles
Alexander Panchenko, Dmitrii Babaev, S. Obiedkov
2015International Joint Conference on the Analysis of Images, Social Networks and Texts9 citations Open access
Semantic Scholar
On the Usability of Probably Approximately Correct Implication Bases
D. Borchmann, Tom Hanika, S. Obiedkov
2017International Conference on Formal Concept Analysis8 citations Open access
Semantic Scholar
Incremental Construction of the Canonical Implication Basis
S. Obiedkov, V. Duquenne
20038 citations
Semantic Scholar
From equivalence queries to PAC learning: The case of implication theories
R. Yarullin, S. Obiedkov
2020International Journal of Approximate Reasoning6 citations Open access
Semantic Scholar
Exploring data tables
B. Ganter, S. Obiedkov
20166 citations
Semantic Scholar
Modeling Ceteris Paribus Preferences in Formal Concept Analysis
S. Obiedkov
2013International Conference on Formal Concept Analysis6 citations
Semantic Scholar
On Lattices in Access Control Models
S. Obiedkov, D. Kourie, J. Eloff
2006International Conference on Conceptual Structures5 citations
Semantic Scholar
Probably Approximately Correct Completion of Description Logic Knowledge Bases
S. Obiedkov, B. Sertkaya, Denis Zolotukhin
2019Description Logics4 citations
Semantic Scholar
The canonical basis
B. Ganter, S. Obiedkov
20164 citations
Semantic Scholar
Fundamenta Informaticae: Preface
Marzena Kryszkiewicz, S. Obiedkov, Zbigniew W. Ras
2012Fundamenta Informaticae4 citations Open access
Semantic Scholar
On a version of Mill's method of difference
P. Grigoriev, S. Kuznetsov, S. Obiedkov, Serhiy A. Yevtushenko
20024 citations
Semantic Scholar
Learning Implications from Data and from Queries
S. Obiedkov
2019International Conference on Formal Concept Analysis3 citations
Semantic Scholar
More expressive variants of exploration
B. Ganter, S. Obiedkov
20163 citations
Semantic Scholar
A Multidimensional Model for Analyzing Democratic Development in Central and Eastern Europe
S. Obiedkov, M. Klimushkin, M. Shabanova, Dmitry G. Zaytsev
20133 citations Open access
Semantic Scholar
Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian
Daniil Kosakin, S. Obiedkov, Ivan Smirnov, Ekaterina Rakhilina +2 more
2024International Conference on Language Resources and Evaluation2 citations
Semantic Scholar
A Language Model for Grammatical Error Correction in L2 Russian
N. Remnev, S. Obiedkov, E. Rakhilina, I. Smirnov +1 more
2023arXiv.org1 citations Open access
Semantic Scholar
Approximate Computation of Exact Association Rules
S. Bansal, S. Kailasam, S. Obiedkov
2021International Conference on Formal Concept Analysis1 citations
Semantic Scholar
Neologisms on Facebook
N. Muravyev, Alexander Panchenko, S. Obiedkov
2018arXiv.org1 citations
Semantic Scholar
Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics
S. Obiedkov
2017Theoretical Computer Science1 citations Open access
Semantic Scholar
An algorithm for closure systems
B. Ganter, S. Obiedkov
20161 citations
Semantic Scholar
Proceedings of the 6th international conference on Formal concept analysis
Raoul Medina, S. Obiedkov
20081 citations
Semantic Scholar
Collaborative Hybrid Human AI Learning through Conceptual Exploration
Bernhard Ganter, Tom Hanika, Johannes Hirth, S. Obiedkov
2024HHAI Workshops0 citations
Semantic Scholar
Optimizations in computing the Duquenne–Guigues basis of implications
Konstantin Bazhanov, S. Obiedkov
2013Annals of Mathematics and Artificial Intelligence0 citations
Semantic Scholar