• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
International Workshop

Formal Concept Analysis for Knowledge Discovery


Formal concepts proved to be of big importance for knowledge discovery, both as a tool for concise representation of association rules and a tool for clustering and constructing taxonomies. The FCA4KD workshop aims at bringing together researchers working on diverse aspects of FCA-based knowledge extraction with the applications to fields like Computer and Information Science, Linguistics, Life and Social Sciences, Bioengineering, Chemistry, etc.

Topics of Interest

Main topics of interest include, but are not limited to:

  • foundations
  • concept lattices and related structures
  • attribute implications and data dependencies
  • data preprocessing
  • redundancy and dimensionality reduction
  • information retrieval
  • classification
  • clustering
  • association rules and other data dependencies
  • ontologies

Paper Submission and Publication

Papers may be submitted in PDF or Postscript format. Papers need to be formatted using the Springer Lecture Notes in Computer Science style.

The submission is to be done via EasyChair.

Seminar program
10:00 - 11:00
Keynote talk
Prof. Ivo Duentsch

Knowledge structures and skill assignments: Structural tools for diagnostic assessment

11:00 - 11:15
Coffee break
Regular talks
Dmitry Palchunov, Gulnara Yakhyaeva

The development of ontological model describing the behavior of mobile network subscribers

Tatiana Makhalova, Sergei O. Kuznetsov

On Overfitting of Classifiers Making a Lattice

Alexey Masyutin

Query-based classification with interval pattern structures: application to credit scoring

Mikhail Bogatyrev, Anastassia Intyakova, Kirill Samodurov

Discovering Formal Contexts Generated from Conceptual Graphs

13:15 - 14:00
Lunch Break
14:00 - 16:00
Regular Talks
Nikita Borodulin, Nikolay Shilov

Designing Logic Puzzle Solver

Dmitry V. Vinogradov

 Accidental formal concepts in the presence of counterexample

Xenia Naidenova, Alexey Buzmakov, Vladimir Parkhomenko, Alexander Schukin

Notes on Relation Between Symbolic Classifiers

Sergei O. Kuznetsov, Nurtas Makhazhanov, Maxim Ushakov

On Neural Network Architecture Based on Concept Lattices

16:00 - 16:15
Coffee Break
16:15 - 17:45
Regular talks
Xenia Naidenova, Sergey Curbatov, Vladimir Parkhomenko

Neural-Network Like Logical-Combinatorial Structure Of Data And The Possibilities Of Its Application For Constructing Concept Lattices

Dmitry I. Ignatov

On the Family of Concept Forming Operators in Polyadic FCA

Tatiana Makhalova, Nourine Lhouari

An Incremental Algorithm for Computing n-concepts 

Natalia Korepanova, Sergei O. Kuznetsov

Pattern Structures for Risk Group Identification

17:45 - 18:15
Final discussion