|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 3 of 8 found articles
| Title: |
A General Framework for Mining Frequent Subgraphs from Labeled Graphs |
| Author: |
Akihiro Inokuchi Takashi Washio Hiroshi Motoda |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 66 (2005) nr. 1-2 pages 53-82 |
| Year: |
2005-06-27 |
| Contents: |
The derivation of frequent subgraphs from a dataset of labeled graphs has high computational complexity because the hard problems of isomorphism and subgraph isomorphism have to be solved as part of this derivation. To deal with this computational complexity, all previous approaches have focused on one particular kind of graph. In this paper, we propose an approach to conduct a complete search for various classes of frequent subgraphs in a massive dataset of labeled graphs within a practical time. The power of our approach comes from the algebraic representation of graphs, its associated operations and well-organized bias constraints to limit the search space efficiently. The performance has been evaluated using real world datasets, and the high scalability and flexibility of our approach have been confirmed with respect to the amount of data and the computation time. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 3 of 8 found articles
| << previous | next >> |