CMU SCS Panel: Social Networks Christos Faloutsos CMU.

Slides:

Advertisements

Similar presentations

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

Advertisements

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.

School of Computer Science Carnegie Mellon University National Taiwan University of Science & Technology Unifying Guilt-by-Association Approaches: Theorems.

Milena Mihail Theory Applications driving technology :  Th e Internet Phenomenon : - New Computational Paradigm  Biology, Genomics Theory is/has historically.

CMU SCS Copyright: C. Faloutsos (2012)# : Multimedia Databases and Data Mining Lecture #27: Graph mining - Communities and a paradox Christos.

CMU SCS : Multimedia Databases and Data Mining Extra: intro to hadoop C. Faloutsos.

1 Social Influence Analysis in Large-scale Networks Jie Tang 1, Jimeng Sun 2, Chi Wang 1, and Zi Yang 1 1 Dept. of Computer Science and Technology Tsinghua.

Frequent Subgraph Pattern Mining on Uncertain Graph Data

SFU, CMPT 741, Fall 2009, Martin Ester 418 Outlook Outline Trends in KDD research Graph mining and social network analysis Recommender systems Information.

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.

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.

Neighborhood Formation and Anomaly Detection in Bipartite Graphs Jimeng Sun Huiming Qu Deepayan Chakrabarti Christos Faloutsos Speaker: Jimeng Sun.

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.

Cascading Behavior in Large Blog Graphs: Patterns and a model offence.

Network Motifs Zach Saul CS 289 Network Motifs: Simple Building Blocks of Complex Networks R. Milo et al.

CMU SCS Bio-informatics, Graph and Stream mining Christos Faloutsos CMU.

CMU SCS Graph and stream mining Christos Faloutsos CMU.

A scalable multilevel algorithm for community structure detection

CMU SCS Graph Mining and Influence Propagation Christos Faloutsos CMU.

The community-search problem and how to plan a successful cocktail party Mauro SozioAris Gionis Max Planck Institute, Germany Yahoo! Research, Barcelona.

CMPT 884, SFU, Martin Ester, Special Topics in Database Systems Martin Ester Simon Fraser University School of Computing Science CMPT 884 Spring.

1 IEEE Intelligent Systems, Special Issue on Social Learning, 2010.

CMU SCS Graph Mining: Laws, Generators and Tools Christos Faloutsos CMU.

CMU SCS : Multimedia Databases and Data Mining Lecture #30: Conclusions C. Faloutsos.

CMU SCS Big (graph) data analytics Christos Faloutsos CMU.

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

CMU SCS Large Graph Mining Christos Faloutsos CMU.

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

Jure Leskovec PhD: Machine Learning Department, CMU Now: Computer Science Department, Stanford University.

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.

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

CMU SCS Big (graph) data analytics Christos Faloutsos CMU.

CMU SCS Mining Billion Node Graphs Christos Faloutsos CMU.

KDD 2007, San Jose Fast Direction-Aware Proximity for Graph Mining Speaker: Hanghang Tong Joint work w/ Yehuda Koren, Christos Faloutsos.

CMU SCS Mining Large Graphs: Fraud Detection, and Algorithms Christos Faloutsos CMU.

What is Web 2.0?. Web 2.0 It is more than Technology It is technology’s impact on the human condition We are linked up more than ever before Our digital.

CMU SCS KDD '09Faloutsos, Miller, Tsourakakis P5-1 Large Graph Mining: Power Tools and a Practitioner’s guide Task 5: Graphs over time & tensors Faloutsos,

Hanghang Tong, Brian Gallagher, Christos Faloutsos, Tina Eliassi-Rad

KDD 2007, San Jose Fast Direction-Aware Proximity for Graph Mining Speaker: Hanghang Tong Joint work w/ Yehuda Koren, Christos Faloutsos.

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.

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

Center-Piece Subgraphs: Problem definition and Fast Solutions Hanghang Tong Christos Faloutsos Carnegie Mellon University.

CMU SCS Mining Large Social Networks: Patterns and Anomalies Christos Faloutsos CMU.

CMU SCS Graph Mining: Laws, Generators and Tools Christos Faloutsos CMU.

Mining of Massive Datasets Edited based on Leskovec’s from

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

Carnegie Mellon KDD04Faloutsos, McCurley & Tomkins1 Fast Discovery of Connection Subgraphs Christos Faloutsos (CMU) Kevin McCurley (IBM) Andrew Tomkins.

CMU SCS KDD '09Faloutsos, Miller, Tsourakakis P8-1 Large Graph Mining: Power Tools and a Practitioner’s guide Task 8: hadoop and Tera/Peta byte graphs.

Large Graph Mining: Power Tools and a Practitioner’s guide

Introduction to Web Mining

NetMine: Mining Tools for Large Graphs

Social and Information Network Analysis: Review of Key Concepts

Graph and Tensor Mining for fun and profit

Large Graph Mining: Power Tools and a Practitioner’s guide

CS7280: Special Topics in Data Mining Information/Social Networks

Large Graph Mining: Power Tools and a Practitioner’s guide

Graph and Tensor Mining for fun and profit

Graph and Tensor Mining for fun and profit

Christos Faloutsos CMU

Graph and Tensor Mining for fun and profit

Large Graph Mining: Power Tools and a Practitioner’s guide

CS 345A Data Mining Lecture 1

CS 345A Data Mining Lecture 1

Introduction to Web Mining

CS 345A Data Mining Lecture 1

Presentation transcript:

CMU SCS Panel: Social Networks Christos Faloutsos CMU

CMU SCS KDD panel 2008C. Faloutsos 2 Successes surprising patterns (older: 6 degrees; weak ties) power laws small/shrinking diameters navigability; ‘web as a bow tie’ influence curves ~ sigmoid

CMU SCS KDD panel 2008C. Faloutsos 3 Successes – cont’ed Great tools graph partitioning – community detection [spectral, METIS, co-clustering, etc] frequent subgraphs and graph indexing [Han+, Zaki+, Karypis+,...] node proximity [Volinsky/Coren; Tong+;...] connection subgraphs [Tomkins+], CePS, G-ray [Tong+] tensors [Kolda+, Sun+,...]

CMU SCS KDD panel 2008C. Faloutsos 4 Successes - cont’d Impact better predictions (eg., [Hill, Provost, Volinsky: ‘Network-based marketing’], [Jensen & Neville]); fraud detection ([Chau+, Sun+,... ]) recommendation systems (Amazon, Netflix,...) blog analysis [Tomkins+]; cascades

CMU SCS KDD panel 2008C. Faloutsos 5 Non-technical Obstacles Many interesting datasets are ‘secret’ –but data owners often provide access under NDA Privacy concerns

CMU SCS KDD panel 2008C. Faloutsos 6 Opportunities Companies/government WANT to analyze their data, and usually they welcome any help Collecting/crawling data is easier than ever HW continues getting cheaper/faster/better (1Tb disk ~ USD200)

CMU SCS KDD panel 2008C. Faloutsos 7 Technical Challenges High level: Scalability: Petabytes of data [Fayyad’07] cross-disciplinarity (CS + Econ + Soc +...)

CMU SCS KDD panel 2008C. Faloutsos 8 Technical Challenges – cont’d Grand challenge: ‘theory of everything’: how real SN are generated, how they evolve, how rumors/opinions propagate in them how often humans build/drop links...

CMU SCS KDD panel 2008C. Faloutsos 9 Conclusion Scalability – map/reduce and hadoop Cross-disciplinarity: give and take tools to/from: –databases and operating systems –game theory (‘incentives’) –linear algebra (SVD, tensors, etc) –other network settings (computer networks, protein-protein interaction networks, etc)

CMU SCS KDD panel 2008C. Faloutsos 10 Contact info: www. cs.cmu.edu /~christos Thank you!