88 search results - page 9 / 18 » Further Pruning for Efficient Association Rule Discovery |
151
click to vote
APPINF
2003
15 years 7 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
161
click to vote
EDBT
2000
ACM
15 years 9 months ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
168
click to vote
DATAMINE
2006
15 years 6 months ago
2006
Existing algorithms for mining association patterns often rely on the support-based pruning strategy to prune a combinatorial search space. However, this strategy is not effective ...
145
click to vote
KDD
1997
ACM
15 years 9 months ago
1997
ACM
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
173
click to vote
JCST
2008
15 years 6 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...