?
On pattern setups and pattern multistructures
P. 271–285.
Order and lattice theory provides convenient mathematical tools for pattern mining, in particular for condensed irredundant representations of pattern spaces and their efficient generation. Formal Concept Analysis (FCA) offers a generic framework, called pattern structures, to formalize many types of patterns, such as itemsets, intervals, graphs, and sequence sets. Moreover, FCA provides generic algorithms to generate irredundantly all closed patterns, the only condition being that the pattern space is a meet-semilattice. This does not always hold, e.g. for sequential and graph patterns. Here, we discuss pattern setups consisting of descriptions making just a partial order. Such a framework can be too broad, causing several problems, so we propose a new model, dubbed pattern multistructures, lying between pattern setups and pattern structures, which relies on multilattices. Finally, we consider some techniques, namely completions, transforming pattern setups to pattern structures using sets/antichains of patterns.
Sergei O. Kuznetsov, Parakal E. G., Lecture Notes in Networks and Systems 2023 Vol. 776 P. 423–434
Inherently explainable Machine Learning (ML) models are able to provide explanations for their predictions by virtue of their construction. The explanations of a ML model are more comprehensible if they are expressed in terms of its input features. Our paper proposes an inherently explainable pipeline for document classification using pattern structures and Abstract Meaning Representation ...
Added: February 5, 2024
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
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
Kuznetsov S., Goncharova E., , in: Proceedings of the Fifth International Scientific Conference "Intelligent Information Technologies for Industry" (IITI'21)Vol. 330.: Springer, 2022. P. 410–420.
Added: October 28, 2021
Goncharova E., Ilvovsky D., Galitsky B., , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. P. 51–58.
Added: October 28, 2021
Jyoti -., Buzmakov Aleksey, Kailasam S., , in: The 15th International Conference on Concept Lattices and Their Applications CLA2020Issue 2668.: CEUR-WS, 2020. P. 287–292.
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
Belfodil A., Kuznetsov S., Kaytoue M., International Journal of General Systems 2020 Vol. 49 No. 8 P. 785–818
Order and lattice theory provides convenient mathematical tools for pattern mining, in particular for condensed irredundant representations of pattern spaces and their efficient generation. Formal Concept Analysis (FCA) offers a generic framework, called pattern structures, to formalize many types of patterns, such as itemsets, intervals, graphs, and sequence sets. Moreover, FCA provides generic algorithms to generate irredundantly all ...
Added: January 25, 2021
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
[б.и.], 2020.
International Journal of General Systems is a periodical devoted primarily to the publication of original research contributions to system science, basic as well as applied. However, relevant survey articles, invited book reviews, bibliographies, and letters to the editor are also published.
The principal aim of the journal is to promote original systems ideas (concepts, principles, methods, theoretical ...
Added: October 29, 2020