数据挖掘 Renmin_Data Mining 83graph.pptVIP

Data Mining: Principles and Algorithms Data Mining:  Principles and Research Frontiers — Chapter 8.3 — — Graph Pattern Mining — ?Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign /~hanj Graph and Structured Pattern Mining Graph mining and its applications Frequent subgraph mining methods Closed graph pattern mining Graph indexing techniques Graph classification and clustering Similairty search in graph databases Summary Graph and Structured Pattern Mining Graph mining and its applications Frequent subgraph mining methods Closed graph pattern mining Graph indexing techniques Graph classification and clustering Similairty search in graph databases Summary Graph Mining Graphs are ubiquitous Web databases, XML databases Cheminformatics (chemical compound) Bioinformactics (protein structure, pathway) Workflow analysis Social network analysis Graph is a general model Trees, lattices, sequences, and items are degenerated graphs Graph algorithms: many have high complexity Diversity of graphs Directed vs. undirected, labeled vs. unlabeled (edges and vertices), angles/geometry, weighted edges Graph and Structured Pattern Mining Graph mining and its applications Frequent subgraph mining methods Closed graph pattern mining Graph indexing techniques Graph classification and clustering Similairty search in graph databases Summary Frequent Graph Pattern Mining Frequent subgraphs A (sub)graph is frequent if its support in a given dataset is no less than a minimum support threshold Applications Mining biochemical structures Mining XML structures or Web communities Trees, lattices, sequences, and items are degenerated graphs Example (Chemistry-informatics) Related Work AGM/AcGM: Inokuchi, et al. (PKDD’00) FSG/FSG2: Kuramochi, et al. (ICDM’01) Vanetik, et al. (ICDM’02) Borgelt, et al. (ICDM’02) gSpan: Yan and Han (ICDM’02) … Subgraph Explosion Problem An n-edge frequent graph may have 2n subgraphs. All of them are frequent too. Among 422 chemica