Sciweavers

263 search results - page 7 / 53
» kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
Sort
View
CIS
2005
Springer
15 years 3 months ago
An Improved EMASK Algorithm for Privacy-Preserving Frequent Pattern Mining
Abstract. As a novel research direction, privacy-preserving data mining (PPDM) has received a great deal of attentions from more and more researchers, and a large number of PPDM al...
Congfu Xu, Jinlong Wang, Hongwei Dan, Yunhe Pan
ISMVL
2009
IEEE
161views Hardware» more  ISMVL 2009»
15 years 4 months ago
Mining Approximative Descriptions of Sets Using Rough Sets
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from data sets, a problem of intere...
Dan A. Simovici, Selim Mimaroglu
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
15 years 11 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
JIIS
2010
106views more  JIIS 2010»
14 years 4 months ago
A new classification of datasets for frequent itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
Frédéric Flouvat, Fabien De Marchi, ...
64
Voted
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
15 years 10 months ago
Frequent pattern mining with uncertain data
In this paper, we will examine the frequent pattern mining for uncertain data sets. We will show how the broad classes of algorithms can be extended to the uncertain data setting....
Charu C. Aggarwal, Yan Li, Jianyong Wang, Jing Wan...