Sciweavers

12 search results - page 2 / 3
» Private Itemset Support Counting
Sort
View
ISCI
2007
99views more  ISCI 2007»
13 years 5 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 6 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou
KDD
2002
ACM
189views Data Mining» more  KDD 2002»
14 years 5 months ago
Sequential PAttern mining using a bitmap representation
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
Jay Ayres, Jason Flannick, Johannes Gehrke, Tomi Y...
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
13 years 5 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig
DASFAA
2004
IEEE
125views Database» more  DASFAA 2004»
13 years 8 months ago
Reducing Communication Cost in a Privacy Preserving Distributed Association Rule Mining
Data mining is a process that analyzes voluminous digital data in order to discover hidden but useful patterns from digital data. However, discovery of such hidden patterns has sta...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith