|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 3 van 8 gevonden artikelen
| Titel: |
A General Framework for Mining Frequent Subgraphs from Labeled Graphs |
| Auteur: |
Akihiro Inokuchi Takashi Washio Hiroshi Motoda |
| Verschenen in: |
Fundamenta informaticae |
| Paginering: | Jaargang 66 (2005) nr. 1-2 pagina's 53-82 |
| Jaar: |
2005-06-27 |
| Inhoud: |
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. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 3 van 8 gevonden artikelen
| << vorige | volgende >> |