Sciweavers

136 search results - page 16 / 28
» CloseGraph: mining closed frequent graph patterns
Sort
View
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 5 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
PREMI
2005
Springer
14 years 1 months ago
Towards Generic Pattern Mining
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Template...
Mohammed Javeed Zaki, Nilanjana De, Feng Gao, Nage...
IFIP12
2007
13 years 9 months ago
Clustering Improves the Exploration of Graph Mining Results
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
CAIP
2009
Springer
155views Image Analysis» more  CAIP 2009»
14 years 2 months ago
Algorithms for the Sample Mean of Graphs
Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution propo...
Brijnesh J. Jain, Klaus Obermayer
SBBD
2007
126views Database» more  SBBD 2007»
13 years 9 months ago
Constraint-based Tree Pattern Mining
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...