Sciweavers

121 search results - page 4 / 25
» An Efficient Frequent Pattern Mining Method and its Parallel...
Sort
View
IEAAIE
2009
Springer
14 years 6 days ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 6 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
14 years 7 months ago
Mining Colossal Frequent Patterns by Core Pattern Fusion
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the exist...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, H...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 6 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
DAWAK
2004
Springer
13 years 11 months ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan