Presentation is loading. Please wait.

Presentation is loading. Please wait.

CMU SCS Large Graph Mining Christos Faloutsos CMU.

Similar presentations


Presentation on theme: "CMU SCS Large Graph Mining Christos Faloutsos CMU."— Presentation transcript:

1 CMU SCS Large Graph Mining Christos Faloutsos CMU

2 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

3 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

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

5 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

6 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 ?? ?

7 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

8 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

9 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

10 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

11 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

12 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

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

14 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

15 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

16 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’

17 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 http://arxiv.org/abs/1004.0060 G2 theorem ~10 pages proof

18 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 = λ.

19 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

20 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

21 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

22 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

23 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’ ✔

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

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

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

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

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


Download ppt "CMU SCS Large Graph Mining Christos Faloutsos CMU."

Similar presentations


Ads by Google