1169 search results - page 4 / 234 » Comparing performance of algorithms for generating concept l... |
DAWAK
2010
Springer
13 years 8 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...
IPM
2007
13 years 7 months ago
2007
We argue that the quality of a summary can be evaluated based on how many concepts in the original document(s) that reserved after summarization. Here, a concept refers to an abst...
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
AI
2006
Springer
13 years 11 months ago
2006
Springer
This paper studies the problem of classification by using a concept lattice as a search space of classification rules. The left hand side of a classification rule is composed by a ...
TNN
1998
13 years 7 months ago
1998
— This paper proposes two hierarchical schemes for learning, one for clustering and the other for classification problems. Both schemes can be implemented on a fuzzy lattice neu...