Sciweavers

352 search results - page 17 / 71
» Non-derivable itemset mining
Sort
View
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
14 years 2 months ago
Finding Good Itemsets by Packing Data
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...
Nikolaj Tatti, Jilles Vreeken
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 2 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
PAKDD
2007
ACM
148views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Mining Frequent Itemsets from Uncertain Data
Abstract. We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions whose items are associated with existential...
Chun Kit Chui, Ben Kao, Edward Hung
DMKD
1999
ACM
108views Data Mining» more  DMKD 1999»
13 years 12 months ago
Classification as Mining and Use of Labeled Itemsets
We investigate the relationship between association and classification mining. The main issue in association mining is the discovery of interesting patterns of the data, so called...
Dimitris Meretakis, Beat Wüthrich
DKE
2008
159views more  DKE 2008»
13 years 7 months ago
Isolated items discarding strategy for discovering high utility itemsets
Traditional methods of association rule mining consider the appearance of an item in a transaction, whether or not it is purchased, as a binary variable. However, customers may pu...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang