Sciweavers

237 search results - page 13 / 48
» Mining Frequent Itemsets Using Re-Usable Data Structure
Sort
View
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 5 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
ICDM
2008
IEEE
95views Data Mining» more  ICDM 2008»
14 years 2 months ago
Publishing Sensitive Transactions for Itemset Utility
We consider the problem of publishing sensitive transaction data with privacy preservation. High dimensionality of transaction data poses unique challenges on data privacy and dat...
Yabo Xu, Benjamin C. M. Fung, Ke Wang, Ada Wai-Che...
KES
2004
Springer
14 years 1 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 9 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 13 days ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu