?
Towards Stable Significant Subgroup Discovery
P. 287–292.
In book
Issue 2668. , CEUR-WS, 2020.
Ignatov D. I., , in: LNAI 14133: 28th International Conference on Conceptual Structures, ICCS 2023, Berlin, Germany, September 11–13, 2023, Proceedings. Graph-Based Representation and Reasoning.: Berlin: Springer, 2023. P. 56–69.
Set partitions and partition lattices are well-known objects in combinatorics and play an important role as a search space in many applied problems including ensemble clustering. Searching for antichains in such lattices is similar to that of in Boolean lattices. Counting the number of antichains in Boolean lattices is known as the Dedekind problem. In ...
Added: November 23, 2023
CEUR-WS.org, 2023.
Added: September 27, 2023
Switzerland: Springer, 2023.
Added: September 27, 2023
Ignatov D. I., Lobachevskii Journal of Mathematics 2023 No. 44 P. 137–146
We consider two ways how to compute the number of maximal antichains in the Boolean lattice on 𝑛 elements. The first one is based on full direct enumeration, while the second ones relies on concept lattices or Galois lattices (studied in Formal Concept Analysis, an applied branch of lattice theory) and the Dedekind–MacNeille completion of a partial ...
Added: June 13, 2023
Lukianchenko P., Gromov V., Beschastnov Y. et al., Вестник кибернетики 2022 Т. 4 № 48 С. 37–48
The study analyzes the time series of the number of new cases in the administrative courts
of the Russian Federation using two methods of time series grouping according to the chaotic, stochastic, and
regular structure. The first model is based on the entropy‒complexity plane, the second one is presented by the
attribute‒object graph. As a result, four groups ...
Added: March 20, 2023
Gromov V., Урманцева Н. Р., [б.и.], 2021.
В докладе рассматриваются подходы к прогнозированию на основе кластеризации, опирающиеся на методологию анализа формальных понятий. Методология применяется для кластеризации участков временного ряда с целью выделения характерных участков (мотивов), отвечающих больным с различной степенью засорённости фистулы. ...
Added: January 30, 2023
Ilya Semenkov, Sergei O. Kuznetsov, , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. P. 105–112.
This paper presents different versions of classification ensemble methods based on pattern structures. Each of these methods is described and tested on multiple datasets (including datasets with exclusively numerical and exclusively nominal features). As a baseline model Random Forest generation is used. For some classification tasks the classification algorithms based on pattern structures showed better ...
Added: December 19, 2022
Dudyrev E., Kuznetsov S., , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. Ch. 9 P. 99–104.
Ensembles of decision trees, like Random Forests are efficient machine learning models with state-of-the-art prediction quality. However, their predictions are much less transparent than those of a single decision tree. In this paper, we describe a prediction model based on a single decision tree in terms of Formal Concept Analysis. We define a differential way ...
Added: December 8, 2021
Buzmakov A. V., Kuznetsov S., Makhalova T. et al., , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. Ch. 2 P. 19–26.
Added: December 7, 2021
Buzmakov A. V., , in: Eighth International Workshop “What can FCA do for Artificial Intelligence?”.: [б.и.], 2020. P. 57–68.
The goal of subgroup discovery is to find groups of objectsthat are significantly different than “average” object w.r.t. some super-vised information. It is a computational intensive procedure that tra-verses a large searching space corresponding to the set of formal con-cepts. It was recently found that a part of formal concepts, called stableconcepts, can be found ...
Added: July 10, 2021
Springer, 2021.
This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021.
The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length.
The research part ...
Added: July 10, 2021
CEUR-WS.org, 2020.
The CLA conference is an international forum for researchers, practitioners and students dedicated to the practice of Formal Concept Analysis (FCA) and areas closely related to it, including data analysis and mining, information retrieval, knowledge management, knowledge engineering, logic, algebra and lattice theory.
The 15th of CLA, CLA 2020, was going to be held in Tallinn, Estonia ...
Added: October 30, 2020
Lang J., CEUR-WS, 2020.
The 9th European Starting AI Researchers’ Symposium (STAIRS) is an international meeting intended to support Starting Researchers (those that have not been awarded a doctoral degree but also researchers with not more than three years of experience after getting their PhD). STAIRS is collocated with the ECAI2020 tutorials and workshops and has an independent program committee. In this edition, ...
Added: October 30, 2020
Kuznetsov S., Makhalova T., Napoli A., , in: Proceedings of the 9th European Starting AI Researchers' Symposium 2020 co-located with 24th European Conference on Artificial Intelligence (ECAI 2020).: CEUR-WS, 2020. P. 1–8.
Added: October 30, 2020
[б.и.], 2020.
The seven preceding editions of the FCA4AI Workshop showed that many researchers working in Artificial Intelligence are deeply interested by a well-founded method for classification and data mining such as Formal Concept Analysis (see https://conceptanalysis. wordpress.com/fca/). FCA4AI was co-located with ECAI 2012 (Montpellier), IJCAI 2013 (Beijing), ECAI 2014 (Prague), IJCAI 2015 (Buenos Aires), ECAI 2016 ...
Added: October 29, 2020
Kuznetsov S., Demko C., Bertet K. et al., , in: Electronic Procedings Theoretical Computer ScienceVol. 845.: [б.и.], 2020. P. 1–20.
In this article, we present a new data type agnostic algorithm calculating a concept lattice from heterogeneous and complex data. Our NextPriorityConcept algorithm is first introduced and proved in the binary case as an extension of Bordat's algorithm with the notion of strategies to select only some predecessors of each concept, avoiding the generation of ...
Added: October 29, 2020
[б.и.], 2020.
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is ...
Added: October 29, 2020