Sergei A. Obiedkov

Orcid: 0000-0003-1497-4001

Affiliations:
  • National Research University Higher School of Economics, Moscow, Russia


According to our database1, Sergei A. Obiedkov authored at least 36 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Selected papers from the First International Joint Conference on Conceptual Knowledge Structures.
Int. J. Approx. Reason., 2024

Probably Approximately Correct Ontology Completion with pacco (Extended Abstract).
Proceedings of the 37th International Workshop on Description Logics (DL 2024), 2024

Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian.
Proceedings of the 2024 Joint International Conference on Computational Linguistics, 2024

2023
A Language Model for Grammatical Error Correction in L2 Russian.
CoRR, 2023

Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

2021
Approximate Computation of Exact Association Rules.
Proceedings of the Formal Concept Analysis - 16th International Conference, 2021

2020
From equivalence queries to PAC learning: The case of implication theories.
Int. J. Approx. Reason., 2020

Probably approximately correct learning of Horn envelopes from queries.
Discret. Appl. Math., 2020

2019
Learning Implications from Data and from Queries.
Proceedings of the Formal Concept Analysis - 15th International Conference, 2019

Probably Approximately Correct Completion of Description Logic Knowledge Bases.
Proceedings of the 32nd International Workshop on Description Logics, 2019

2018
Neologisms on Facebook.
CoRR, 2018

2017
Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics.
Theor. Comput. Sci., 2017

On the Usability of Probably Approximately Correct Implication Bases.
Proceedings of the Formal Concept Analysis - 14th International Conference, 2017

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

2015
Large-Scale Parallel Matching of Social Network Profiles.
Proceedings of the Analysis of Images, Social Networks and Texts, 2015

2014
Optimizations in computing the Duquenne-Guigues basis of implications.
Ann. Math. Artif. Intell., 2014

2013
Modeling Ceteris Paribus Preferences in Formal Concept Analysis.
Proceedings of the Formal Concept Analysis, 2013

2012
Preface.
Fundam. Informaticae, 2012

Modeling Preferences over Attribute Sets in Formal Concept Analysis.
Proceedings of the Formal Concept Analysis - 10th International Conference, 2012

2011
Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis.
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.
Proceedings of the Formal Concept Analysis, 8th International Conference, 2010

2009
An incremental algorithm to construct a lattice of set intersections.
Sci. Comput. Program., 2009

Building access control models with attribute exploration.
Comput. Secur., 2009

2008
On Succinct Representation of Knowledge Community Taxonomies with Formal Concept Analysis.
Int. J. Found. Comput. Sci., 2008

Some decision and counting problems of the Duquenne-Guigues basis of implications.
Discret. Appl. Math., 2008

2007
Attribute-incremental construction of the canonical implication basis.
Ann. Math. Artif. Intell., 2007

Reducing the Representation Complexity of Lattice-Based Taxonomies.
Proceedings of the Conceptual Structures: Knowledge Architectures for Smart Applications, 2007

2006
TABASCO: using concept-based taxonomies in domain engineering.
South Afr. Comput. J., 2006

Counting Pseudo-intents and #P-completeness.
Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

On Lattices in Access Control Models.
Proceedings of the Conceptual Structures: Inspiration and Application, 2006

Towards Concise Representation for Taxonomies of Epistemic Communities.
Proceedings of the Concept Lattices and Their Applications, 2006

2004
AddIntent: A New Incremental Algorithm for Constructing Concept Lattices.
Proceedings of the Concept Lattices, 2004

Implications in Triadic Formal Contexts.
Proceedings of the Conceptual Structures at Work: 12th International Conference on Conceptual Structures, 2004

2002
Comparing performance of algorithms for generating concept lattices.
J. Exp. Theor. Artif. Intell., 2002

Modal Logic for Evaluating Formulas in Incomplete Contexts.
Proceedings of the Conceptual Structures: Integration and Interfaces, 2002

2001
Algorithms for the Construction of Concept Lattices and Their Diagram Graphs.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2001


  Loading...