#### Filter Results:

- Full text PDF available (106)

#### Publication Year

1984

2017

- This year (10)
- Last 5 years (67)
- Last 10 years (114)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Bernhard Ganter, Sergei O. Kuznetsov
- ICCS
- 2001

- Sergei O. Kuznetsov, Sergei A. Obiedkov
- J. Exp. Theor. Artif. Intell.
- 2002

Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algorithmic complexityâ€¦ (More)

- Sergei O. Kuznetsov
- Annals of Mathematics and Artificial Intelligence
- 2007

In this paper we define and analyze stability of a formal concept. A stability index is based on the idea of a dependency in a dataset that can be reconstructed from different parts of the dataset.â€¦ (More)

- Sergei O. Kuznetsov
- PKDD
- 1999

A learning model is considered in terms of formal concept analysis (FCA). This model is generalized for objects represented by sets of graphs with partially ordered labels of vertices and edgesâ€¦ (More)

We investigate the problem of mining numerical data with Formal Concept Analysis. The usual way is to use a scaling procedure â€“transforming numerical attributes into binary onesâ€“ leading either to aâ€¦ (More)

- Jonas Poelmans, Sergei O. Kuznetsov, Dmitry I. Ignatov, Guido Dedene
- Expert Syst. Appl.
- 2013

This is the first part of a large survey paper in which we analyze recent literature on Formal Concept Analysis (FCA) and some closely related disciplines using FCA. We collected 1072 papersâ€¦ (More)

- Mehdi Kaytoue-Uberall, Sergei O. Kuznetsov, Amedeo Napoli, SÃ©bastien Duplessis
- Inf. Sci.
- 2011

This paper addresses the important problem of efficiently mining numerical data with formal concept analysis (FCA). Classically, the only way to apply FCA is to binarize the data, thanks to aâ€¦ (More)

Similarity of graphs with labeled vertices and edges is naturally defined in terms of maximal common subgraphs. To avoid computation overload, a parameterized technique for approximation of graphsâ€¦ (More)

- Sergei O. Kuznetsov
- ICFCA
- 2013

Pattern structures, an extension of FCA to data with complex descriptions, propose an alternative to conceptual scaling (binarization) by giving direct way to knowledge discovery in complex data suchâ€¦ (More)

Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of. In this respect, manyâ€¦ (More)