Sergei Obiedkov – författare

This book constitutes the proceedings of the First International Joint Conference on Conceptual Knowledge Structures, CONCEPTS 2024, which took place in Cádiz, Spain, during September 9-13, 2024. The conference is an amalgamation of the 18th International Conference on Formal Concept Analysis (ICFCA); the 17th International Conference on Concept Lattices and Their Applications (CLA); and the 28th International Conference on Conceptual Structures (ICCS).The 18 full and 4 short papers included in this book were carefully reviewed and selected from 38 submissions. They were organized in topical sections as follows: Theory; algorithms, methods, and resources; applications.

The book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory.The book presents contributions to the following areas: acquisition of terminological knowledge from social networks, knowledge communities, individuality computation, other types of FCA-based analysis of bipartite graphs (two-mode networks), multimodal clustering, community detection and description in one-mode and multi-mode networks, adaptation of the dual-projection approach to weighted bipartite graphs, extensions to the Kleinberg's HITS algorithm as well as attributed graph analysis.

The book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory.

The book presents contributions to the following areas: acquisition of terminological knowledge from social networks, knowledge communities, individuality computation, other types of FCA-based analysis of bipartite graphs (two-mode networks), multimodal clustering, community detection and description in one-mode and multi-mode networks, adaptation of the dual-projection approach to weighted bipartite graphs, extensions to the Kleinberg''s HITS algorithm as well as attributed graph analysis.

The book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory.The book presents contributions to the following areas: acquisition of terminological knowledge from social networks, knowledge communities, individuality computation, other types of FCA-based analysis of bipartite graphs (two-mode networks), multimodal clustering, community detection and description in one-mode and multi-mode networks, adaptation of the dual-projection approach to weighted bipartite graphs, extensions to the Kleinberg's HITS algorithm as well as attributed graph analysis.

Formal Concept Analysis (FCA) is a mathematical theory of concepts and c- ceptualhierarchyleadingtomethodsforconceptuallyanalyzingdataandkno- edge. The theoryitselfstronglyreliesonorderandlatticetheory,whichhasbeen studied by mathematicians over decades. FCA proved itself highly relevant in several applications from the beginning, and, over the last years, the range of applicationshaskeptgrowing. The mainreasonfor this comesfromthe fact that our modern society has turned into an “information” society. After years and years of using computers, companies realized they had stored gigantic amounts of data. Then, they realized that this data, just rough information for them, might become a real treasure if turned into knowledge. FCA is particularly well suited for this purpose. From relational data, FCA can extract implications, - pendencies, concepts and hierarchies of concepts, and thus capture part of the knowledge hidden in the data. The ICFCA conference series gathers researchers from all over the world, being the main forum to present new results in FCA and related ?elds. These results range from theoretical novelties to advances in FCA-related algorithmic issues, as well as application domains of FCA. ICFCA 2008 was in the same vein as its predecessors: high-quality papers and presentations, the place of real debate and exchange of ideas. ICFCA 2008 contributed to strengthening the links between theory and applications. The high quality of the presentations was the result of the remarkable work of the authors and the reviewers. We wish to thank the reviewers for all their valuable comments, which helped the authors to improve their presentations.

Formal Concept Analysis (FCA) is a mathematical theory of concepts and c- ceptualhierarchyleadingtomethodsforconceptuallyanalyzingdataandkno- edge. The theoryitselfstronglyreliesonorderandlatticetheory,whichhasbeen studied by mathematicians over decades. FCA proved itself highly relevant in several applications from the beginning, and, over the last years, the range of applicationshaskeptgrowing. The mainreasonfor this comesfromthe fact that our modern society has turned into an “information” society. After years and years of using computers, companies realized they had stored gigantic amounts of data. Then, they realized that this data, just rough information for them, might become a real treasure if turned into knowledge. FCA is particularly well suited for this purpose. From relational data, FCA can extract implications, - pendencies, concepts and hierarchies of concepts, and thus capture part of the knowledge hidden in the data. The ICFCA conference series gathers researchers from all over the world, being the main forum to present new results in FCA and related ?elds. These results range from theoretical novelties to advances in FCA-related algorithmic issues, as well as application domains of FCA. ICFCA 2008 was in the same vein as its predecessors: high-quality papers and presentations, the place of real debate and exchange of ideas. ICFCA 2008 contributed to strengthening the links between theory and applications. The high quality of the presentations was the result of the remarkable work of the authors and the reviewers. We wish to thank the reviewers for all their valuable comments, which helped the authors to improve their presentations.

This is the first textbook on attribute exploration, its theory, its algorithms forapplications, and some of its many possible generalizations. Attribute explorationis useful for acquiring structured knowledge through an interactive process, byasking queries to an expert. Generalizations that handle incomplete, faulty, orimprecise data are discussed, but the focus lies on knowledge extraction from areliable information source.The method is based on Formal Concept Analysis, a mathematical theory ofconcepts and concept hierarchies, and uses its expressive diagrams. The presentationis self-contained. It provides an introduction to Formal Concept Analysiswith emphasis on its ability to derive algebraic structures from qualitative data,which can be represented in meaningful and precise graphics.

This is the first textbook on attribute exploration, its theory, its algorithms forapplications, and some of its many possible generalizations. Attribute explorationis useful for acquiring structured knowledge through an interactive process, byasking queries to an expert. Generalizations that handle incomplete, faulty, orimprecise data are discussed, but the focus lies on knowledge extraction from areliable information source.The method is based on Formal Concept Analysis, a mathematical theory ofconcepts and concept hierarchies, and uses its expressive diagrams. The presentationis self-contained. It provides an introduction to Formal Concept Analysiswith emphasis on its ability to derive algebraic structures from qualitative data,which can be represented in meaningful and precise graphics.