Jure Leskovec Computer Science Department Cornell University / Stanford University
|
|
- Aileen Reed
- 5 years ago
- Views:
Transcription
1 Jure Leskovec Computer Science Department Cornell University / Stanford University
2 Large on line systems have detailed records of human activity On line communities: Facebook (64 million users, billion dollar business) MySpace (300 million users) Communication: Instant Messenger (~1 billion users) News and Social media: Blogging (250 million blogs world wide, presidential candidates run blogs) On line worlds: World of Warcraft (internal economy 1 billion USD) Second Life (GDP of 700 million USD in 07) 2
3 a) World wide web b) Internet (AS) c) Social networks d) Communication e) Citations f) Protein interactions 3
4 We know lots about the network structure: Properties: Scale free [Barabasi 99], 6 degrees of separation [Milgram 67], Small world [Watts Strogatz 98], Bipartite cores [Kumar et al. 99], Network motifs [Milo et al. 02], We Communities know much [Newman less 99], Hubs and authorities [Page et al. 98, Kleinberg 99] about processes and Models: Preferential attachment [Barabasi 99], Smallworld [Watts Strogatz dynamics 98], of Copying networks model [Kleinberg el al. 99], Heuristically optimized tradeoffs [Fabrikant et al. 02],Latent Space Models [Raftery et al. 02], Searchability [Kleinberg 00],Bowtie[Broder et al. 00], Exponential Random Graphs [Frank Strauss 86], Transitstub [Zegura 97], Jellyfish [Tauro et al. 01] 4
5 Network Dynamics: Network evolution How network structure changes as the network grows and evolves? Diffusion and cascading behavior How do rumors and diseases spread over networks? 5
6 We need massive network data for the patterns to emerge: MSN Messenger network [WWW 08] (the largest social network ever analyzed) 240M people, 255B messages, 4.5 TB data Product recommendations [EC 06] 4M people, 16M recommendations Blogosphere [work in progress] 60M posts, 120M links 6
7 Diffusion & Cascades Network Evolution Patterns & Observations Models & Algorithms Q1: What do cascades look like? Q2: How likely are people to get influenced? Q3: How do we find influential nodes? Q4: How do we quickly detect epidemics? Q5: How does network structure change as the network grows/evolves? Q6:How do we generate realistic looking and evolving networks? 7
8 Diffusion & Cascades Network Evolution Patterns & Observations Models & Algorithms Q1: What do cascades look like? Q2: How likely are people to get influenced? Q3: How do we find influential nodes? Q4: How do we quickly detect epidemics? Q5: How does network structure change as the network grows/evolves? Q6:How do we generate realistic looking and evolving networks? 8
9 Behavior that cascades from node to node like an epidemic News, opinions, rumors Word of mouth in marketing Infectious diseases As activations spread through the network they leave a trace a cascade Cascade Network (propagation graph) 9
10 Network diffusion has been extensively studied: Human behavior [Granovetter 78] Diseases and epidemics [Bailey 75] Innovations [Rogers We know 95] much less On the web [Gruhl et al. 04] about individual Organizations [Burt 04, Aral Brynjolfsson van Alstyne 07] For marketing cascading purposes [Richardson Domingos events that 02, Hill Provost Volinsky lead 06] to diffusion Trading behaviors [Hirshleifer et al. 94] Decision making [Bikhchandani 98, Surowiecky 05] 10
11 [w/ Adamic Huberman, EC 06] People send and receive product recommendations, purchase products 10% credit 10% off Data: Large online retailer: 4 million people, 16 million recommendations, 500k products 11
12 [w/ Glance Hurst et al., SDM 07] Bloggers write posts and refer (link) to other posts and the information propagates Data: 10.5 million posts, 16 million links 12
13 [w/ Kleinberg Singh, PAKDD 06] propagation Are they stars? Chains? Trees? Information cascades (blogosphere): Viral marketing (DVD recommendations): Viral marketing cascades are more social: Collisions (no summarizers) Richer non tree structures (ordered by frequency) 13
14 Prob. of adoption depends on the number of friends who have adopted [Bass 69, Shelling 78] What is the shape? Distinction has consequences for models and algorithms Prob. of adoption Prob. of adoption To find the answer we need lots of data k = number of friends adopting Diminishing returns? k = number of friends adopting Critical mass? 14
15 [w/ Adamic Huberman, EC 06] Probability of purchasing DVD recommendations (8.2 million observations) Adoption curve follows the # diminishing recommendations returns. received Can we exploit this? Later similar findings were made for group membership [Backstrom Huttenlocher Kleinberg 06], and probability of communication [Kossinets Watts 06] 15
16 Patterns & Observations Models & Algorithms Diffusion & Cascades A1: Cascade shapes A2: Human adoption follows diminishing returns Q3: How do we find influential nodes? Q4: How do we quickly detect epidemics? Network Evolution Q5: How does network structure change as the network grows/evolves? Q6:How do we generate realistic looking and evolving networks? 16
17 Blogs information epidemics Which are the influential/infectious blogs? Viral marketing Who are the trendsetters? Influential people? Disease spreading Where to place monitoring stations to detect epidemics? 17
18 [w/ Krause Guestrin et al., KDD 07] c 1 c 3 How to quickly detect epidemics as they spread? c 2 18
19 [w/ Krause Guestrin et al., KDD 07] Cost: Cost of monitoring is node dependent Reward: Minimize the number of affected nodes: If A are the monitored nodes, let R(A) denote the number of nodes we save We also consider other rewards: Minimize time to detection ( ) Maximize number of detected outbreaks A R(A) 19
20 Given: Graph G(V,E), budget M Data on how cascades C 1,, C i,,c K spread over time Select a set of nodes A maximizing the reward subject to cost(a) M Reward for detecting cascade i Solving the problem exactly is NP hard Max cover [Khuller et al. 99] 20
21 [w/ Krause Guestrin et al., KDD 07] Problem structure Submodularity of the reward functions (think of it as concavity ) CELF algorithm with approximate guarantee Speed up Lazy evaluation 21
22 [w/ Krause Guestrin et al., KDD 07] S 1 New monitored node: S S 1 S 3 S 2 Adding S helps a lot S 2 Adding S helps very S 4 little Placement A={S 1, S 2 } Placement B={S 1, S 2, S 3, S 4 } Gain of adding a node to small set is larger than gain of adding a node to large set Submodularity: diminishing returns, think of it as concavity ) 22
23 We must show R is submodular: A B R(A {u}) R(A) R(B {u}) R(B) Gain of adding a node to a small set Natural example: Sets A 1, A 2,, A n R(A) = size of union of A i (size of covered area) Gain of adding a node to a large set B A u If R 1,,R K are submodular, then R i is submodular 23
24 [w/ Krause Guestrin et al., KDD 07] Theorem: Reward function is submodular Consider cascade i: R i (u k ) = set of nodes saved from u k R i (A) = size of union R i (u k ), u k A R i is submodular Global optimization: R(A) = R i (A) R is submodular Cascade i u 2 R i (u 2 ) u 1 R i (u 1 ) 24
25 [w/ Krause Guestrin et al., KDD 07] We develop CELF algorithm: Two independent runs of a modified greedy Solution set A : ignore cost, greedily optimize reward Solution set A : greedily optimize reward/cost ratio Pick best of the two: arg max(r(a ), R(A )) a Theorem: If d R is submodular then CELF is b near optimal: c a c CELF achieves ½(1 1/e) factor approximation b Current solution: {a, {} {a} c} d e Marginal reward 25
26 Question: Which blogs should one read to be most up to date? Idea: Select blogs to cover the blogosphere. Each dot is a blog Proximity is based on the number of common cascades 26
27 [w/ Krause Guestrin et al., KDD 07] Which blogs should one read to catch big stories? CELF Reward (higher is better) In links Out links # posts (used by Technorati) Number of selected blogs (sensors) Random For more info see our website: 27
28 [w/ Krause et al., J. of Water Resource Planning] Given: a real city water distribution network data on how contaminants spread over time Place sensors (to save lives) Problem posed by the US Environmental Protection Agency S c 2 c 1 28
29 [w/ Ostfeld et al., J. of Water Resource Planning] Population saved (higher is better) Number of placed sensors CELF Our approach performed best at the Battle of Water Sensor Networks competition Degree Random Population Flow Author Score CMU (CELF) 26 Sandia 21 U Exter 20 Bentley systems 19 Technion (1) 14 Bordeaux 12 U Cyprus 11 U Guelph 7 U Michigan 4 Michigan Tech U 3 Malcolm 2 Proteo 2 Technion (2) 1 29
30 Patterns & Observations Models & Algorithms Diffusion & Cascades A1: Cascade shapes A2: Human adoption follows diminishing returns A3, A4: CELF algorithm for detecting cascades and outbreaks Network Evolution Q5: How does network structure change as the network grows/evolves? Q6: How do we generate realistic looking and evolving networks? 30
31 Empirical findings on real graphs led to new network models log prob. Model Explains log degree Power law degree distribution Preferential attachment Such models make assumptions/predictions about other network properties What about network evolution? 31
32 [w/ Kleinberg Faloutsos, KDD 05] What is the relation between the number of nodes and the edges over time? E(t) Internet a=1.2 Prior work assumes: constant average degree over time Networks are denser over time Densification Power Law: E(t) Citations N(t) a=1.6 a densification exponent (1 a 2) N(t) 32
33 [w/ Kleinberg Faloutsos, KDD 05] Prior models and intuition say that the network diameter slowly grows (like log N, log log N) diameter diameter What individual node Diameter shrinks over time behaviors are causing such as the network grows the distances between the nodes slowly decrease patterns? size of the graph time Internet Citations 33
34 [w/ Backstrom Kumar Tomkins, KDD 08] We directly observe atomic events of network evolution (and not only network snapshots) and so on for millions We observe evolution at finest scale Test individual edge attachment Directly observe events leading to network properties Compare network models by likelihood (and not by just summary network statistics) 34
35 [w/ Backstrom Kumar Tomkins, KDD 08] Network datasets Full temporal information from the first edge onwards LinkedIn (N=7m, E=30m), Flickr (N=600k, E=3m), Delicious (N=200k, E=430k), Answers (N=600k, E=2m) We study 3 processes that control the evolution P1) Node arrival: node enters the network P2) Edge initiation: node wakes up, initiates an edge, goes to sleep P3) Edge destination: where to attach a new edge Are edges more likely to attach to high degree nodes? Are edges more likely to attach to nodes that are close? 35
36 [w/ Backstrom Kumar Tomkins, KDD 08] Are edges more likely to connect to higher degree nodes? G np PA Flickr First direct proof of preferential attachment! p e ( k) Network τ k τ G np 0 PA 1 Flickr 1 Delicious 1 Answers 0.9 LinkedIn
37 [w/ Backstrom Kumar Tomkins, KDD 08] Just before the edge (u,w) is placed how many hops is between u and w? G np PA Flickr Fraction of triad closing edges Network % Δ Flickr 66% Delicious 28% Answers 23% LinkedIn 50% Real edges are local. Most of them close triangles! u v w 37
38 Want to generate realistic networks: Given a real network Generate a synthetic network Why synthetic graphs? Compare graphs properties, e.g., degree distribution Anomaly detection, Simulations, Predictions, Null model, Sharing privacy sensitive graphs, Q: Which network properties do we care about? Q: What is a good model and how do we fit it? 38
39 [w/ Chakrabarti Kleinberg Faloutsos, PKDD 05] Edge probability Edge probability p ij (3x3) (9x9) Initiator (27x27) Kronecker product of graph adjacency matrices (actually, there is also a nice social interpretation of the model) Given a real graph. We prove Kronecker graphs mimic real graphs: How to estimate the initiator G 1? Power law degree distribution, Densification, Shrinking/stabilizing diameter, Spectral properties 39
40 [w/ Faloutsos, ICML 07] Maximum likelihood estimation arg max G 1 P( ) Kronecker G 1 Naïve estimation takes O(N!N 2 ): N! for different node labelings: We estimate the Our solution: Metropolis sampling: N! (big) const model in O(E) N 2 for traversing graph adjacency matrix Our solution: Kronecker product (E << N 2 ): N 2 E Do stochastic gradient descent G = a b 1 c 40 d
41 [w/ Faloutsos, ICML 07] We search the space of ~10 1,000,000 permutations Fitting takes 2 hours Real and Kronecker are very close G1 = Degree distribution Path lengths Network values probability # reachable pairs network value node degree number of hops rank 41
42 [w/ Dasgupta Lang Mahoney, WWW 08] Fitting Epinions we obtained G 1 = What does this tell about the network structure? 0.5 edges Core periphery Core Periphery No communities 0.9 edges 0.1 edges No good cuts edges As opposed to: which gives a hierarchy
43 Small and large networks are fundamentally different Scientific collaborations (N=397, E=914) Collaboration 0.91 network 0.54 (N=4,158, 0.49E=13,422)
44 Why are networks the way they are? Only recently have basic properties been observed on a large scale Confirms social science intuitions; calls others into question. Benefits of working with large data What patterns do we observe in massive networks? What microscopic mechanisms cause them? Social network of the whole world? 44
45 [w/ Horvitz, WWW 08, Nature 08] Small world experiment [Milgram 67] People send letters from Nebraska to Boston How many steps does it take? Messenger social network largest network analyzed 240M people, 30B conversations, 4.5TB data Milgram s small world experiment MSN Messenger network Number of steps between pairs of people (i.e., hops + 1) 45
46 Predictive modeling of information diffusion When, where and what information will create a cascade? Where should one tap the network to get the effect they want? Social Media Marketing How do news and information spread New ranking and influence measures Sentiment analysis from cascade structure How to introduce incentives? 46
47 Observations: Data analysis Actively influencing the network Models: Predictions Algorithms: Applications 47
Jure Leskovec Machine Learning Department Carnegie Mellon University
Jure Leskovec Machine Learning Department Carnegie Mellon University Currently: Soon: Today: Large on line systems have detailed records of human activity On line communities: Facebook (64 million users,
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
HW2 Q1.1 parts (b) and (c) cancelled. HW3 released. It is long. Start early. CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/26/17 Jure Leskovec, Stanford
More informationViral Marketing and Outbreak Detection. Fang Jin Yao Zhang
Viral Marketing and Outbreak Detection Fang Jin Yao Zhang Paper 1: Maximizing the Spread of Influence through a Social Network Authors: David Kempe, Jon Kleinberg, Éva Tardos KDD 2003 Outline Problem Statement
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 11/13/17 Jure Leskovec, Stanford CS224W: Analysis of Networks, http://cs224w.stanford.edu 2 Observations Models
More informationAn Empirical Analysis of Communities in Real-World Networks
An Empirical Analysis of Communities in Real-World Networks Chuan Sheng Foo Computer Science Department Stanford University csfoo@cs.stanford.edu ABSTRACT Little work has been done on the characterization
More informationECS 289 / MAE 298, Lecture 15 Mar 2, Diffusion, Cascades and Influence, Part II
ECS 289 / MAE 298, Lecture 15 Mar 2, 2011 Diffusion, Cascades and Influence, Part II Diffusion and cascades in networks (Nodes in one of two states) Viruses (human and computer) contact processes epidemic
More informationAlgorithms and Applications in Social Networks. 2017/2018, Semester B Slava Novgorodov
Algorithms and Applications in Social Networks 2017/2018, Semester B Slava Novgorodov 1 Lesson #1 Administrative questions Course overview Introduction to Social Networks Basic definitions Network properties
More informationInformation Dissemination in Socially Aware Networks Under the Linear Threshold Model
Information Dissemination in Socially Aware Networks Under the Linear Threshold Model Srinivasan Venkatramanan and Anurag Kumar Department of Electrical Communication Engineering, Indian Institute of Science,
More informationScalable Modeling of Real Graphs using Kronecker Multiplication
Scalable Modeling of Real Graphs using Multiplication Jure Leskovec Christos Faloutsos Carnegie Mellon University jure@cs.cmu.edu christos@cs.cmu.edu Abstract Given a large, real graph, how can we generate
More informationJure Leskovec, Cornell/Stanford University. Joint work with Kevin Lang, Anirban Dasgupta and Michael Mahoney, Yahoo! Research
Jure Leskovec, Cornell/Stanford University Joint work with Kevin Lang, Anirban Dasgupta and Michael Mahoney, Yahoo! Research Network: an interaction graph: Nodes represent entities Edges represent interaction
More informationDecentralized Search
Link Analysis and Decentralized Search Markus Strohmaier, Denis Helic Multimediale l Informationssysteme t II 1 The Memex (1945) The Memex [Bush 1945]: B A mechanized private library for individual use
More informationAn Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization
An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization Pedro Ribeiro (DCC/FCUP & CRACS/INESC-TEC) Part 1 Motivation and emergence of Network Science
More informationIRIE: Scalable and Robust Influence Maximization in Social Networks
IRIE: Scalable and Robust Influence Maximization in Social Networks Kyomin Jung KAIST Republic of Korea kyomin@kaist.edu Wooram Heo KAIST Republic of Korea modesty83@kaist.ac.kr Wei Chen Microsoft Research
More informationCascading Behavior in Large Blog Graphs Patterns and a model
Cascading Behavior in Large Blog Graphs Patterns and a model Jure Leskovec, Mary McGlohon, Christos Faloutsos Natalie Glance, Matthew Hurst Abstract How do blogs cite and influence each other? How do such
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/4/2011 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu
More informationMaximizing the Spread of Influence through a Social Network. David Kempe, Jon Kleinberg and Eva Tardos
Maximizing the Spread of Influence through a Social Network David Kempe, Jon Kleinberg and Eva Tardos Group 9 Lauren Thomas, Ryan Lieblein, Joshua Hammock and Mary Hanvey Introduction In a social network,
More informationMaximizing the Spread of Influence through a Social Network
Maximizing the Spread of Influence through a Social Network By David Kempe, Jon Kleinberg, Eva Tardos Report by Joe Abrams Social Networks Infectious disease networks Viral Marketing Viral Marketing Example:
More informationExtracting Influential Nodes for Information Diffusion on a Social Network
Extracting Influential Nodes for Information Diffusion on a Social Network Masahiro Kimura Dept. of Electronics and Informatics Ryukoku University Otsu 520-2194, Japan kimura@rins.ryukoku.ac.jp Kazumi
More informationPart I Part II Part III Part IV Part V. Influence Maximization
Part I Part II Part III Part IV Part V Influence Maximization 1 Word-of-mouth (WoM) effect in social networks xphone is good xphone is good xphone is good xphone is good xphone is good xphone is good xphone
More informationCSE 190 Lecture 16. Data Mining and Predictive Analytics. Small-world phenomena
CSE 190 Lecture 16 Data Mining and Predictive Analytics Small-world phenomena Another famous study Stanley Milgram wanted to test the (already popular) hypothesis that people in social networks are separated
More informationChapter 1. Social Media and Social Computing. October 2012 Youn-Hee Han
Chapter 1. Social Media and Social Computing October 2012 Youn-Hee Han http://link.koreatech.ac.kr 1.1 Social Media A rapid development and change of the Web and the Internet Participatory web application
More informationOverview of the Stateof-the-Art. Networks. Evolution of social network studies
Overview of the Stateof-the-Art in Social Networks INF5370 spring 2014 Evolution of social network studies 1950-1970: mathematical studies of networks formed by the actual human interactions Pandemics,
More informationHow Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
How Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns Roadmap Next several lectures: universal structural properties of networks Each large-scale network is unique microscopically,
More informationDNE: A Method for Extracting Cascaded Diffusion Networks from Social Networks
DNE: A Method for Extracting Cascaded Diffusion Networks from Social Networks Motahhare Eslami, Hamid R. Rabiee, and Mostafa Salehi AICTC Research Center, Department of Computer Engineering Sharif University
More informationData mining --- mining graphs
Data mining --- mining graphs University of South Florida Xiaoning Qian Today s Lecture 1. Complex networks 2. Graph representation for networks 3. Markov chain 4. Viral propagation 5. Google s PageRank
More informationExtracting Information from Complex Networks
Extracting Information from Complex Networks 1 Complex Networks Networks that arise from modeling complex systems: relationships Social networks Biological networks Distinguish from random networks uniform
More informationOverlay (and P2P) Networks
Overlay (and P2P) Networks Part II Recap (Small World, Erdös Rényi model, Duncan Watts Model) Graph Properties Scale Free Networks Preferential Attachment Evolving Copying Navigation in Small World Samu
More informationMinimizing the Spread of Contamination by Blocking Links in a Network
Minimizing the Spread of Contamination by Blocking Links in a Network Masahiro Kimura Deptartment of Electronics and Informatics Ryukoku University Otsu 520-2194, Japan kimura@rins.ryukoku.ac.jp Kazumi
More informationSocial, Information, and Routing Networks: Models, Algorithms, and Strategic Behavior
Social, Information, and Routing Networks: Models, Algorithms, and Strategic Behavior Who? Prof. Aris Anagnostopoulos Prof. Luciana S. Buriol Prof. Guido Schäfer What will We Cover? Topics: Network properties
More informationThe Structure of Information Networks. Jon Kleinberg. Cornell University
The Structure of Information Networks Jon Kleinberg Cornell University 1 TB 1 GB 1 MB How much information is there? Wal-Mart s transaction database Library of Congress (text) World Wide Web (large snapshot,
More informationSubmodular Optimization in Computational Sustainability. Andreas Krause
Submodular Optimization in Computational Sustainability Andreas Krause Master Class at CompSust 2012 Combinatorial optimization in computational sustainability Many applications in computational sustainability
More informationCS249: SPECIAL TOPICS MINING INFORMATION/SOCIAL NETWORKS
CS249: SPECIAL TOPICS MINING INFORMATION/SOCIAL NETWORKS Overview of Networks Instructor: Yizhou Sun yzsun@cs.ucla.edu January 10, 2017 Overview of Information Network Analysis Network Representation Network
More informationAn Optimal Allocation Approach to Influence Maximization Problem on Modular Social Network. Tianyu Cao, Xindong Wu, Song Wang, Xiaohua Hu
An Optimal Allocation Approach to Influence Maximization Problem on Modular Social Network Tianyu Cao, Xindong Wu, Song Wang, Xiaohua Hu ACM SAC 2010 outline Social network Definition and properties Social
More informationCS224W Project Write-up Static Crawling on Social Graph Chantat Eksombatchai Norases Vesdapunt Phumchanit Watanaprakornkul
1 CS224W Project Write-up Static Crawling on Social Graph Chantat Eksombatchai Norases Vesdapunt Phumchanit Watanaprakornkul Introduction Our problem is crawling a static social graph (snapshot). Given
More informationBehavioral Data Mining. Lecture 9 Modeling People
Behavioral Data Mining Lecture 9 Modeling People Outline Power Laws Big-5 Personality Factors Social Network Structure Power Laws Y-axis = frequency of word, X-axis = rank in decreasing order Power Laws
More informationLecture 2: From Structured Data to Graphs and Spectral Analysis
Lecture 2: From Structured Data to Graphs and Spectral Analysis Radu Balan February 9, 2017 Data Sets Today we discuss type of data sets and graphs. The overarching problem is the following: Main Problem
More informationCS 224W Final Report Group 37
1 Introduction CS 224W Final Report Group 37 Aaron B. Adcock Milinda Lakkam Justin Meyer Much of the current research is being done on social networks, where the cost of an edge is almost nothing; the
More informationGraph Exploitation Testbed
Graph Exploitation Testbed Peter Jones and Eric Robinson Graph Exploitation Symposium April 18, 2012 This work was sponsored by the Office of Naval Research under Air Force Contract FA8721-05-C-0002. Opinions,
More informationTopic mash II: assortativity, resilience, link prediction CS224W
Topic mash II: assortativity, resilience, link prediction CS224W Outline Node vs. edge percolation Resilience of randomly vs. preferentially grown networks Resilience in real-world networks network resilience
More informationMAE 298, Lecture 9 April 30, Web search and decentralized search on small-worlds
MAE 298, Lecture 9 April 30, 2007 Web search and decentralized search on small-worlds Search for information Assume some resource of interest is stored at the vertices of a network: Web pages Files in
More informationCSE 158 Lecture 11. Web Mining and Recommender Systems. Triadic closure; strong & weak ties
CSE 158 Lecture 11 Web Mining and Recommender Systems Triadic closure; strong & weak ties Triangles So far we ve seen (a little about) how networks can be characterized by their connectivity patterns What
More informationInfluence Maximization in Location-Based Social Networks Ivan Suarez, Sudarshan Seshadri, Patrick Cho CS224W Final Project Report
Influence Maximization in Location-Based Social Networks Ivan Suarez, Sudarshan Seshadri, Patrick Cho CS224W Final Project Report Abstract The goal of influence maximization has led to research into different
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu HITS (Hypertext Induced Topic Selection) Is a measure of importance of pages or documents, similar to PageRank
More informationGraphs / Networks CSE 6242/ CX Basics, how to build & store graphs, laws, etc. Centrality, and algorithms you should know
CSE 6242/ CX 4242 Graphs / Networks Basics, how to build & store graphs, laws, etc. Centrality, and algorithms you should know Duen Horng (Polo) Chau Georgia Tech Partly based on materials by Professors
More informationCS 322: (Social and Information) Network Analysis Jure Leskovec Stanford University
CS 322: (Social and Information) Network Analysis Jure Leskovec Stanford University Course website: http://snap.stanford.edu/na09 Slides will be available online Reading material will be posted online:
More informationM.E.J. Newman: Models of the Small World
A Review Adaptive Informatics Research Centre Helsinki University of Technology November 7, 2007 Vocabulary N number of nodes of the graph l average distance between nodes D diameter of the graph d is
More informationDIFFUSION CASCADES: SPREADING PHENOMENA IN BLOG NETWORK COMMUNITIES ABDELHAMID SALAH BRAHIM
February 6, 22 2:5 WSPC/INSTRUCTION FILE Parallel Processing Letters c World Scientific Publishing Company DIFFUSION CASCADES: SPREADING PHENOMENA IN BLOG NETWORK COMMUNITIES ABDELHAMID SALAH BRAHIM BÉNÉDICTE
More informationCS224W Final Report Emergence of Global Status Hierarchy in Social Networks
CS224W Final Report Emergence of Global Status Hierarchy in Social Networks Group 0: Yue Chen, Jia Ji, Yizheng Liao December 0, 202 Introduction Social network analysis provides insights into a wide range
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu Setting from the last class: AB-A : gets a AB-B : gets b AB-AB : gets max(a, b) Also: Cost
More informationStructure of Social Networks
Structure of Social Networks Outline Structure of social networks Applications of structural analysis Social *networks* Twitter Facebook Linked-in IMs Email Real life Address books... Who Twitter #numbers
More informationBasics, how to build & store graphs, laws, etc. Centrality, and algorithms you should know
http://poloclub.gatech.edu/cse6242 CSE6242 / CX4242: Data & Visual Analytics Graphs / Networks Basics, how to build & store graphs, laws, etc. Centrality, and algorithms you should know Duen Horng (Polo)
More informationBasics, how to build & store graphs, laws, etc. Centrality, and algorithms you should know
http://poloclub.gatech.edu/cse6242 CSE6242 / CX4242: Data & Visual Analytics Graphs / Networks Basics, how to build & store graphs, laws, etc. Centrality, and algorithms you should know Duen Horng (Polo)
More informationECS 253 / MAE 253, Lecture 8 April 21, Web search and decentralized search on small-world networks
ECS 253 / MAE 253, Lecture 8 April 21, 2016 Web search and decentralized search on small-world networks Search for information Assume some resource of interest is stored at the vertices of a network: Web
More informationarxiv: v1 [cs.si] 12 Jan 2019
Predicting Diffusion Reach Probabilities via Representation Learning on Social Networks Furkan Gursoy furkan.gursoy@boun.edu.tr Ahmet Onur Durahim onur.durahim@boun.edu.tr arxiv:1901.03829v1 [cs.si] 12
More informationModularity CMSC 858L
Modularity CMSC 858L Module-detection for Function Prediction Biological networks generally modular (Hartwell+, 1999) We can try to find the modules within a network. Once we find modules, we can look
More informationScalable Network Analysis
Inderjit S. Dhillon University of Texas at Austin COMAD, Ahmedabad, India Dec 20, 2013 Outline Unstructured Data - Scale & Diversity Evolving Networks Machine Learning Problems arising in Networks Recommender
More informationCSE 255 Lecture 13. Data Mining and Predictive Analytics. Triadic closure; strong & weak ties
CSE 255 Lecture 13 Data Mining and Predictive Analytics Triadic closure; strong & weak ties Monday Random models of networks: Erdos Renyi random graphs (picture from Wikipedia http://en.wikipedia.org/wiki/erd%c5%91s%e2%80%93r%c3%a9nyi_model)
More informationThe Role of Homophily and Popularity in Informed Decentralized Search
The Role of Homophily and Popularity in Informed Decentralized Search Florian Geigl and Denis Helic Knowledge Technologies Institute In eldgasse 13/5. floor, 8010 Graz, Austria {florian.geigl,dhelic}@tugraz.at
More informationMath 443/543 Graph Theory Notes 10: Small world phenomenon and decentralized search
Math 443/543 Graph Theory Notes 0: Small world phenomenon and decentralized search David Glickenstein November 0, 008 Small world phenomenon The small world phenomenon is the principle that all people
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University, y http://cs224w.stanford.edu Due in 1 week: Oct 4 in class! The idea of the reaction papers is: To familiarize yourselves
More informationCAIM: Cerca i Anàlisi d Informació Massiva
1 / 72 CAIM: Cerca i Anàlisi d Informació Massiva FIB, Grau en Enginyeria Informàtica Slides by Marta Arias, José Balcázar, Ricard Gavaldá Department of Computer Science, UPC Fall 2016 http://www.cs.upc.edu/~caim
More informationClass 10 social issues. The Internet and social issues Is Inet decreasing people s social contacts? Cocooning?
Class 10 social issues The Internet and social issues Is Inet decreasing people s social contacts? Cocooning? 1 Social Issues What are the facts what do people use Internet for? What are the demographics
More informationCS224W: Analysis of Network Jure Leskovec, Stanford University
CS224W: Analysis of Network Jure Leskovec, Stanford University http://cs224w.stanford.edu 9/25/17 Jure Leskovec, Stanford CS224W: Analysis of Networks 2 Why Networks? Networks are a general language for
More informationCSE 158 Lecture 13. Web Mining and Recommender Systems. Triadic closure; strong & weak ties
CSE 158 Lecture 13 Web Mining and Recommender Systems Triadic closure; strong & weak ties Monday Random models of networks: Erdos Renyi random graphs (picture from Wikipedia http://en.wikipedia.org/wiki/erd%c5%91s%e2%80%93r%c3%a9nyi_model)
More informationInfluence Maximization in the Independent Cascade Model
Influence Maximization in the Independent Cascade Model Gianlorenzo D Angelo, Lorenzo Severini, and Yllka Velaj Gran Sasso Science Institute (GSSI), Viale F. Crispi, 7, 67100, L Aquila, Italy. {gianlorenzo.dangelo,lorenzo.severini,yllka.velaj}@gssi.infn.it
More informationRecap! CMSC 498J: Social Media Computing. Department of Computer Science University of Maryland Spring Hadi Amiri
Recap! CMSC 498J: Social Media Computing Department of Computer Science University of Maryland Spring 2015 Hadi Amiri hadi@umd.edu Announcement CourseEvalUM https://www.courseevalum.umd.edu/ 2 Announcement
More informationCSE 258 Lecture 12. Web Mining and Recommender Systems. Social networks
CSE 258 Lecture 12 Web Mining and Recommender Systems Social networks Social networks We ve already seen networks (a little bit) in week 3 i.e., we ve studied inference problems defined on graphs, and
More informationExamples of Complex Networks
Examples of Complex Networks Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-
More informationUtilizing Social Influence in Content Distribution Networks
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2 proceedings Utilizing Social Influence in Content Distribution
More informationSmall-World Models and Network Growth Models. Anastassia Semjonova Roman Tekhov
Small-World Models and Network Growth Models Anastassia Semjonova Roman Tekhov Small world 6 billion small world? 1960s Stanley Milgram Six degree of separation Small world effect Motivation Not only friends:
More informationSparsification of Social Networks Using Random Walks
Sparsification of Social Networks Using Random Walks Bryan Wilder and Gita Sukthankar Department of EECS (CS), University of Central Florida bryan.wilder@knights.ucf.edu, gitars@eecs.ucf.edu Abstract There
More informationDS504/CS586: Big Data Analytics Graph Mining Prof. Yanhua Li
Welcome to DS504/CS586: Big Data Analytics Graph Mining Prof. Yanhua Li Time: 6:00pm 8:50pm R Location: AK232 Fall 2016 Graph Data: Social Networks Facebook social graph 4-degrees of separation [Backstrom-Boldi-Rosa-Ugander-Vigna,
More informationSpectral Clustering and Community Detection in Labeled Graphs
Spectral Clustering and Community Detection in Labeled Graphs Brandon Fain, Stavros Sintos, Nisarg Raval Machine Learning (CompSci 571D / STA 561D) December 7, 2015 {btfain, nisarg, ssintos} at cs.duke.edu
More informationComplex Networks. Structure and Dynamics
Complex Networks Structure and Dynamics Ying-Cheng Lai Department of Mathematics and Statistics Department of Electrical Engineering Arizona State University Collaborators! Adilson E. Motter, now at Max-Planck
More informationCS-E5740. Complex Networks. Scale-free networks
CS-E5740 Complex Networks Scale-free networks Course outline 1. Introduction (motivation, definitions, etc. ) 2. Static network models: random and small-world networks 3. Growing network models: scale-free
More informationCombining intensification and diversification to maximize the propagation of social influence
Title Combining intensification and diversification to maximize the propagation of social influence Author(s) Fan, X; Li, VOK Citation The 2013 IEEE International Conference on Communications (ICC 2013),
More informationIntroduction Types of Social Network Analysis Social Networks in the Online Age Data Mining for Social Network Analysis Applications Conclusion
Introduction Types of Social Network Analysis Social Networks in the Online Age Data Mining for Social Network Analysis Applications Conclusion References Social Network Social Network Analysis Sociocentric
More informationCSE 316: SOCIAL NETWORK ANALYSIS INTRODUCTION. Fall 2017 Marion Neumann
CSE 316: SOCIAL NETWORK ANALYSIS Fall 2017 Marion Neumann INTRODUCTION Contents in these slides may be subject to copyright. Some materials are adopted from: http://www.cs.cornell.edu/home /kleinber/ networks-book,
More informationRandom Generation of the Social Network with Several Communities
Communications of the Korean Statistical Society 2011, Vol. 18, No. 5, 595 601 DOI: http://dx.doi.org/10.5351/ckss.2011.18.5.595 Random Generation of the Social Network with Several Communities Myung-Hoe
More informationHow to explore big networks? Question: Perform a random walk on G. What is the average node degree among visited nodes, if avg degree in G is 200?
How to explore big networks? Question: Perform a random walk on G. What is the average node degree among visited nodes, if avg degree in G is 200? Questions from last time Avg. FB degree is 200 (suppose).
More informationCSE 158 Lecture 11. Web Mining and Recommender Systems. Social networks
CSE 158 Lecture 11 Web Mining and Recommender Systems Social networks Assignment 1 Due 5pm next Monday! (Kaggle shows UTC time, but the due date is 5pm, Monday, PST) Assignment 1 Assignment 1 Social networks
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu SPAM FARMING 2/11/2013 Jure Leskovec, Stanford C246: Mining Massive Datasets 2 2/11/2013 Jure Leskovec, Stanford
More informationDS504/CS586: Big Data Analytics Graph Mining Prof. Yanhua Li
Welcome to DS504/CS586: Big Data Analytics Graph Mining Prof. Yanhua Li Time: 6:00pm 8:50pm R Location: AK 233 Spring 2018 Service Providing Improve urban planning, Ease Traffic Congestion, Save Energy,
More informationSummary: What We Have Learned So Far
Summary: What We Have Learned So Far small-world phenomenon Real-world networks: { Short path lengths High clustering Broad degree distributions, often power laws P (k) k γ Erdös-Renyi model: Short path
More informationEfficient Influence Maximization in Social Networks
Efficient Influence Maximization in Social Networks Wei Chen Microsoft Research Asia Beijing, China weic@microsoft.com Yajun Wang Microsoft Research Asia Beijing, China yajunw@microsoft.com Siyu Yang Dept.
More informationScalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks
Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks Wei Chen Microsoft Research Asia Beijing, China weic@microsoft.com Chi Wang University of Illinois at Urbana-Champaign,
More informationGraph and Link Mining
Graph and Link Mining Graphs - Basics A graph is a powerful abstraction for modeling entities and their pairwise relationships. G = (V,E) Set of nodes V = v,, v 5 Set of edges E = { v, v 2, v 4, v 5 }
More informationSocial and Technological Network Data Analytics. Lecture 5: Structure of the Web, Search and Power Laws. Prof Cecilia Mascolo
Social and Technological Network Data Analytics Lecture 5: Structure of the Web, Search and Power Laws Prof Cecilia Mascolo In This Lecture We describe power law networks and their properties and show
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu 2/25/2013 Jure Leskovec, Stanford CS246: Mining Massive Datasets, http://cs246.stanford.edu 3 In many data mining
More informationLecture 2: Geometric Graphs, Predictive Graphs and Spectral Analysis
Lecture 2: Geometric Graphs, Predictive Graphs and Spectral Analysis Radu Balan February 8, 2018 Data Graphs Today we discuss construction of dynamical data graphs and spectral analysis. The overarching
More informationGraph Mining and Social Network Analysis
Graph Mining and Social Network Analysis Data Mining and Text Mining (UIC 583 @ Politecnico di Milano) References q Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques", The Morgan Kaufmann
More informationUncovering the Formation of Triadic Closure in Social Networks. Zhanpeng Fang and Jie Tang Tsinghua University
Uncovering the Formation of Triadic Closure in Social Networks Zhanpeng Fang and Jie Tang Tsinghua University 1 Triangle Laws Triangle is one of most basic human groups in social networks Friends of friends
More informationSignal Processing for Big Data
Signal Processing for Big Data Sergio Barbarossa 1 Summary 1. Networks 2.Algebraic graph theory 3. Random graph models 4. OperaGons on graphs 2 Networks The simplest way to represent the interaction between
More informationComparing the diversity of information by word-of-mouth vs. web spread
epl draft Header will be provided by the publisher Comparing the diversity of information by word-of-mouth vs. web spread A. SELA 1(a), LOUIS SHEKHTMAN 2, SHLOMO HAVLIN 2, I. BEN-GAL 1 1 Tel Aviv University,
More informationReview. Information cascades in complex networks. Edited by: Ernesto Estrada
Journal of Complex Networks (2017) 5, 665 693 doi: 10.1093/comnet/cnx019 Advance Access Publication on 6 July 2017 Review Information cascades in complex networks Mahdi Jalili School of Engineering, RMIT
More informationCSCI5070 Advanced Topics in Social Computing
CSCI5070 Advanced Topics in Social Computing Irwin King The Chinese University of Hong Kong king@cse.cuhk.edu.hk!! 2012 All Rights Reserved. Outline Graphs Origins Definition Spectral Properties Type of
More informationJournal of Engineering Science and Technology Review 7 (3) (2014) Research Article
Jestr Journal of Engineering Science and Technology Review 7 (3) (214) 32 38 Research Article JOURNAL OF Engineering Science and Technology Review www.jestr.org Improved Algorithms OF CELF and CELF++ for
More informationCharacteristics of Preferentially Attached Network Grown from. Small World
Characteristics of Preferentially Attached Network Grown from Small World Seungyoung Lee Graduate School of Innovation and Technology Management, Korea Advanced Institute of Science and Technology, Daejeon
More informationCSE 258 Lecture 6. Web Mining and Recommender Systems. Community Detection
CSE 258 Lecture 6 Web Mining and Recommender Systems Community Detection Dimensionality reduction Goal: take high-dimensional data, and describe it compactly using a small number of dimensions Assumption:
More informationNetwork Thinking. Complexity: A Guided Tour, Chapters 15-16
Network Thinking Complexity: A Guided Tour, Chapters 15-16 Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-pj45avc/
More information