?
Concept Lattices and Their Applications: Preface
Fundamenta Informaticae. 2012. Vol. 115. No. 4. P. i-ii.
Kryszkiewicz M., Obiedkov Sergei, Ras Z.
Приоритетные направления:
компьютерно-математическое
Язык:
английский
Birkhauser/Springer, 2017
Добавлено: 18 сентября 2017 г.
Springer, 2021
Книга вклюает в себя работы 16ой международной конференции по Анализу формальных понятий. Книга поделена на 5 секций: теория, правила, методы и приложения, исследование и визуализация ...
Добавлено: 10 июля 2021 г.
Clermont-Ferrand : CEUR Workshop Proceedings, 2015
Formal Concept Analysis is a method of analysis of logical data based on formalization of conceptual knowledge by means of lattice theory. It has proved to be of interest to various applied fields such as data visualization, knowledge discovery and data mining, database theory, and many others. The International Conference “Concept Lattices and Their Applications ...
Добавлено: 22 октября 2015 г.
Bernhard Ganter, Объедков С. А., Berlin, Heidelberg : Springer, 2016
This is the first textbook on attribute exploration, its theory, its algorithms for applications, and some of its many possible generalizations. Attribute exploration is useful for acquiring structured knowledge through an interactive process, by asking queries to an expert. Generalizations that handle incomplete, faulty, or imprecise data are discussed, but the focus lies on knowledge ...
Добавлено: 3 сентября 2016 г.
Konstantin Bazhanov, Объедков С. А., Annals of Mathematics and Artificial Intelligence 2014 Vol. 70 No. 1-2 P. 5-24
In this paper, we consider 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 ...
Добавлено: 26 октября 2013 г.
M. : Higher School of Economics, National Research University, 2016
The 13th International Conference on “Concept Lattices and Applications (CLA 2016)” was held at National Research University Higher School of Economics, Moscow, Russia from July 18 until July 22, 2016. The CLA conference, organized since 2002, aims to provide to everyone interested in Formal Concept Analysis and more generally in Concept Lattices or Galois Lattices, ...
Добавлено: 6 октября 2016 г.
CEUR-WS, 2020
Добавлено: 29 октября 2020 г.
Пульманс Й., Игнатов Д. И., Кузнецов С. О. и др., International Journal of General Systems 2014 Vol. 43 No. 2 P. 105-134
Добавлено: 9 июня 2014 г.
La Rochelle : Laboratory L3i, University of La Rochelle, 2013
Добавлено: 18 октября 2013 г.
Kosice : Pavol Jozef Safarik University, 2014
Formal Concept Analysis is a mathematical theory formalizing aspects of human conceptual thinking by means of lattice theory. As such, it constitutes a theoretically well-founded, practically proven, human-centered approach to data science and has been continuously contributing valuable insights, methodologies and algorithms to the scientic community. The International Conference "Concept Lattices and Their Applications (CLA)" ...
Добавлено: 8 октября 2014 г.
CEUR Workshop Proceedings, 2019
Добавлено: 31 октября 2019 г.
Yarullin R., Объедков С. А., International Journal of Approximate Reasoning 2020 Vol. 127 P. 1-16
Добавлено: 6 октября 2020 г.
Cham : Springer, 2017
This book constitutes the proceedings of the 14th International Conference on Formal Concept Analysis, ICFCA 2017, held in Rennes, France, in June 2017. The 13 full papers presented in this volume were carefully reviewed and selected from 37 submissions. The book also contains an invited contribution and a historical paper translated from German and originally ...
Добавлено: 25 июня 2017 г.
Кузнецов С. О., Poelman J., Elzinga P. и др., Lecture Notes in Computer Science 2012 Vol. 7377 LNAI P. 528-272
In this paper we introduce a novel human-centered data mining software system which was designed to gain intelligence from unstructured textual data. The architecture takes its roots in several case studies which were a collaboration between the Amsterdam-Amstelland Police, GasthuisZusters Antwerpen (GZA) hospitals and KU Leuven. It is currently being implemented by bachelor and master ...
Добавлено: 7 февраля 2013 г.
Кузнецов С. О., Demko C., Bertet K. и др., , in : Electronic Procedings Theoretical Computer Science. Vol. 845.: [б.и.], 2020. P. 1-20.
Добавлено: 29 октября 2020 г.
Кузнецов С. О., Revenko A., International Journal of Approximate Reasoning 2015 Vol. 63 P. 89-100
Errors in implicative theories coming from binary data are studied. First, two classes of errors that may affect implicative theories are singled out. Two approaches for finding errors of these classes are proposed, both of them based on methods of Formal Concept Analysis. The first approach uses the cardinality minimal (canonical or Duquenne–Guigues) implication base. ...
Добавлено: 23 октября 2015 г.
Объедков С. А., Theoretical Computer Science 2017 Vol. 658 No. Part B P. 375-390
Добавлено: 2 апреля 2016 г.
[б.и.], 2020
Добавлено: 29 октября 2020 г.
CEUR-WS.org, 2020
Добавлено: 30 октября 2020 г.