Searching for "Mining N-most Interesting Itemsets." – sorted by Relevance.
-
Mining N-most Interesting Itemsets
- Mining N-most Interesting Itemsets Ada Wai-chee Fu Renfrew Wang-wai Kwong Jian Tang Department
- Cited by 11 (1 self) – Add To MetaCart
-
Mining frequent itemsets without support threshold: with and without item constraints
- with the assumption of an optimally chosen support threshold. We also propose the mining of “N-most interesting k-itemsets
- Cited by 3 (0 self) – Add To MetaCart
-
Techniques in Data Mining: Decision Trees Classification and Constraint-based Itemsets Mining
- is another important data mining problem. In particular, mining the N -most interesting itemsets is a new
- Add To MetaCart
-
unknown title
- -Chung Ngan, Tsang Lam, Raymond Chi-Wing Wong and Ada Wai-Chee Fu, “Mining N-most Interesting Itemsets without
- Add To MetaCart

