Sciweavers

12 search results - page 1 / 3
» cla 2006
Sort
View
CLA
2006
13 years 6 months ago
Graded LinClosure and Its Role in Relational Data Analysis
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...
Radim Belohlávek, Vilém Vychodil
CLA
2006
13 years 6 months ago
Type Signature Induction with FCAType
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...
Wiebke Petersen
CLA
2006
13 years 6 months ago
Towards an Iterative Classification Based on Concept Lattice
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...
Stéphanie Guillas, Karell Bertet, Jean-Marc...
CLA
2006
13 years 6 months ago
Towards Concise Representation for Taxonomies of Epistemic Communities
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...
CLA
2006
13 years 6 months ago
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
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...
Peggy Cellier, Sébastien Ferré, Oliv...