5 search results - page 1 / 1 » A lattice-free concept lattice update algorithm |
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
TAPOS
1998
13 years 4 months ago
1998
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices a...
DBWORKSHOPS
1992
13 years 6 months ago
1992
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
DAWAK
2010
Springer
13 years 6 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
ACTA
2000
13 years 4 months ago
2000
Thesaurus is a collection of words classified according to some relatedness measures among them. In this paper, we lay the theoretical foundations of thesaurus construction through...