Sciweavers

731 search results - page 8 / 147
» Taxonomy-superimposed graph mining
Sort
View
CINQ
2004
Springer
182views Database» more  CINQ 2004»
13 years 11 months ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 8 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 8 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
14 years 8 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
14 years 1 months ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl