166 search results - page 5 / 34 » Mining High Utility Itemsets in Big Data |
ICDM
2006
IEEE
15 years 4 months ago
2006
IEEE
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
CINQ
2004
Springer
15 years 3 months ago
2004
Springer
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
116
click to vote
KDD
2000
ACM
15 years 1 months ago
2000
ACM
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...
107
click to vote
SBACPAD
2003
IEEE
15 years 3 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...