Sciweavers

46 search results - page 6 / 10
» Discovering of Frequent Itemsets with CP-mine Algorithm
Sort
View
AAAI
2006
14 years 11 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...
PPOPP
2005
ACM
15 years 3 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
14 years 11 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
15 years 10 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
ICDE
2008
IEEE
133views Database» more  ICDE 2008»
15 years 4 months ago
Discovering popular co-cited communities in blogspaces
In a blogspace, citation behaviors reflect interests of bloggers. To fully get insight into the latent information in a blogspace, in this paper, we intend to mine popular co-cit...
Meng-Fen Chiang, Wen-Chih Peng, Chia-Hao Lo