| Comparing performance of algorithms for generating concept lattices SO Kuznetsov, SA Obiedkov Journal of Experimental & Theoretical Artificial Intelligence 14 (2-3), 189-216, 2002 | 675 | 2002 |
| AddIntent: A new incremental algorithm for constructing concept lattices D Van Der Merwe, S Obiedkov, D Kourie Concept Lattices, 205-206, 2004 | 203 | 2004 |
| Reducing the representation complexity of lattice-based taxonomies S Kuznetsov, S Obiedkov, C Roth Conceptual Structures: Knowledge Architectures for Smart Applications, 241-254, 2007 | 112 | 2007 |
| Towards concise representation for taxonomies of epistemic communities C Roth, S Obiedkov, D Kourie Concept Lattices and Their Applications, 240-255, 2008 | 111 | 2008 |
| Approaches to the selection of relevant concepts in the case of noisy data M Klimushkin, S Obiedkov, C Roth Formal Concept Analysis, 255-266, 2010 | 97 | 2010 |
| Conceptual exploration B Ganter, S Obiedkov, S Rudolph, G Stumme Springer, 2016 | 88 | 2016 |
| Algorithms for the construction of concept lattices and their diagram graphs SO Kuznetsov, SA Obiedkov European Conference on Principles of Data Mining and Knowledge Discovery …, 2001 | 76 | 2001 |
| On succinct representation of knowledge community taxonomies with formal concept analysis C Roth, S Obiedkov, DG Kourie International Journal of Foundations of Computer Science 19 (02), 383-404, 2008 | 69 | 2008 |
| An incremental algorithm to construct a lattice of set intersections DG Kourie, S Obiedkov, BW Watson, D van der Merwe Science of Computer Programming 74 (3), 128-142, 2009 | 58 | 2009 |
| Attribute-incremental construction of the canonical implication basis S Obiedkov, V Duquenne Annals of Mathematics and Artificial Intelligence 49 (1), 77-99, 2007 | 56 | 2007 |
| Some decision and counting problems of the Duquenne-Guigues basis of implications SO Kuznetsov, S Obiedkov Discrete Applied Mathematics 156 (11), 1994-2003, 2008 | 54 | 2008 |
| Implications in triadic formal contexts B Ganter, S Obiedkov Conceptual Structures at Work, 237-237, 2004 | 51 | 2004 |
| Building access control models with attribute exploration S Obiedkov, DG Kourie, JHP Eloff Computers & Security 28 (1-2), 2-7, 2009 | 30 | 2009 |
| Counting pseudo-intents and# P-completeness SO Kuznetsov, S Obiedkov Formal Concept Analysis, 306-308, 2006 | 30 | 2006 |
| Modal logic for evaluating formulas in incomplete contexts S Obiedkov International Conference on Conceptual Structures, 314-325, 2002 | 30 | 2002 |
| Optimizations in computing the Duquenne–Guigues basis of implications K Bazhanov, S Obiedkov Annals of mathematics and artificial intelligence 70 (1), 5-24, 2014 | 23 | 2014 |
| Modeling preferences over attribute sets in formal concept analysis S Obiedkov International Conference on Formal Concept Analysis, 227-243, 2012 | 16 | 2012 |
| Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis. K Bazhanov, SA Obiedkov CLA, 43-57, 2011 | 16 | 2011 |
| Modeling ceteris paribus preferences in formal concept analysis S Obiedkov International Conference on Formal Concept Analysis, 188-202, 2013 | 12 | 2013 |
| TABASCO: using concept-based taxonomies in domain engineering: reviewed article L Cleophas, BW Watson, DG Kourie, A Boake, S Obiedkov South African Computer Journal 2006 (37), 30-40, 2006 | 12 | 2006 |
Sergei O. Kuznetsov; Сергей О. Кузн...National Research University Higher School of Economics, MoscowVerified email at hse.ru
