35 search results - page 5 / 7 » A new classification of datasets for frequent itemsets |
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
CIKM
2006
Springer
14 years 15 days ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
ADMA
2007
Springer
14 years 3 months ago
2007
Springer
The current research on association rule based text classification neglected several key problems. First, weights of elements in profile vectors may have much impact on generating ...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...