?
Comparing performance of algorithms for generating the Duquenne–Guigues basis
P. 43–57.
Bazhanov K., Obiedkov S.
In this paper, we take a look at algorithms involved in the computation of the Duquenne–Guigues basis of implications. The most widely used algorithm for constructing the basis is Ganter’s Next Closure, designed for generating closed sets of an arbitrary closure system. We show that, for the purpose of generating the basis, the algorithm can be optimized. We compare the performance of the original algorithm and its optimized version in a series of experiments using artificially generated and real-life datasets. An important computationally expensive subroutine of the algorithm generates the closure of an attribute set with respect to a set of implications. We compare the performance of three algorithms for this task on their own, as well as in conjunction with each of the two versions of Next Closure.
In book
Nancy: INRIA Nancy Grand Est and LORIA, 2011.
Kanaev E., Southeast Asia: Actual Problems of Development 2026 Vol. 2 No. 2(71) P. 11–22
The author focuses on a strengthening digital component in the evolution of the South China Sea issue in the context of ASEAN’s evolving approach to the deepening contradictions and its policy in the digital field. On outlining ASEAN’s policy on the South China Sea issue, the author proceeds to exploring the digital agenda of ASEAN’s ...
Added: July 30, 2026
Kanaev E., Garaeva A., Fedorenko D. O., , in: Cooperation in Asia-Pacific: Transition to a New World Order.: M.: IOS RAS, 2025. P. 8–10.
The chapter discusses the implications of the US-China technological rivalry for ASEAN and its digital projects. ...
Added: April 5, 2025
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
Kanaev E., Luzyanin S., , in: The global reset: insights from regions.: M.: Advanced Solutions, 2022. P. 4–11.
The chapter points out salient features of the present-day globalization and outlines major changes that have been generated by the policies of Asia-Pacific economic actors. ...
Added: June 11, 2023
Kanaev E., Terskikh M., , in: The global reset: insights from regions.: M.: Advanced Solutions, 2022.
The chapter analyses Russia’s position on the Indo-Pacifi c region, its perception in the Russian expert and political communities, as well as its impact on Russia’s interests. The paper offers insights into Russia’s expert assessments of the Indo-Pacifi c region, presents mainstream points of view from a political and security perspective. The authors trace Russia’s ...
Added: June 11, 2023
terskikh M., , in: The global reset: insights from regions.: M.: Advanced Solutions, 2022. P. 88–97.
The chapter analyses Russia’s position on the Indo-Pacifi c region, its perception in the Russian expert and political communities, as well as its impact on Russia’s interests. The paper offers insights into Russia’s expert assessments of the Indo-Pacifi c region, presents mainstream points of view from a political and security perspective. The authors trace Russia’s ...
Added: June 11, 2023
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
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
Yarullin R., Obiedkov S., International Journal of Approximate Reasoning 2020 Vol. 127 P. 1–16
In Angluin's exact-learning framework, equivalence queries can be simulated by stochastic equivalence testing to achieve a probably approximately correct identification of an unknown concept. We present an analysis of the number of samples that need to be generated in the process leading to a theoretical improvement on an earlier approach. We apply this modification to ...
Added: October 6, 2020
Ryzhova D., СПб.: Алетейя, 2020.
Лексическая типология – область лингвистики, которая занимается сопоставительным анализом значений слов в разных языках, – на сегодняшний день добилась больших успехов: разработаны методики сбора и анализа материала, описан целый ряд семантических полей. Однако некоторые методологические ограничения по-прежнему не преодолены: процесс сбора данных очень трудоемок, что сказывается либо на объемах и представительности языковых выборок, либо на ...
Added: June 2, 2020
Obiedkov S., , in: Formal Concept Analysis. ICFCA 2019.: Springer, 2019. P. 32–44.
In this paper, we consider computational problems related to finding implications in an explicitly given formal context or via queries to an oracle. We are concerned with two types of problems: enumerating implications (or association rules) and finding a single implication satisfying certain conditions. We present complexity results for some of these problems and leave ...
Added: October 29, 2019
Botchkarev A., , in: Фундаментальное и актуальное в развитии языка: категории, факторы, механизмы: Сборник статей. Материалы XVIII Международной конференции Школы‐Семинара имени Л. М. Скрелиной.: М.: МГПУ, Языки народов мира, 2017. P. 307–310.
The article is devoted to various representations of the floral motif in Marcel Proust's work. This text rather deals with the relation of the floral to the aesthetic. Ambiguous as it may seem, the interaction between the floral and the aesthetic is largely defined by the encyclopedic knowledge, and even by the cultural implications imposing ...
Added: February 21, 2019
Springer, 2017.
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 ...
Added: December 17, 2017