166 search results - page 9 / 34 » Mining High Utility Itemsets in Big Data |
125
click to vote
KDD
2007
ACM
16 years 2 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...
124
click to vote
SDM
2004
SIAM
15 years 3 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
126
Voted
JIIS
2008
15 years 1 months ago
2008
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
110
Voted
SDM
2003
SIAM
15 years 3 months ago
2003
SIAM
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
107
Voted
RIDE
1997
IEEE
15 years 6 months ago
1997
IEEE
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the databas...