Sergei A. Obiedkov

According to our database, Sergei A. Obiedkov authored at least 33 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

A Language Model for Grammatical Error Correction in L2 Russian.

Nikita Remnev, Sergei Obiedkov, Ekaterina V. Rakhilina, Ivan Smirnov, Anastasia Vyrenkova

CoRR, 2023

Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis.

Sergei Obiedkov, Baris Sertkaya

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

2021

Approximate Computation of Exact Association Rules.

Saurabh Bansal, Sriram Kailasam, Sergei Obiedkov

Proceedings of the Formal Concept Analysis - 16th International Conference, 2021

2020

From equivalence queries to PAC learning: The case of implication theories.

Ramil Yarullin, Sergei Obiedkov

Int. J. Approx. Reason., 2020

Probably approximately correct learning of Horn envelopes from queries.

Daniel Borchmann, Tom Hanika, Sergei Obiedkov

Discret. Appl. Math., 2020

2019

Learning Implications from Data and from Queries.

Sergei Obiedkov

Proceedings of the Formal Concept Analysis - 15th International Conference, 2019

Probably Approximately Correct Completion of Description Logic Knowledge Bases.

Sergei Obiedkov, Baris Sertkaya, Denis Zolotukhin

Proceedings of the 32nd International Workshop on Description Logics, 2019

2018

Neologisms on Facebook.

Nikita Muravyev, Alexander Panchenko, Sergei A. Obiedkov

CoRR, 2018

2017

Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics.

Sergei Obiedkov

Theor. Comput. Sci., 2017

On the Usability of Probably Approximately Correct Implication Bases.

Daniel Borchmann, Tom Hanika, Sergei Obiedkov

Proceedings of the Formal Concept Analysis - 14th International Conference, 2017

2016

Conceptual Exploration

Bernhard Ganter, Sergei A. Obiedkov

Springer, ISBN: 978-3-662-49291-8, 2016

2015

Large-Scale Parallel Matching of Social Network Profiles.

Alexander Panchenko, Dmitry Babaev, Sergei A. Obiedkov

Proceedings of the Analysis of Images, Social Networks and Texts, 2015

2014

Optimizations in computing the Duquenne-Guigues basis of implications.

Konstantin Bazhanov, Sergei A. Obiedkov

Ann. Math. Artif. Intell., 2014

2013

Modeling Ceteris Paribus Preferences in Formal Concept Analysis.

Sergei A. Obiedkov

Proceedings of the Formal Concept Analysis, 2013

2012

Preface.

Marzena Kryszkiewicz, Sergei A. Obiedkov, Zbigniew W. Ras

Fundam. Informaticae, 2012

Modeling Preferences over Attribute Sets in Formal Concept Analysis.

Sergei A. Obiedkov

Proceedings of the Formal Concept Analysis - 10th International Conference, 2012

2011

Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis.

Konstantin Bazhanov, Sergei A. Obiedkov

Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, 2011

2010

Approaches to the Selection of Relevant Concepts in the Case of Noisy Data.

Mikhail Klimushkin, Sergei A. Obiedkov, Camille Roth

Proceedings of the Formal Concept Analysis, 8th International Conference, 2010

2009

An incremental algorithm to construct a lattice of set intersections.

Derrick G. Kourie, Sergei A. Obiedkov, Bruce W. Watson, Dean van der Merwe

Sci. Comput. Program., 2009

Building access control models with attribute exploration.

Sergei A. Obiedkov, Derrick G. Kourie, Jan H. P. Eloff

Comput. Secur., 2009

2008

On Succinct Representation of Knowledge Community Taxonomies with Formal Concept Analysis.

Camille Roth, Sergei A. Obiedkov, Derrick G. Kourie

Int. J. Found. Comput. Sci., 2008

Some decision and counting problems of the Duquenne-Guigues basis of implications.

Sergei O. Kuznetsov, Sergei A. Obiedkov

Discret. Appl. Math., 2008

2007

Attribute-incremental construction of the canonical implication basis.

Sergei A. Obiedkov, Vincent Duquenne

Ann. Math. Artif. Intell., 2007

Reducing the Representation Complexity of Lattice-Based Taxonomies.

Sergei O. Kuznetsov, Sergei A. Obiedkov, Camille Roth

Proceedings of the Conceptual Structures: Knowledge Architectures for Smart Applications, 2007

2006

TABASCO: using concept-based taxonomies in domain engineering.

Loek G. Cleophas, Bruce W. Watson, Derrick G. Kourie, Andrew Boake, Sergei A. Obiedkov

South Afr. Comput. J., 2006

Counting Pseudo-intents and #P-completeness.

Sergei O. Kuznetsov, Sergei A. Obiedkov

Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

On Lattices in Access Control Models.

Sergei A. Obiedkov, Derrick G. Kourie, Jan H. P. Eloff

Proceedings of the Conceptual Structures: Inspiration and Application, 2006

Towards Concise Representation for Taxonomies of Epistemic Communities.

Camille Roth, Sergei A. Obiedkov, Derrick G. Kourie

Proceedings of the Concept Lattices and Their Applications, 2006

2004

AddIntent: A New Incremental Algorithm for Constructing Concept Lattices.

Dean van der Merwe, Sergei A. Obiedkov, Derrick G. Kourie

Proceedings of the Concept Lattices, 2004

Implications in Triadic Formal Contexts.

Bernhard Ganter, Sergei A. Obiedkov

Proceedings of the Conceptual Structures at Work: 12th International Conference on Conceptual Structures, 2004

2002

Comparing performance of algorithms for generating concept lattices.

Sergei O. Kuznetsov, Sergei A. Obiedkov

J. Exp. Theor. Artif. Intell., 2002

Modal Logic for Evaluating Formulas in Incomplete Contexts.

Sergei A. Obiedkov

Proceedings of the Conceptual Structures: Integration and Interfaces, 2002

2001

Algorithms for the Construction of Concept Lattices and Their Diagram Graphs.

Sergei O. Kuznetsov, Sergei A. Obiedkov

Proceedings of the Principles of Data Mining and Knowledge Discovery, 2001