Formal concept analysis in knowledge processing: A survey on models and techniques
This is the first part of a large survey paper in which we analyze recent literature on Formal
Concept Analysis (FCA) and some closely related disciplines using FCA. We collected 1072 …
Concept Analysis (FCA) and some closely related disciplines using FCA. We collected 1072 …
Formal concept analysis–overview and applications
F Škopljanac-Mačina, B Blašković - Procedia Engineering, 2014 - Elsevier
In this article we give a brief overview of the theory behind the formal concept analysis, a
novel method for data representation and analysis. From given tabular input data this …
novel method for data representation and analysis. From given tabular input data this …
[BOOK][B] Conceptual exploration
This book describes a method called “attribute exploration”, its applications, its theory, and
some of the many possible generalizations. The basic task is very simple: for a given list of …
some of the many possible generalizations. The basic task is very simple: for a given list of …
Formal concept analysis: from knowledge discovery to knowledge processing
In this chapter, we introduce Formal Concept Analysis (FCA) and some of its extensions.
FCA is a formalism based on lattice theory aimed at data analysis and knowledge …
FCA is a formalism based on lattice theory aimed at data analysis and knowledge …
[BOOK][B] Finite ordered sets: concepts, results and uses
N Caspard, B Leclerc, B Monjardet - 2012 - books.google.com
Ordered sets are ubiquitous in mathematics and have significant applications in computer
science, statistics, biology and the social sciences. As the first book to deal exclusively with …
science, statistics, biology and the social sciences. As the first book to deal exclusively with …
[HTML][HTML] On the complexity of enumerating pseudo-intents
F Distel, B Sertkaya - Discrete Applied Mathematics, 2011 - Elsevier
We investigate whether the pseudo-intents of a given formal context can efficiently be
enumerated. We show that they cannot be enumerated in a specified lexicographic order …
enumerated. We show that they cannot be enumerated in a specified lexicographic order …
[HTML][HTML] The joy of implications, aka pure horn formulas: mainly a survey
M Wild - Theoretical Computer Science, 2017 - Elsevier
The joy of implications, aka pure Horn formulas: Mainly a survey - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
[PDF][PDF] Learning description logic knowledge bases from data using methods from formal concept analysis
F Distel - 2011 - Citeseer
An important field within Artificial Intelligence research is Knowledge Representation.
Description Logics (DL) are a succesful family of formalisms for Knowledge Representation …
Description Logics (DL) are a succesful family of formalisms for Knowledge Representation …
A fast incremental algorithm for constructing concept lattices
L Zou, Z Zhang, J Long - Expert Systems with Applications, 2015 - Elsevier
Incremental algorithms for constructing concept lattices can update a concept lattice
according to new objects added to the formal context. In this paper, we propose an efficient …
according to new objects added to the formal context. In this paper, we propose an efficient …
Attribute-incremental construction of the canonical implication basis
S Obiedkov, V Duquenne - Annals of Mathematics and Artificial …, 2007 - Springer
Attribute-incremental construction of the canonical implication basis Page 1 Ann Math Artif Intell
(2007) 49:77–99 DOI 10.1007/s10472-007-9057-2 Attribute-incremental construction of the …
(2007) 49:77–99 DOI 10.1007/s10472-007-9057-2 Attribute-incremental construction of the …