Sciweavers

156 search results - page 9 / 32
» Mining Frequent Itemsets from Secondary Memory
Sort
View
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
KAIS
2008
150views more  KAIS 2008»
13 years 7 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
ICDM
2005
IEEE
157views Data Mining» more  ICDM 2005»
14 years 1 months ago
Blocking Anonymity Threats Raised by Frequent Itemset Mining
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...
SAC
2010
ACM
14 years 21 days ago
Mining interesting sets and rules in relational databases
In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...
Bart Goethals, Wim Le Page, Michael Mampaey
ICDM
2005
IEEE
166views Data Mining» more  ICDM 2005»
14 years 1 months ago
An Algorithm for In-Core Frequent Itemset Mining on Streaming Data
Frequent itemset mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major...
Ruoming Jin, Gagan Agrawal