Sciweavers

9 search results - page 1 / 2
» Minimum Description Length Principle: Generators Are Prefera...
Sort
View
AAAI
2006
13 years 6 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...
SDM
2008
SIAM
125views Data Mining» more  SDM 2008»
13 years 6 months ago
Mining and Ranking Generators of Sequential Patterns
Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements...
David Lo, Siau-Cheng Khoo, Jinyan Li
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
13 years 9 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
EDBT
2009
ACM
138views Database» more  EDBT 2009»
13 years 11 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
SDM
2012
SIAM
289views Data Mining» more  SDM 2012»
11 years 7 months ago
Mining Compressing Sequential Patterns
Compression based pattern mining has been successfully applied to many data mining tasks. We propose an approach based on the minimum description length principle to extract seque...
Hoang Thanh Lam, Fabian Moerchen, Dmitriy Fradkin,...