The paper presents additional results on factorization by similarity of fuzzy concept lattices. A fuzzy concept lattice is a hierarchically ordered collection of clusters extracted...
We present graded extension of the algorithm LinClosure. Graded LinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute implications. It can a...
Type signatures are common in modern linguistic theories. Their construction and maintenance is intricate, and therefore, an automatic induction method is desirable. In the present...
In this paper, we present research trends carried out in the Orpailleur team at loria, showing how knowledge discovery and knowledge processing may be combined. The knowledge disco...
Jean Lieber, Amedeo Napoli, Laszlo Szathmary, Yann...
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
Abstract. Design defects are poor design choices resulting in a hard-tomaintain software, hence their detection and correction are key steps of a disciplined software process aimed...
We present an application of formal concept analysis aimed at creating and representing a meaningful structure of knowledge communities under the form of a lattice-based taxonomy ...
Camille Roth, Sergei A. Obiedkov, Derrick G. Kouri...
In this paper, we propose a generic description of the concept lattice as classifier in an iterative recognition process. We also present the development of a new structural signat...
The problem of the relevance and the usefulness of extracted association rules is becoming of primary importance, since an overwhelming number of association rules may be derived f...
Ghada Gasmi, Sadok Ben Yahia, Engelbert Mephu Ngui...
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...