R-MAT: A Recursive Model for Graph Mining Deepayan Chakrabarti Yiping Zhan Christos Faloutsos.

Slides:

Advertisements

Similar presentations

1 Dynamics of Real-world Networks Jure Leskovec Machine Learning Department Carnegie Mellon University

Advertisements

1 Realistic Graph Generation and Evolution Using Kronecker Multiplication Jurij Leskovec, CMU Deepay Chakrabarti, CMU/Yahoo Jon Kleinberg, Cornell Christos.

Analysis and Modeling of Social Networks Foudalis Ilias.

CHARALAMPOS E. TSOURAKAKIS SCHOOL OF COMPUTER SCIENCE CARNEGIE MELLON UNIVERSITY Fast counting of triangles in large networks without counting: Algorithms.

Lecture 21 Network evolution Slides are modified from Jurij Leskovec, Jon Kleinberg and Christos Faloutsos.

Kronecker Graphs: An Approach to Modeling Networks Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, Zoubin Ghahramani Presented.

What did we see in the last lecture?. What are we going to talk about today? Generative models for graphs with power-law degree distribution Generative.

On Power-Law Relationships of the Internet Topology Michalis Faloutsos Petros Faloutsos Christos Faloutsos.

CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.

The influence of search engines on preferential attachment Dan Li CS3150 Spring 2006.

1 A Random-Surfer Web-Graph Model (Joint work with Avrim Blum & Hubert Chan) Mugizi Rwebangira.

More on Rankings. Query-independent LAR Have an a-priori ordering of the web pages Q: Set of pages that contain the keywords in the query q Present the.

DATA MINING LECTURE 12 Link Analysis Ranking Random walks.

Mining and Searching Massive Graphs (Networks)

Modeling Real Graphs using Kronecker Multiplication

CMU SCS C. Faloutsos (CMU)#1 Large Graph Algorithms Christos Faloutsos CMU McGlohon, Mary Prakash, Aditya Tong, Hanghang Tsourakakis, Babis Akoglu, Leman.

NetMine: Mining Tools for Large Graphs Deepayan Chakrabarti Yiping Zhan Daniel Blandford Christos Faloutsos Guy Blelloch.

Weighted Graphs and Disconnected Components Patterns and a Generator Mary McGlohon, Leman Akoglu, Christos Faloutsos Carnegie Mellon University School.

Social Networks and Graph Mining Christos Faloutsos CMU - MLD.

CMU SCS KDD 2006Leskovec & Faloutsos1 ??. CMU SCS KDD 2006Leskovec & Faloutsos2 Sampling from Large Graphs poster# 305 Jurij (Jure) Leskovec Christos.

1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.

Web as Graph – Empirical Studies The Structure and Dynamics of Networks.

CS Lecture 6 Generative Graph Models Part II.

Zdravko Markov and Daniel T. Larose, Data Mining the Web: Uncovering Patterns in Web Content, Structure, and Usage, Wiley, Slides for Chapter 1:

Sampling from Large Graphs. Motivation Our purpose is to analyze and model social networks –An online social network graph is composed of millions of.

RTG: A Recursive Realistic Graph Generator using Random Typing Leman Akoglu and Christos Faloutsos Carnegie Mellon University.

On Power-Law Relationships of the Internet Topology CSCI 780, Fall 2005.

Analysis of the Internet Topology Michalis Faloutsos, U.C. Riverside (PI) Christos Faloutsos, CMU (sub- contract, co-PI) DARPA NMS, no

1 Dong Lu, Peter A. Dinda Prescience Laboratory Department of Computer Science Northwestern University Evanston, IL GridG: Synthesizing Realistic.

CMU SCS Graph and stream mining Christos Faloutsos CMU.

CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.

CMU SCS Yahoo/Hadoop, 2008#1 Peta-Graph Mining Christos Faloutsos Prakash, Aditya Shringarpure, Suyash Tsourakakis, Charalampos Appel, Ana Chau, Polo Leskovec,

On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.

1 A Random-Surfer Web-Graph Model Avrim Blum, Hubert Chan, Mugizi Rwebangira Carnegie Mellon University.

HCC class lecture 22 comments John Canny 4/13/05.

Computer Science 1 Web as a graph Anna Karpovsky.

On Power-Law Relationships of the Internet Topology.

Alan Frieze Charalampos (Babis) E. Tsourakakis WAW June ‘12 WAW '121.

Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial

1 Tools for Large Graph Mining Thesis Committee:  Christos Faloutsos  Chris Olston  Guy Blelloch  Jon Kleinberg (Cornell) - Deepayan Chakrabarti.

Information Networks Introduction to networks Lecture 1.

Weighted Graphs and Disconnected Components Patterns and a Generator IDB Lab 현근수 In KDD 08. Mary McGlohon, Leman Akoglu, Christos Faloutsos.

CMU SCS KDD'09Faloutsos, Miller, Tsourakakis P0-1 Large Graph Mining: Power Tools and a Practitioner’s guide Christos Faloutsos Gary Miller Charalampos.

Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.

COM1721: Freshman Honors Seminar A Random Walk Through Computing Lecture 2: Structure of the Web October 1, 2002.

Vertices and Edges Introduction to Graphs and Networks Mills College Spring 2012.

Jure Leskovec Computer Science Department Cornell University / Stanford University Joint work with: Jon Kleinberg (Cornell), Christos.

Random Graph Generator University of CS 8910 – Final Research Project Presentation Professor: Dr. Zhu Presented: December 8, 2010 By: Hanh Tran.

Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.

Du, Faloutsos, Wang, Akoglu Large Human Communication Networks Patterns and a Utility-Driven Generator Nan Du 1,2, Christos Faloutsos 2, Bai Wang 1, Leman.

Models and Algorithms for Complex Networks Introduction and Background Lecture 1.

RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu, Mary McGlohon, Christos Faloutsos Carnegie Mellon University School.

Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.

Class 2: Graph Theory IST402. Can one walk across the seven bridges and never cross the same bridge twice? Network Science: Graph Theory THE BRIDGES OF.

Ljiljana Rajačić. Page Rank Web as a directed graph  Nodes: Web pages  Edges: Hyperlinks 2 / 25 Ljiljana Rajačić.

Class 2: Graph Theory IST402.

1 Patterns of Cascading Behavior in Large Blog Graphs Jure Leskoves, Mary McGlohon, Christos Faloutsos, Natalie Glance, Matthew Hurst SDM 2007 Date:2008/8/21.

CMU SCS KDD'09Faloutsos, Miller, Tsourakakis P9-1 Large Graph Mining: Power Tools and a Practitioner’s guide Christos Faloutsos Gary Miller Charalampos.

Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.

Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.

Basic Concepts Graphs For more notes and topics visit:

PEGASUS: A PETA-SCALE GRAPH MINING SYSTEM

NetMine: Mining Tools for Large Graphs

Tools for Large Graph Mining

CS200: Algorithm Analysis

Part 1: Graph Mining – patterns

R-MAT: A Recursive Model for Graph Mining

Graph and Tensor Mining for fun and profit

Dynamics of Real-world Networks

Graph and Tensor Mining for fun and profit

Presentation transcript:

R-MAT: A Recursive Model for Graph Mining Deepayan Chakrabarti Yiping Zhan Christos Faloutsos

Introduction Internet Map [lumeta.com] Food Web [Martinez ’91] Protein Interactions [genomebiology.com]  Graphs are ubiquitous  “Patterns”  regularities that occur in many graphs  We want a realistic and efficient graph generator  which matches many patterns  and would be very useful for simulation studies.

Graph Patterns Count vs Indegree Count vs Outdegree Hop-plot Effective Diameter Power Laws Eigenvalue vs Rank “Network values” vs Rank Count vs Stress

Our Proposed Generator a =0.4 c= 0.15 d= 0.3 b= 0.15 ab c d ….. Initially Choose quadrant b Choose quadrant c and so on Final cell chosen, “drop” an edge here.

Our Proposed Generator c Communities Cross-community links b d Shows a “community” effect Linux guys Windows guys c b Communities within communities a d RedHat Mandrake

Experiments (Epinions directed graph) Count vs IndegreeCount vs OutdegreeHop-plot Eigenvalue vs Rank“Network value” Count vs Stress Effective Diameter ►R-MAT matches directed graphs

Experiments (Clickstream bipartite graph) Count vs IndegreeCount vs OutdegreeHop-plot Left “Network value” Right “Network value” ►R-MAT matches bipartite graphs Singular value vs Rank

Experiments (Epinions undirected graph) ►R-MAT matches undirected graphs Count vs Indegree Hop-plotSingular value vs Rank “Network value” Count vs Stress

Conclusions The R-MAT graph generator matches the patterns mentioned before along with DGX/lognormal degree distributions  can be shown theoretically exhibits a “Community” effect generates undirected, directed, bipartite and weighted graphs with ease requires only 3 parameters (a,b,c), and, is fast and scalable  O(E logN)

The “DGX”/lognormal distribution Deviations from power-laws have been observed [Pennock+ ’02] These are well-modeled by the DGX distribution [Bi+’01] Essentially fits a parabola instead of a line to the log-log plot. Degree Count “Devoted” surfer “Drifting” surfers Clickstream data

Our Proposed Generator R-MAT (Recursive MATrix) [SIAM DM’04] 2n2n 2n2n Subdivide the adjacency matrix and choose one quadrant with probability (a,b,c,d) Recurse till we reach a 1*1 cell where we place an edge and repeat for all edges. a = 0.4 c = 0.15d = 0.3 b = 0.15