Sciweavers

313 search results - page 15 / 63
» Mining Frequent Itemsets in a Stream
Sort
View
DKE
2008
113views more  DKE 2008»
14 years 9 months ago
An efficient algorithm for mining closed inter-transaction itemsets
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
Anthony J. T. Lee, Chun-sheng Wang, Wan-Yu Weng, Y...
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
15 years 2 months ago
CP-summary: a concise representation for browsing frequent itemsets
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
CIKM
2006
Springer
15 years 1 months ago
Efficient mining of max frequent patterns in a generalized environment
This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment....
Daniel Kunkle, Donghui Zhang, Gene Cooperman
ICDM
2005
IEEE
157views Data Mining» more  ICDM 2005»
15 years 3 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...
ICMCS
2006
IEEE
344views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Pattern Mining in Visual Concept Streams
Pattern mining algorithms are often much easier applied than quantitatively assessed. In this paper we address the pattern evaluation problem by looking at both the capability of ...
Lexing Xie, Shih-Fu Chang