CMU SCS Large Graph Mining Christos Faloutsos CMU.

Slides:



Advertisements
Similar presentations
Christos Faloutsos CMU
Advertisements

CMU SCS Large Graph Mining - Patterns, Explanations and Cascade Analysis Christos Faloutsos CMU.
1 Dynamics of Real-world Networks Jure Leskovec Machine Learning Department Carnegie Mellon University
On the Vulnerability of Large Graphs
CMU SCS Large Graph Mining - Patterns, Explanations and Cascade Analysis Christos Faloutsos CMU.
CMU SCS I2.2 Large Scale Information Network Processing INARC 1 Overview Goal: scalable algorithms to find patterns and anomalies on graphs 1. Mining Large.
Influence propagation in large graphs - theorems and algorithms B. Aditya Prakash Christos Faloutsos
Dynamical Processes on Large Networks B. Aditya Prakash Carnegie Mellon University MMS, SIAM AN, Minneapolis, July 10,
CMU SCS Mining Billion-Node Graphs - Patterns and Algorithms Christos Faloutsos CMU.
CMU SCS : Multimedia Databases and Data Mining Lecture #26: Graph mining - patterns Christos Faloutsos.
© 2012 IBM Corporation IBM Research Gelling, and Melting, Large Graphs by Edge Manipulation Joint Work by Hanghang Tong (IBM) B. Aditya Prakash (Virginia.
CMU SCS Mining Billion-Node Graphs - Patterns and Algorithms Christos Faloutsos CMU.
CMU SCS Large Graph Mining - Patterns, Tools and Cascade Analysis Christos Faloutsos CMU.
Making Diffusion Work for You B. Aditya Prakash Computer Science Virginia Tech. GraphEx Symposium, MIT Endicott House, Aug 21, 2014.
Dynamical Processes on Large Networks B. Aditya Prakash Carnegie Mellon University UMD-College Park, April 26, 2012.
CMU SCS C. Faloutsos (CMU)#1 Large Graph Algorithms Christos Faloutsos CMU McGlohon, Mary Prakash, Aditya Tong, Hanghang Tsourakakis, Babis Akoglu, Leman.
CMU SCS Mining Billion-node Graphs Christos Faloutsos CMU.
SCS CMU Joint Work by Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, Philip S. Yu, Christos Faloutsos Speaker: Hanghang Tong Aug , 2008, Las Vegas.
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.
CMU SCS Large Graph Mining Christos Faloutsos CMU.
SCS CMU Proximity Tracking on Time- Evolving Bipartite Graphs Speaker: Hanghang Tong Joint Work with Spiros Papadimitriou, Philip S. Yu, Christos Faloutsos.
CMU SCS Graph and stream mining Christos Faloutsos CMU.
U. Michigan participation in EDIN Lada Adamic, PI E 2.1 fractional immunization of networks E 2.1 time series analysis approach to correlating structure.
CMU SCS Yahoo/Hadoop, 2008#1 Peta-Graph Mining Christos Faloutsos Prakash, Aditya Shringarpure, Suyash Tsourakakis, Charalampos Appel, Ana Chau, Polo Leskovec,
CMU SCS Large Graph Mining – Patterns, Tools and Cascade analysis Christos Faloutsos CMU.
CMU SCS Large Graph Mining – Patterns, Tools and Cascade analysis Christos Faloutsos CMU.
CMU SCS Large Graph Mining - Patterns, Tools and Cascade Analysis Christos Faloutsos CMU.
Influence propagation in large graphs - theorems and algorithms B. Aditya Prakash Christos Faloutsos
Understanding and Managing Cascades on Large Graphs B. Aditya Prakash Computer Science Virginia Tech. CS Seminar 11/30/2012.
Understanding and Managing Cascades on Large Graphs B. Aditya Prakash Carnegie Mellon University  Virginia Tech. Christos Faloutsos Carnegie Mellon University.
CMU SCS KDD'09Faloutsos, Miller, Tsourakakis P0-1 Large Graph Mining: Power Tools and a Practitioner’s guide Christos Faloutsos Gary Miller Charalampos.
Making Diffusion Work for You: From Social Media to Epidemiology B. Aditya Prakash Computer Science Virginia Tech. BSEC Conference, ORNL, Aug 26, 2015.
CMU SCS Mining Billion-node Graphs: Patterns, Generators and Tools Christos Faloutsos CMU.
CMU SCS Large Graph Mining Christos Faloutsos CMU.
CMU SCS U Kang (CMU) 1KDD 2012 GigaTensor: Scaling Tensor Analysis Up By 100 Times – Algorithms and Discoveries U Kang Christos Faloutsos School of Computer.
Interacting Viruses in Networks: Can Both Survive? Authors: Alex Beutel, B. Aditya Prakash, Roni Rosenfeld, and Christos Faloutsos Presented by: Zachary.
CMU SCS Mining Billion-Node Graphs Christos Faloutsos CMU.
CMU SCS Graph Mining - surprising patterns in real graphs Christos Faloutsos CMU.
CMU SCS Big (graph) data analytics Christos Faloutsos CMU.
CMU SCS Mining Billion Node Graphs Christos Faloutsos CMU.
Winner-takes-all: Competing Viruses or Ideas on fair-play Networks B. Aditya Prakash, Alex Beutel, Roni Rosenfeld, Christos Faloutsos Carnegie Mellon University,
CMU SCS Mining Large Graphs: Fraud Detection, and Algorithms Christos Faloutsos CMU.
Influence propagation in large graphs - theorems and algorithms B. Aditya Prakash Christos Faloutsos
ECML-PKDD 2010, Barcelona, Spain B. Aditya Prakash*, Hanghang Tong* ^, Nicholas Valler+, Michalis Faloutsos+, Christos Faloutsos* * Carnegie Mellon University,
Propagation on Large Networks B. Aditya Prakash Christos Faloutsos Carnegie Mellon University.
ParCube: Sparse Parallelizable Tensor Decompositions
CMU SCS Graph Mining: patterns and tools for static and time-evolving graphs Christos Faloutsos CMU.
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu, Mary McGlohon, Christos Faloutsos Carnegie Mellon University School.
CS 1944: Sophomore Seminar Big Data and Machine Learning B. Aditya Prakash Assistant Professor Nov 3, 2015.
Propagation on Large Networks B. Aditya Prakash Christos Faloutsos Carnegie Mellon University.
Propagation on Large Networks
CMU SCS Patterns, Anomalies, and Fraud Detection in Large Graphs Christos Faloutsos CMU.
CMU SCS Mining Large Social Networks: Patterns and Anomalies Christos Faloutsos CMU.
CMU SCS KDD'09Faloutsos, Miller, Tsourakakis P9-1 Large Graph Mining: Power Tools and a Practitioner’s guide Christos Faloutsos Gary Miller Charalampos.
Understanding and Managing Cascades on Large Graphs B. Aditya Prakash Virginia Tech. Christos Faloutsos Carnegie Mellon University Sept 28, Tutorial, ECML-PKDD.
CMU SCS Panel: Social Networks Christos Faloutsos CMU.
SCS CMU Speaker Hanghang Tong Colibri: Fast Mining of Large Static and Dynamic Graphs Speaking Skill Requirement.
Arizona State University Fast Eigen-Functions Tracking on Dynamic Graphs Chen Chen and Hanghang Tong - 1 -
CMU SCS Anomaly Detection in Large Graphs Christos Faloutsos CMU.
Anomaly detection in large graphs
Anomaly detection in large graphs
Part 1: Graph Mining – patterns
15-826: Multimedia Databases and Data Mining
Graph and Tensor Mining for fun and profit
Graph and Tensor Mining for fun and profit
Graph and Tensor Mining for fun and profit
Graph and Tensor Mining for fun and profit
Large Graph Mining: Power Tools and a Practitioner’s guide
Presentation transcript:

CMU SCS Large Graph Mining Christos Faloutsos CMU

CMU SCS (c) 2013, C. Faloutsos 2 Roadmap Introduction – Motivation Past work: –Big graph mining (‘Pegasus’/hadoop) –Propagation / immunization Ongoing & future work: –(big) tensors –brain data Conclusions MLD-AB

CMU SCS (Big) Graphs - Why study them? Human Disease Network [Barabasi 2007] Gene Regulatory Network [Decourty 2008] Facebook [2010] >1B nodes, >$10B The Internet [2005] C. Faloutsos (CMU) 3 SUM'13

CMU SCS (c) 2013, C. Faloutsos 4 (Big) Graphs - why study them? web-log (‘blog’) news propagation computer network security: /IP traffic and anomaly detection Recommendation systems.... Many-to-many db relationship -> graph MLD-AB

CMU SCS (c) 2013, C. Faloutsos 5 Roadmap Introduction – Motivation Past work: –Big graph mining (‘Pegasus’/hadoop) –Propagation / immunization Ongoing/future: (big) tensors / brain data Conclusions MLD-AB

CMU SCS Triangle counting for large graphs? Anomalous nodes in Twitter(~ 3 billion edges) [U Kang, Brendan Meeder, +, PAKDD’11] 6 MLD-AB 6 (c) 2013, C. Faloutsos ?? ?

CMU SCS Triangle counting for large graphs? Anomalous nodes in Twitter(~ 3 billion edges) [U Kang, Brendan Meeder, +, PAKDD’11] 7 MLD-AB 7 (c) 2013, C. Faloutsos

CMU SCS Triangle counting for large graphs? Anomalous nodes in Twitter(~ 3 billion edges) [U Kang, Brendan Meeder, +, PAKDD’11] 8 MLD-AB 8 (c) 2013, C. Faloutsos

CMU SCS Triangle counting for large graphs? Anomalous nodes in Twitter(~ 3 billion edges) [U Kang, Brendan Meeder, +, PAKDD’11] 9 MLD-AB 9 (c) 2013, C. Faloutsos

CMU SCS (c) 2013, C. Faloutsos 10 Roadmap Introduction – Motivation Past work: –Big graph mining (‘Pegasus’/hadoop) –Propagation / immunization Ongoing & future work: –(big) tensors –brain data Conclusions MLD-AB

CMU SCS Fractional Immunization of Networks B. Aditya Prakash, Lada Adamic, Theodore Iwashyna (M.D.), Hanghang Tong, Christos Faloutsos SDM 2013, Austin, TX (c) 2013, C. Faloutsos 11 MLD-AB

CMU SCS Whom to immunize? Dynamical Processes over networks Each circle is a hospital ~3,000 hospitals More than 30,000 patients transferred [US-MEDICARE NETWORK 2005] Problem: Given k units of disinfectant, whom to immunize? (c) 2013, C. Faloutsos 12 MLD-AB

CMU SCS Fractional Asymmetric Immunization Hospital Another Hospital Drug-resistant Bacteria (like XDR-TB) (c) 2013, C. Faloutsos 13 MLD-AB

CMU SCS Whom to immunize? CURRENT PRACTICEOUR METHOD [US-MEDICARE NETWORK 2005] ~6x fewer! (c) 2013, C. Faloutsos 14 MLD-AB Hospital-acquired inf. : 99K+ lives, $5B+ per year

CMU SCS Running Time SimulationsSMART-ALLOC > 1 week Wall-Clock Time ≈ 14 secs > 30,000x speed-up! better (c) 2013, C. Faloutsos 15 MLD-AB

CMU SCS What is the ‘silver bullet’? A: Try to decrease connectivity of graph Q: how to measure connectivity? A: first eigenvalue of adjacency matrix Q1: why?? MLD-AB(c) 2013, C. Faloutsos 16 Avg degree Max degree Diameter Modularity ‘Conductance’

CMU SCS Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks B. Aditya Prakash, Deepayan Chakrabarti, Michalis Faloutsos, Nicholas Valler, Christos Faloutsos IEEE ICDM 2011, Vancouver extended version, in arxiv G2 theorem ~10 pages proof

CMU SCS Our thresholds for some models s = effective strength s < 1 : below threshold (c) 2013, C. Faloutsos 18 MLD-AB Models Effective Strength (s) Threshold (tipping point) SIS, SIR, SIRS, SEIR s = λ. s = 1 SIV, SEIV s = λ. ( H.I.V. ) s = λ.

CMU SCS Our thresholds for some models s = effective strength s < 1 : below threshold (c) 2013, C. Faloutsos 19 MLD-AB Models Effective Strength (s) Threshold (tipping point) SIS, SIR, SIRS, SEIR s = λ. s = 1 SIV, SEIV s = λ. ( H.I.V. ) s = λ. No immunity Temp. immunity w/ incubation

CMU SCS (c) 2013, C. Faloutsos 20 Roadmap Introduction – Motivation Past work: –Big graph mining (‘Pegasus’/hadoop) –Propagation / immunization Ongoing & future work: –(big) tensors –brain data Conclusions MLD-AB

CMU SCS Brain data MLD-AB(c) 2013, C. Faloutsos 21 Which neurons get activated by ‘bee’ How wiring evolves Modeling epilepsy N. Sidiropoulos George Karypis V. Papalexakis Tom Mitchell

CMU SCS GigaTensor [KDD’12] NELL = never ending language learner – triplets like ‘obama’ ‘is president of’ ‘USA’ (ie, object-verb- subject) 30M x 30M x 15M Find ‘concepts’ (= latent variables) MLD-AB(c) 2013, C. Faloutsos 22

CMU SCS Preliminary results 60 words (‘bee’, ‘apple’, ‘hammer’) 80 questions (‘is it alive’, ‘can it hurt you’) Brain-scan, for each word MLD-AB(c) 2013, C. Faloutsos 23 Alive?Can hurt you?… ‘apple’ ‘beetle’ ✔ ‘hammer’ ✔

CMU SCS Preliminary results MLD-AB(c) 2013, C. Faloutsos 24

CMU SCS Preliminary results MLD-AB(c) 2013, C. Faloutsos 25 Premotor cortex

CMU SCS (c) 2013, C. Faloutsos 26 CONCLUSION#1 – Big data Large datasets reveal patterns/outliers that are invisible otherwise MLD-AB

CMU SCS CONCLUSION #2 – Cross disciplinarity MLD-AB(c) 2013, C. Faloutsos 27

CMU SCS CONCLUSION #2 – Cross disciplinarity MLD-AB(c) 2013, C. Faloutsos 28 Thank you! Questions?