2009 | OriginalPaper | Buchkapitel
Discovery of Correlated Sequential Subgraphs from a Sequence of Graphs
verfasst von : Tomonobu Ozaki, Takenao Ohkawa
Erschienen in: Advanced Data Mining and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Dynamic graphs
or a sequence of graphs attract much attention recently. In this paper, as a first step towards finding significant patterns hidden in dynamic graphs, we consider the problem of mining successive sequence of subgraphs which appear frequently in a long sequence of graphs. In addition, to exclude insignificant patterns, we take into account the mutual dependency measured by
θ
-correlation coefficient among the components in patterns. An algorithm named CorSSS, which utilizes the generality ordering of patterns effectively, is developed for enumerating all frequent and correlated patterns. The effectiveness of CorSSS, is confirmed through the experiments using real datasets.