Sciweavers

322 search results - page 18 / 65
» Mining Frequent Tree-Like Patterns in Large Datasets
Sort
View
ICDM
2002
IEEE
178views Data Mining» more  ICDM 2002»
14 years 19 days ago
gSpan: Graph-Based Substructure Pattern Mining
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
Xifeng Yan, Jiawei Han
PAKDD
2010
ACM
208views Data Mining» more  PAKDD 2010»
13 years 9 months ago
Efficient Pattern Mining of Uncertain Data with Sampling
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
Toon Calders, Calin Garboni, Bart Goethals
SAC
2004
ACM
14 years 1 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
ICDM
2007
IEEE
155views Data Mining» more  ICDM 2007»
13 years 11 months ago
Transitional Patterns and Their Significant Milestones
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...
Qian Wan, Aijun An
PODS
2003
ACM
151views Database» more  PODS 2003»
14 years 7 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...