Sciweavers

108 search results - page 3 / 22
» Realization Problem for Formal Concept Analysis
Sort
View
CLA
2004
13 years 8 months ago
Fast Factorization of Concept Lattices by Similarity: Solution and an Open Problem
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
Radim Belohlávek, Jiri Dvorak, Jan Outrata
CLA
2006
13 years 8 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...
AO
2005
120views more  AO 2005»
13 years 7 months ago
Modes of concept definition and varieties of vagueness
The paper considers the problem of defining concepts within formal ontologies. A number of distinct modes of definition are identified, which represent alternative viewpoints on t...
Brandon Bennett
ICFCA
2009
Springer
14 years 2 months ago
Exploring Finite Models in the Description Logic
Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finit...
Franz Baader, Felix Distel
MDAI
2007
Springer
14 years 1 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...