Sciweavers

10 search results - page 1 / 2
» gPrune: A Constraint Pushing Framework for Graph Pattern Min...
Sort
View
PAKDD
2007
ACM
166views Data Mining» more  PAKDD 2007»
13 years 10 months ago
gPrune: A Constraint Pushing Framework for Graph Pattern Mining
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset co...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
JIIS
2007
154views more  JIIS 2007»
13 years 4 months ago
Constraint-based sequential pattern mining: the pattern-growth methods
Constraints are essential for many sequential pattern mining applications. However, there is no systematic study on constraint-based sequential pattern mining. In this paper, we in...
Jian Pei, Jiawei Han, Wei Wang
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 4 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 5 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
VLDB
2000
ACM
130views Database» more  VLDB 2000»
13 years 8 months ago
Mining Frequent Itemsets Using Support Constraints
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
Ke Wang, Yu He, Jiawei Han