Sciweavers

28 search results - page 5 / 6
» A Distributed Privacy-Preserving Association Rules Mining Sc...
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 5 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
13 years 9 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 9 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
CEAS
2008
Springer
13 years 7 months ago
A Campaign-based Characterization of Spamming Strategies
This paper presents a methodology for the characterization of spamming strategies based on the identification of spam campaigns. To deeply understand how spammers abuse network re...
Pedro Calais, Douglas Pires, Dorgival Olavo Guedes...
SPAA
1997
ACM
13 years 9 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...