Presentation is loading. Please wait.

Presentation is loading. Please wait.

Graph and Tensor Mining for fun and profit

Published byCarol Watson Modified over 6 years ago

Similar presentations

Presentation on theme: "Graph and Tensor Mining for fun and profit"— Presentation transcript:

1 Graph and Tensor Mining for fun and profit
Faloutsos Graph and Tensor Mining for fun and profit Luna Dong, Christos Faloutsos Andrey Kan, Jun Ma, Subho Mukherjee

2 Roadmap Introduction – Motivation Part#1: Graphs
Faloutsos Roadmap Introduction – Motivation Part#1: Graphs P1.1: properties/patterns in graphs P1.2: node importance P1.3: community detection P1.4: fraud/anomaly detection P1.5: belief propagation KDD 2018 Dong+

3 Roadmap Introduction – Motivation Part#1: Graphs
Faloutsos Roadmap Introduction – Motivation Part#1: Graphs P1.1: properties/patterns in graphs P1.2: node importance P1.3: community detection P1.4: fraud/anomaly detection P1.5: belief propagation ? KDD 2018 Dong+

4 Roadmap Introduction – Motivation Part#1: Graphs
Faloutsos Roadmap Introduction – Motivation Part#1: Graphs P1.1: properties/patterns in graphs P1.2: node importance P1.3: community detection Algorithm Warning: ‘no good cuts’ P1.4: fraud/anomaly detection ? KDD 2018 Dong+

5 Problem Given a graph, and k Break it into k (disjoint) communities
KDD 2018 Dong+

6 Short answer METIS [Karypis, Kumar] KDD 2018 Dong+

7 Solution#1: METIS Arguably, the best algorithm Open source, at
and *many* related papers, at same url Main idea: coarsen the graph; partition; un-coarsen KDD 2018 Dong+

8 Solution #1: METIS G. Karypis and V. Kumar. METIS 4.0: Unstructured graph partitioning and sparse matrix ordering system. TR, Dept. of CS, Univ. of Minnesota, 1998. <and many extensions> KDD 2018 Dong+

9 Solutions #2,3… Fiedler vector (2nd singular vector of Laplacian).
Modularity: Community structure in social and biological networks M. Girvan and M. E. J. Newman, PNAS June 11, (12) ; Co-clustering: [Dhillon+, KDD’03] Clustering on the A2 (square of adjacency matrix) [Zhou, Woodruff, PODS’04] Minimum cut / maximum flow [Flake+, KDD’00] …. KDD 2018 Dong+

10 Roadmap Introduction – Motivation Part#1: Graphs
Faloutsos Roadmap Introduction – Motivation Part#1: Graphs P1.1: properties/patterns in graphs P1.2: node importance P1.3: community detection Algorithm Warning: ‘no good cuts’ P1.4: fraud/anomaly detection ? KDD 2018 Dong+

11 A word of caution BUT: often, there are no good cuts: KDD 2018 Dong+

12 A word of caution BUT: often, there are no good cuts: KDD 2018 Dong+

13 A word of caution Maybe there are no good cuts: ``jellyfish’’ shape [Tauro+’01], [Siganos+,’06], strange behavior of cuts [Chakrabarti+’04], [Leskovec+,’08] KDD 2018 Dong+

14 A word of caution Maybe there are no good cuts: ``jellyfish’’ shape [Tauro+’01], [Siganos+,’06], strange behavior of cuts [Chakrabarti+,’04], [Leskovec+,’08] ? ? KDD 2018 Dong+

15 R1: Jellyfish model [Tauro+]
… A Simple Conceptual Model for the Internet Topology, L. Tauro, C. Palmer, G. Siganos, M. Faloutsos, Global Internet, November 25-29, 2001 Jellyfish: A Conceptual Model for the AS Internet Topology G. Siganos, Sudhir L Tauro, M. Faloutsos, J. of Communications and Networks, Vol. 8, No. 3, pp , Sept KDD 2018 Dong+

16 R1: Jellyfish model [Tauro+]
… A Simple Conceptual Model for the Internet Topology, L. Tauro, C. Palmer, G. Siganos, M. Faloutsos, Global Internet, November 25-29, 2001 Jellyfish: A Conceptual Model for the AS Internet Topology G. Siganos, Sudhir L Tauro, M. Faloutsos, J. of Communications and Networks, Vol. 8, No. 3, pp , Sept KDD 2018 Dong+

17 R1: Jellyfish model [Tauro+]
… A Simple Conceptual Model for the Internet Topology, L. Tauro, C. Palmer, G. Siganos, M. Faloutsos, Global Internet, November 25-29, 2001 Jellyfish: A Conceptual Model for the AS Internet Topology G. Siganos, Sudhir L Tauro, M. Faloutsos, J. of Communications and Networks, Vol. 8, No. 3, pp , Sept KDD 2018 Dong+

18 R2: 'Familiar strangers’
Bipartite graph (‘heterophily’) ‘lawyers’ 'eng.’ eng. ? lawyers ? KDD 2018 Dong+

19 R3: ``Core-periphery’’
Bipartite graph + clique Main members ? satellites ? KDD 2018 Dong+

20 Strange behavior of min cuts
‘negative dimensionality’ (!) log (# edges) log (mincut-size / #edges) Clickstream graph Slope~ -0.45 1-1/d NetMine: New Mining Tools for Large Graphs, by D. Chakrabarti, Y. Zhan, D. Blandford, C. Faloutsos and G. Blelloch, in the SDM 2004 Workshop on Link Analysis, Counter-terrorism and Privacy Statistical Properties of Community Structure in Large Social and Information Networks, J. Leskovec, K. Lang, A. Dasgupta, M. Mahoney. WWW 2008. KDD 2018 Dong+

21 Strange behavior of min cuts
‘negative dimensionality’ (!) log (# edges) log (mincut-size / #edges) Clickstream graph Slope~ -0.45 1-1/d NetMine: New Mining Tools for Large Graphs, by D. Chakrabarti, Y. Zhan, D. Blandford, C. Faloutsos and G. Blelloch, in the SDM 2004 Workshop on Link Analysis, Counter-terrorism and Privacy Statistical Properties of Community Structure in Large Social and Information Networks, J. Leskovec, K. Lang, A. Dasgupta, M. Mahoney. WWW 2008. KDD 2018 Dong+

22 Short answer METIS [Karypis, Kumar] (but: maybe NO good cuts exist!)
KDD 2018 Dong+

23 Roadmap Introduction – Motivation Part#1: Graphs
Faloutsos Roadmap Introduction – Motivation Part#1: Graphs P1.1: properties/patterns in graphs P1.2: node importance P1.3: community detection P1.4: fraud/anomaly detection P1.5: belief propagation KDD 2018 Dong+

Download ppt "Graph and Tensor Mining for fun and profit"

Similar presentations

Class 12: Communities Network Science: Communities Dr. Baruch Barzel.

Class 12: Communities Network Science: Communities Dr. Baruch Barzel.
1 Dynamics of Real-world Networks Jure Leskovec Machine Learning Department Carnegie Mellon University

1 Dynamics of Real-world Networks Jure Leskovec Machine Learning Department Carnegie Mellon University
Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.

Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.
CMU SCS Large Graph Mining - Patterns, Explanations and Cascade Analysis Christos Faloutsos CMU.

CMU SCS Large Graph Mining - Patterns, Explanations and Cascade Analysis Christos Faloutsos CMU.
School of Computer Science Carnegie Mellon University Duke University DeltaCon: A Principled Massive- Graph Similarity Function Danai Koutra Joshua T.

School of Computer Science Carnegie Mellon University Duke University DeltaCon: A Principled Massive- Graph Similarity Function Danai Koutra Joshua T.
CMU SCS 15-826: Multimedia Databases and Data Mining Lecture #21: Tensor decompositions C. Faloutsos.

CMU SCS : Multimedia Databases and Data Mining Lecture #21: Tensor decompositions C. Faloutsos.
KDD 2009 Scalable Graph Clustering using Stochastic Flows Applications to Community Discovery Venu Satuluri and Srinivasan Parthasarathy Data Mining Research.

KDD 2009 Scalable Graph Clustering using Stochastic Flows Applications to Community Discovery Venu Satuluri and Srinivasan Parthasarathy Data Mining Research.
CMU SCS 15-826Copyright: C. Faloutsos (2012)#1 15-826: Multimedia Databases and Data Mining Lecture #27: Graph mining - Communities and a paradox Christos.

CMU SCS Copyright: C. Faloutsos (2012)# : Multimedia Databases and Data Mining Lecture #27: Graph mining - Communities and a paradox Christos.
The Connectivity and Fault-Tolerance of the Internet Topology

The Connectivity and Fault-Tolerance of the Internet Topology
Community Detection Laks V.S. Lakshmanan (based on Girvan & Newman. Finding and evaluating community structure in networks. Physical Review E 69, 026113.

Community Detection Laks V.S. Lakshmanan (based on Girvan & Newman. Finding and evaluating community structure in networks. Physical Review E 69,
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.

Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
Jure Leskovec, CMU Kevin Lang, Anirban Dasgupta, Michael Mahoney Yahoo! Research.

Jure Leskovec, CMU Kevin Lang, Anirban Dasgupta, Michael Mahoney Yahoo! Research.
1 Modularity and Community Structure in Networks* Final project *Based on a paper by M.E.J Newman in PNAS 2006.

1 Modularity and Community Structure in Networks* Final project *Based on a paper by M.E.J Newman in PNAS 2006.
CMU SCS 15-826Copyright: C. Faloutsos (2014)#1 15-826: Multimedia Databases and Data Mining Lecture #29: Graph mining - Generators & tools Christos Faloutsos.

CMU SCS Copyright: C. Faloutsos (2014)# : Multimedia Databases and Data Mining Lecture #29: Graph mining - Generators & tools Christos Faloutsos.
NetMine: Mining Tools for Large Graphs Deepayan Chakrabarti Yiping Zhan Daniel Blandford Christos Faloutsos Guy Blelloch.

NetMine: Mining Tools for Large Graphs Deepayan Chakrabarti Yiping Zhan Daniel Blandford Christos Faloutsos Guy Blelloch.
N EIGHBORHOOD F ORMATION AND A NOMALY D ETECTION IN B IPARTITE G RAPHS Jimeng Sun, Huiming Qu, Deepayan Chakrabarti & Christos Faloutsos Jimeng Sun, Huiming.

N EIGHBORHOOD F ORMATION AND A NOMALY D ETECTION IN B IPARTITE G RAPHS Jimeng Sun, Huiming Qu, Deepayan Chakrabarti & Christos Faloutsos Jimeng Sun, Huiming.
Discovering Overlapping Groups in Social Media Xufei Wang, Lei Tang, Huiji Gao, and Huan Liu Arizona State University.

Discovering Overlapping Groups in Social Media Xufei Wang, Lei Tang, Huiji Gao, and Huan Liu Arizona State University.
Neighborhood Formation and Anomaly Detection in Bipartite Graphs Jimeng Sun Huiming Qu Deepayan Chakrabarti Christos Faloutsos Speaker: Jimeng Sun.

Neighborhood Formation and Anomaly Detection in Bipartite Graphs Jimeng Sun Huiming Qu Deepayan Chakrabarti Christos Faloutsos Speaker: Jimeng Sun.
Visual Mining of Communities in Complex Networks: Bringing Humans Into the Loop Perceptual Science and Technology REU Jack Murtagh & Florentina Ferati.

Visual Mining of Communities in Complex Networks: Bringing Humans Into the Loop Perceptual Science and Technology REU Jack Murtagh & Florentina Ferati.
Clustering (Part II) 11/26/07. Spectral Clustering.

Clustering (Part II) 11/26/07. Spectral Clustering.

Similar presentations

Ads by Google