Lecture07-2-Out-of-Core-Cocain

Lecture07-2-Out-of-Core-Cocain - Out-of-Core Coherent...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
1 2009/11/19 Out-of-Core Coherent Closed Quasi-Clique Mining from Large Dense Graph Databases Jianyong Wang Department of Computer Science and Technology Tsinghua University, Beijing, P.R. China Email: jianyong@tsinghua.edu.cn — Joint work with Zhiping Zeng, Lizhu Zhou, and George Karypis
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 2009/11/19 Case study 1: an initial solution - Frequent Closed Clique Mining The CLAN algorithm CLAN stands for Frequent closed CL ique p A tter N mining Case Study 2: a more complex solution - Frequent Coherent Closed Quasi-Clique Mining The Cocain algorithm Cocain stands for Co herent c losed qu a si-cl i que mi n ing Case Study 3: an out-of-core solution - Out-of-core Coherent Closed Quasi-Clique Mining The Cocain* algorithm Frequent Coherent Closed Subgraph Mining Case Studies
Background image of page 2
3 2009/11/19 Part 1: Closed Clique Mining
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 2009/11/19 CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases Jianyong Wang 1 , Zhiping Zeng 2 , Lizhu Zhou 3 { 1 jianyong, 3 dcszlz}@tsinghua.edu.cn 2 clipse.zeng@gmail.com Department of Computer Science and Technology Tsinghua University, Beijing, P.R. China — Proc. 2006 IEEE Int. Conf. on Data Engineering. (ICDE'06)
Background image of page 4
5 2009/11/19 Outline Problem definition and motivation - Problem definition - Motivation The CLAN solution - Canonical form of a clique - Efficient clique enumeration Low-degree vertex pruning Structural redundancy pruning - Closed clique discovery Clique closure checking scheme Non-closed prefix pruning - Integrated algorithm Empirical results Conclusions
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 2009/11/19 Problem Formulation
Background image of page 6
7 2009/11/19 Preliminaries Input database D: a set of undirected labeled input graphs. Undirected labeled input graph G G={V, E, L V , F V } V: the set of vertices E: the set of edges, L V : the set of vertex labels Cardinality of graph G: |G|= |V| Note: in this work, we do not consider the edge labels. V V E V V L V F :
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8 2009/11/19 Preliminaries Induced subgraph: - An induced subgraph is a subset of the vertices of a graph together with any edges whose endpoints are both in this subset. Examples: - V(G 2 )={v 1 ,v 2 ,v 3 ,v 4 ,v 5 ,v 6 } - E(G 2 )={(v1,v2), } - L v (G 2 )={a, b, c, d, e} - Card(G 2 )=6 u 4 u 3 u 5 Induced Subgraph of G 1 c d b
Background image of page 8
2009/11/19 Preliminaries Clique: a clique C is a fully connected subgraph Clique Isomorphism : - A clique C 1 ={V 1 , L 1 , F 1 } is isomorphic to another clique C 2 ={V 2 , L 2 , F 2 } iff |V 1 |=| V 2 | and there exists a bijection f: V 1 V 2 such that Subclique and Superclique : - If a clique C is isomorphic to a subgraph of another clique C , C is called a subclique of C , while C is called a superclique of C. We use C C or C C (C C but C≠C ) to denote the subclique or proper subclique relationship. )) ( ( ) ( , 2
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 82

Lecture07-2-Out-of-Core-Cocain - Out-of-Core Coherent...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online