Kristina Lerman USC Information Sciences Institute
|
|
- Melinda Barnett
- 6 years ago
- Views:
Transcription
1 Rethinking Network Structure Kristina Lerman USC Information Sciences Institute Università della Svizzera Italiana, December 16, 2011
2 Measuring network structure Central nodes Community structure Strength of ties Zachary, J. Anthro. Research 33 No. 4. (1977)
3 Measuring network structure SNA metrics examine network topology to measure structure Centrality Degree, Katz score [Katz, 1953], Betweenness [Freeman, 1977], eigenvector [Bonacich, 1987], PageRank [Brin et al, 1998], Community detection Dozens of algorithms to partition network into groups 400+ references in 2010 review of community detection Strength of ties Neighborhood overlap to measure strength of tie [Granovetter, 1973] Claim: The nature of interactions between nodes affects how we measure network structure Consequences for network analysis metrics and algorithms
4 Types of interactions Two classes of interactions between network nodes Conservative One to one: phone calls, money transfer, web surfing Modeled by random walk Non conservative One to many: epidemics, information diffusion, innovation adoption Modeled by contact process Transfer matrix ~ D -1 A Transfer matrix ~ A
5 Matrix formulation Adjacency matrix of the network A = Outdegree matrix D =
6 Conservative interactions At time t, each node receives amount (t) At next time step, node retains (1-) of the amount it received and divides the rest among its neighbors Transfer matrix T: amount given to each neighbor T=D -1 A when evenly divided among neighbors 4 5 t=0 ( 0) w
7 Conservative interactions At time t, each node receives amount (t) At next time step, node retains (1-) of the amount it received and divides the rest among its neighbors Transfer matrix T: amount given to each neighbor T=D -1 A when evenly divided among neighbors t=0 t=1 ( 0) w 0 ( 1) (0)T w0t 2 3
8 Conservative interactions At time t, each node receives amount (t) At next time step, node retains (1-) of the amount it received and divides the rest among its neighbors Transfer matrix T: amount given to each neighbor T=D -1 A when evenly divided among neighbors t=0 t=1 t=2 ( 0) w 0 ( 1) (0)T w0t 2 2 ( 2) (1) T w0t
9 Conservative interactions At time t, each node receives amount (t) At next time step, node retains (1-) of the amount it received and divides the rest among its neighbors Transfer matrix T: amount given to each neighbor T=D -1 A when evenly divided among neighbors t=0 t=1 t=2 t ( 0) w 0 ( 1) (0)T w0t 2 2 ( 2) (1) T w0t ( t) ( t 1)T t w0 T t
10 Conservative interactions At time t, each node receives amount (t) At next time step, node retains (1-) of the amount it received and divides the rest among its neighbors Transfer matrix T: amount given to each neighbor T=D -1 A when evenly divided among neighbors 4 5 t=0 t=1 ( 0) w 0 ( 1) (0)T w0t 1 t=2 2 2 ( 2) (1) T w0t 2 3 t ( t) ( t 1)T t w0 T t w( t) (1 ) t 1 k 0 (1 ) w 0 ( k) ( t) w( t 1)T
11 Steady state of conservative dynamic process At time t, each node receives amount (t) At next time step, node retains (1-) of the amount it received and divides the rest among its neighbors Transfer matrix T: amount given to each neighbor T=D -1 A when evenly divided among neighbors t w (1 ) w (1 ) w 0 0 w T ( I T ) 1
12 Non conservative interactions At time t, each node receives amount (t) At next time step, node prints fraction of this amount for each out neighbor Replication matrix R: the additional amount produced for each neighbor R=A where A is adjacency matrix t=0 ( 0) w
13 Non conservative interactions At time t, each node receives amount (t) At next time step, node prints fraction of this amount for each out neighbor Replication matrix R: the additional amount produced for each neighbor R=A where A is adjacency matrix t=0 ( 0) w 0 t=1 ( 1) (0)R w0r
14 Non conservative interactions At time t, each node receives amount (t) At next time step, node prints fraction of this amount for each out neighbor Replication matrix R: the additional amount produced for each neighbor R=A where A is adjacency matrix t=0 t=1 t=2 ( 0) w 0 ( 1) (0)R w R ( 2) (1) R w0r
15 Non conservative interactions At time t, each node receives amount (t) At next time step, node prints fraction of this amount for each out neighbor Replication matrix R: the additional amount produced for each neighbor R=A where A is adjacency matrix t=0 t=1 t=2 t ( 0) w 0 ( 1) (0)R w R ( 2) (1) R w0r ( t) ( t 1)R t w0 R t
16 Non conservative interactions At time t, each node receives amount (t) At next time step, node prints fraction of this amount for each out neighbor Replication matrix R: the additional amount produced for each neighbor R=A where A is adjacency matrix t=0 ( 0) w 0 t=1 ( 1) (0)R w R 0 t=2 t 2 2 ( 2) (1) R w0r ( t) ( t 1)R t w0 R t w( t) t k 0 w 0 ( k) k 0 w( t 1) R t k w R 0 k 2 3
17 Steady state of non conservative dynamic process At time t, each node receives amount (t) At next time step, node prints fraction of this amount for each out neighbor Replication matrix R: the additional amount produced for each neighbor R=A where A is adjacency matrix 4 5 t 1 w w w 0 0 w ( I R R) 1 while <1/ max 2 3
18 Interactions and centrality Centrality identifies important nodes in the network e.g., most connected Degree centrality e.g., in the middle of most shortest paths Betweenness centrality e.g., those that are often visited by a process Nature of the process matters Conservative PageRank Non conservative Alpha Centrality
19 Interactions and Centrality Centrality identifies important nodes in the network, i.e., those that are often visited by a dynamic process Conservative Random surfer: follows out links at random with probability ; otherwise, jumps to random node Equilibrium PageRank Non conservative Epidemic spread: with probability, transmit disease to each out neighbor Equilibrium while <1/ max Alpha Centrality pr (1 ) s pr D 1 A cr s cr A
20 Interactions and Centrality Centrality identifies important nodes in the network, i.e., those that are often visited by a dynamic process Conservative Random surfer: follows out links at random with probability ; otherwise, jumps to random node Equilibrium PageRank Non conservative Epidemic spread: with probability, transmit disease to each out neighbor Equilibrium while <1/ max Alpha Centrality pr (1 ) s pr D 1 A cr s cr A w c (1 ) w (0) w c c T w w (0) w n n n R
21 Which centrality metric is right for social media? follower submitter follower follower Information flow in social media is non conservative
22 Ground truth User activity data in social media provides ground truth Empirical measure of influence/importance 1. average size of cascades a node triggers 2. average number re broadcasts by followers Rank nodes by the empirical measure ground truth Compare rankings produced by centrality metrics to the ground truth
23 Which centrality metric is right for social media? Correlation between the ground truth and rankings predicted by Alpha-Centrality and PageRank Digg Twitter Non conservative Alpha Centrality best predicts node centrality
24 Alpha Centrality [Bonacich, 87] C() A A 2 2 A 3... A k 0 k A k A (I A) Measures the number of paths between nodes, each path attenuated by its length with parameter Parameter [0,1/ 1 ) sets the length scale of interactions Local: For = 0, only short range (local) interactions are considered Same rankings as degree centrality Meso: As grows, the length scale of interactions grows Global: As 1/ 1, global interactions are considered (length diverges) Same rankings as eigenvector centrality [Ghosh and Lerman, Parameterized Metric for Network Analysis Physical Review E, 2011]
25 Epidemic threshold for non conservative processes Diverging length scale critical phenomena Threshold behavior in non conservative diffusion Critical value of transmissibility c =1/ 1 [Wang et al., 2003] for < c, epidemic dies out, i.e., reaches vanishing fraction of nodes for > c, epidemic reaches a large fraction of nodes c =0.006 Size of simulated epidemics on the Digg follower graph and a synthetic graph transmissibility [Ver Steeg, Ghosh & Lerman, What stops social epidemics? ICWSM, 2011]
26 Multi scale analysis with Alpha Centrality Length scale parameter allows for multi scale analysis of networks Differentiate between local and global structures Change in rankings with Leaders: high influence on group members Nodes with high centrality locally (small Bridges: mediate communication between groups Nodes with low centrality locally (small But high centrality globally (large Peripherals: poorly connected to everyone Nodes with low centrality for any
27 Karate club network [Zachary, 1977] administrator instructor [Zachary An Information Flow Model for Conflict and Fission in Small Groups. J. Anthro. Research 33 No. 4. (1977)]
28 Ranking karate club members Centrality scores of nodes vs. No need to know communities to find bridging nodes
29 Community detection Divide the network into group such that nodes within a group are more similar to each other than to other nodes [Zachary An Information Flow Model for Conflict and Fission in Small Groups. J. Anthro. Research 33 No. 4. (1977)]
30 Synchronization in complex networks after a long time Hierarchical community structure revealed en route to synchronization [Arenas et al. Synchronization Reveals Topological Scales in Complex Networks, Phys. Rev. Lett. 96 (2006)]
31 Mathematics of synchronization Conservative Kuramoto model of coupled oscillators d i dt i sin( j i ) j neighbors(i) Linearizedmodel: Laplace operator d dt (D A) L
32 Mathematics of synchronization Conservative Kuramoto model of coupled oscillators d i dt Linearizedmodel: Laplace operator d dt i sin( j i ) j neighbors(i) (D A) L Non conservative Non conservative model A node does not divide its coupling energy among neighbors; rather, it applies its full coupling energy to each neighbor Linearizedmodel: Replicator operator d dt (I A) R max
33 Steady state d dt X X=L or R (t) ( 0 X 1 )e Xt X 1 System reaches steady state iff X is positive semi definite Time to reach the steady state ~ 1/ 1 (smallest positive eigenvalue of X) In steady state, ~ eigenvector corresponding to 0 (smallest eigenvalue of X) Conservative (X=L): i (t)= i (t+1)= j (t+1) Non conservative (X=R): i (t)= i (t+1);
34 Synthetic graph Adjacency matrix of the graph
35 Eigenvalue Spectrum Eigenvalue spectrum of the Laplacian used to characterize graph structure Number of null eigenvalues # disconnected components Smallest positive eigenvalue equilibration time Gaps between consecutive eigenvalues relative difference of time scales Large eigenvalues hubs in the network
36 Synchronization matrix T=1500 Conservative Non-conservative
37 Zachary karate club Adjacency matrix of the graph
38 Eigenvalue spectrum Eigenvalue spectrum of the Laplacian used to characterize graph structure Number of null eigenvalues # disconnected components Gaps between consecutive eigenvalues relative difference of time scales Large eigenvalues hubs in the network Cheeger bounds, graph partitioning criteria, conductance,
39 Synchronization matrix of the Karate Club Network Laplacian (T=1000) Replicator (T=1000) More synchronization Less synchronization
40 Hierarchical clustering emerging communities Non conservative Conservative t=10 t=1000 t=3000 t=3899
41 Community structure Conservative Non conservative Hierarchical agglomerative clustering on synchronization matrix at time=3899 Non conservative: clustering reveals ground truth community structure Conservative: two nodes mis assigned
42 Community structure of Digg social network
43 Community structure of Digg social network Whiskers Core No further structure in the core [Leskovec et al., 2008]
44 Onion like structure of the core Non conservative Conservative Digg mutual follower network with ~40K nodes, ~360K edges Each core has its own core and whiskers structure Little overlap between the cores discovered by the two models [Ghosh & Lerman, Role of Dynamic Interactions in Multi scale Analysis of Community Structure submitted to WWW]
45 Long tailed size distribution of whiskers Non conservative Conservative whiskers in a sub core disconnected components in the mutual follower graph Clustering nodes in the core, reveals many small communities (whiskers) with long-tailed size distribution [Ghosh & Lerman, Role of Dynamic Interactions in Multi scale Analysis of Community Structure submitted to WWW]
46 Strength of ties Social ties and proximity People receive novel information (e.g., new jobs) not through close friends (strong ties) but acquaintances (weak ties) [Granovetter, 1973] Proposed neighborhood overlap as measure of tie strength Tie strength ~ proximity in networks Empirical correlation between proximity (neighborhood overlap) and tie strength (frequency of calls) in a mobile call graph [Onnela et al, 2007] Link prediction Proximity predicts future links in networks E.g., future collaborations between scientists [Liben Nowell & Kleinberg, 2003] Tested many proximity metrics
47 Measuring proximity Variety of metrics proposed to measure proximity in graph CN: number of common neighbors JA: fraction of common neighbors (Jaccard) AA: Adamic Adar metric [Adamic & Adar, 1998] weighs each common neighbor by log 1 ( degree) best metric for predicting future collaborations! [Liben Nowell & Kleinberg, 2003] 1 AA uv log(d z ) z Neighbors Effective conductance [Koren et al., 2006]
48 Interactions and proximity Proximity between u and v = likelihood a message will get from u to v or vice versa Conservative Non conservative 4 v 4 v 1 1 u 3 u 3 CO 1 2 z Neighbors 1 d u d z Attention limited CO_ AL 1 2 zneighbors zneighbors 2 d u d z d z d v 1 d v d z NC z Neighbors NC _ AL 1 2 zneighbors z Neighbors CN 1 1 d z d v d z d u
49 Activity prediction in social media What posts will user retweet? Social media users tend to be similar to their friends i.e. retweet the same posts as friends do (or vote for the same stories on Digg [Lerman, 2007]) But they tend to be more similar to closer friends Closeness based on proximity in the follower graph Which proximity metric is better? [Lerman et al., Using proximity to predict activity in social networks submitted to WWW]
50 Prediction experiment user? friend friend friend x i friend friend Pr u p p Re u p u Measure how well each proximity metric predicts activity [Lerman et al., Using proximity to predict activity in social networks submitted to WWW]
51 Prediction results: Digg Baseline = all friends contribute equally to user s activity Lift = percent change over baseline precision recall 40 lift (%) CN, NC JA AA CS CS_AL NC_AL -20 [Lerman et al., Using proximity to predict activity in social networks submitted to WWW]
52 Prediction results: Twitter Baseline = all friends contribute equally to user s activity Lift = percent change over baseline precision recall lift (%) CN,NC JA AA CS CS_AL NC_AL [Lerman et al., Using proximity to predict activity in social networks submitted to WWW]
53 Conclusion How we measure network structure depends on the nature of interactions between nodes Centrality Conservative interactions PageRank, Non-conservative Alpha-centrality, Alpha-centrality better predicts influential users on Digg, Twitter Community structure Conservative use Laplacian to probe structure Non-conservative use Replicator operator Communities synchronize faster in non-conservative interactions Social ties A principled way to measure proximity in graphs Attention-limited proximity better predicts user activity on Digg, Twitter
Web Structure Mining Nodes, Links and Influence
Web Structure Mining Nodes, Links and Influence 1 Outline 1. Importance of nodes 1. Centrality 2. Prestige 3. Page Rank 4. Hubs and Authority 5. Metrics comparison 2. Link analysis 3. Influence model 1.
More informationDegree Distribution: The case of Citation Networks
Network Analysis Degree Distribution: The case of Citation Networks Papers (in almost all fields) refer to works done earlier on same/related topics Citations A network can be defined as Each node is
More informationELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties
ELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties Prof. James She james.she@ust.hk 1 Last lecture 2 Selected works from Tutorial
More informationSUPPLEMENTARY MATERIALS TO THE PAPER: ON THE LIMITING BEHAVIOR OF PARAMETER-DEPENDENT NETWORK CENTRALITY MEASURES
SUPPLEMENTARY MATERIALS TO THE PAPER: ON THE LIMITING BEHAVIOR OF PARAMETER-DEPENDENT NETWORK CENTRALITY MEASURES MICHELE BENZI AND CHRISTINE KLYMKO Abstract This document contains details of numerical
More informationCS 277: Data Mining. Mining Web Link Structure. CS 277: Data Mining Lectures Analyzing Web Link Structure Padhraic Smyth, UC Irvine
CS 277: Data Mining Mining Web Link Structure Class Presentations In-class, Tuesday and Thursday next week 2-person teams: 6 minutes, up to 6 slides, 3 minutes/slides each person 1-person teams 4 minutes,
More informationComplex Social System, Elections. Introduction to Network Analysis 1
Complex Social System, Elections Introduction to Network Analysis 1 Complex Social System, Network I person A voted for B A is more central than B if more people voted for A In-degree centrality index
More informationFinding central nodes in large networks
Finding central nodes in large networks Nelly Litvak University of Twente Eindhoven University of Technology, The Netherlands Woudschoten Conference 2017 Complex networks Networks: Internet, WWW, social
More informationLAPLACIAN MATRIX AND APPLICATIONS
LAPLACIAN MATRIX AND APPLICATIONS Alice Nanyanzi Supervisors: Dr. Franck Kalala Mutombo & Dr. Simukai Utete alicenanyanzi@aims.ac.za August 24, 2017 1 Complex systems & Complex Networks 2 Networks Overview
More informationDS504/CS586: Big Data Analytics Graph Mining II
Welcome to DS504/CS586: Big Data Analytics Graph Mining II Prof. Yanhua Li Time: 6:00pm 8:50pm Mon. and Wed. Location: SL105 Spring 2016 Reading assignments We will increase the bar a little bit Please
More informationAlgebraic Representation of Networks
Algebraic Representation of Networks 0 1 2 1 1 0 0 1 2 0 0 1 1 1 1 1 Hiroki Sayama sayama@binghamton.edu Describing networks with matrices (1) Adjacency matrix A matrix with rows and columns labeled by
More informationDS504/CS586: Big Data Analytics Graph Mining II
Welcome to DS504/CS586: Big Data Analytics Graph Mining II Prof. Yanhua Li Time: 6-8:50PM Thursday Location: AK233 Spring 2018 v Course Project I has been graded. Grading was based on v 1. Project report
More informationMining of Massive Datasets Jure Leskovec, AnandRajaraman, Jeff Ullman Stanford University
Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit
More information0.1 Naive formulation of PageRank
PageRank is a ranking system designed to find the best pages on the web. A webpage is considered good if it is endorsed (i.e. linked to) by other good webpages. The more webpages link to it, and the more
More informationSpectral Graph Theory Tools. Analysis of Complex Networks
Spectral Graph Theory Tools for the Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Acknowledgments Christine Klymko (Emory) Ernesto Estrada (Strathclyde, UK) Support:
More information6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities
6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities 1 Outline Outline Dynamical systems. Linear and Non-linear. Convergence. Linear algebra and Lyapunov functions. Markov
More informationSimilarity Measures for Link Prediction Using Power Law Degree Distribution
Similarity Measures for Link Prediction Using Power Law Degree Distribution Srinivas Virinchi and Pabitra Mitra Dept of Computer Science and Engineering, Indian Institute of Technology Kharagpur-72302,
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 How to organize/navigate it? First try: Human curated Web directories Yahoo, DMOZ, LookSmart
More informationCS6220: DATA MINING TECHNIQUES
CS6220: DATA MINING TECHNIQUES Mining Graph/Network Data Instructor: Yizhou Sun yzsun@ccs.neu.edu March 16, 2016 Methods to Learn Classification Clustering Frequent Pattern Mining Matrix Data Decision
More informationECEN 689 Special Topics in Data Science for Communications Networks
ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 8 Random Walks, Matrices and PageRank Graphs
More informationMachine Learning and Modeling for Social Networks
Machine Learning and Modeling for Social Networks Olivia Woolley Meza, Izabela Moise, Nino Antulov-Fatulin, Lloyd Sanders 1 Spreading and Influence on social networks Computational Social Science D-GESS
More informationAs it is not necessarily possible to satisfy this equation, we just ask for a solution to the more general equation
Graphs and Networks Page 1 Lecture 2, Ranking 1 Tuesday, September 12, 2006 1:14 PM I. II. I. How search engines work: a. Crawl the web, creating a database b. Answer query somehow, e.g. grep. (ex. Funk
More informationNode Centrality and Ranking on Networks
Node Centrality and Ranking on Networks Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Social
More information6.207/14.15: Networks Lecture 7: Search on Networks: Navigation and Web Search
6.207/14.15: Networks Lecture 7: Search on Networks: Navigation and Web Search Daron Acemoglu and Asu Ozdaglar MIT September 30, 2009 1 Networks: Lecture 7 Outline Navigation (or decentralized search)
More informationData Mining and Matrices
Data Mining and Matrices 10 Graphs II Rainer Gemulla, Pauli Miettinen Jul 4, 2013 Link analysis The web as a directed graph Set of web pages with associated textual content Hyperlinks between webpages
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
More informationMAE 298, Lecture 8 Feb 4, Web search and decentralized search on small-worlds
MAE 298, Lecture 8 Feb 4, 2008 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 a file-sharing
More informationCharacterizing Information Diffusion in Online Social Networks with Linear Diffusive Model
Characterizing Information Diffusion in Online Social Networks with Linear Diffusive Model Feng Wang, Haiyan Wang, Kuai Xu, Jianhong Wu, Xiaohua Jia School of Mathematical and Natural Sciences, Arizona
More informationSocial Networks. Chapter 9
Chapter 9 Social Networks Distributed computing is applicable in various contexts. This lecture exemplarily studies one of these contexts, social networks, an area of study whose origins date back a century.
More informationIntroduction to Link Prediction
Introduction to Link Prediction Machine Learning and Modelling for Social Networks Lloyd Sanders, Olivia Woolley, Iza Moize, Nino Antulov-Fantulin D-GESS: Computational Social Science COSS Overview What
More informationNode and Link Analysis
Node and Link Analysis Leonid E. Zhukov School of Applied Mathematics and Information Science National Research University Higher School of Economics 10.02.2014 Leonid E. Zhukov (HSE) Lecture 5 10.02.2014
More informationThanks to Jure Leskovec, Stanford and Panayiotis Tsaparas, Univ. of Ioannina for slides
Thanks to Jure Leskovec, Stanford and Panayiotis Tsaparas, Univ. of Ioannina for slides Web Search: How to Organize the Web? Ranking Nodes on Graphs Hubs and Authorities PageRank How to Solve PageRank
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec Stanford University Jure Leskovec, Stanford University http://cs224w.stanford.edu Task: Find coalitions in signed networks Incentives: European
More informationData Mining Techniques
Data Mining Techniques CS 622 - Section 2 - Spring 27 Pre-final Review Jan-Willem van de Meent Feedback Feedback https://goo.gl/er7eo8 (also posted on Piazza) Also, please fill out your TRACE evaluations!
More informationCSCI 3210: Computational Game Theory. Cascading Behavior in Networks Ref: [AGT] Ch 24
CSCI 3210: Computational Game Theory Cascading Behavior in Networks Ref: [AGT] Ch 24 Mohammad T. Irfan Email: mirfan@bowdoin.edu Web: www.bowdoin.edu/~mirfan Course Website: www.bowdoin.edu/~mirfan/csci-3210.html
More informationLecture 13: Spectral Graph Theory
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 13: Spectral Graph Theory Lecturer: Shayan Oveis Gharan 11/14/18 Disclaimer: These notes have not been subjected to the usual scrutiny reserved
More informationLink Analysis and Web Search
Link Analysis and Web Search Episode 11 Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Link Analysis and Web Search (Chapter 13, 14) Information networks and
More informationLink Analysis. Leonid E. Zhukov
Link Analysis Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural Analysis and Visualization
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
More informationDATA MINING LECTURE 13. Link Analysis Ranking PageRank -- Random walks HITS
DATA MINING LECTURE 3 Link Analysis Ranking PageRank -- Random walks HITS How to organize the web First try: Manually curated Web Directories How to organize the web Second try: Web Search Information
More informationLink Analysis Ranking
Link Analysis Ranking How do search engines decide how to rank your query results? Guess why Google ranks the query results the way it does How would you do it? Naïve ranking of query results Given query
More informationSMALL-WORLD NAVIGABILITY. Alexandru Seminar in Distributed Computing
SMALL-WORLD NAVIGABILITY Talk about a small world 2 Zurich, CH Hunedoara, RO From cliché to social networks 3 Milgram s Experiment and The Small World Hypothesis Omaha, NE Boston, MA Wichita, KS Human
More informationECS 289 F / MAE 298, Lecture 15 May 20, Diffusion, Cascades and Influence
ECS 289 F / MAE 298, Lecture 15 May 20, 2014 Diffusion, Cascades and Influence Diffusion and cascades in networks (Nodes in one of two states) Viruses (human and computer) contact processes epidemic thresholds
More informationLink Analysis. Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze
Link Analysis Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze 1 The Web as a Directed Graph Page A Anchor hyperlink Page B Assumption 1: A hyperlink between pages
More informationOutline for today. Information Retrieval. Cosine similarity between query and document. tf-idf weighting
Outline for today Information Retrieval Efficient Scoring and Ranking Recap on ranked retrieval Jörg Tiedemann jorg.tiedemann@lingfil.uu.se Department of Linguistics and Philology Uppsala University Efficient
More informationA Dimensionality Reduction Framework for Detection of Multiscale Structure in Heterogeneous Networks
Shen HW, Cheng XQ, Wang YZ et al. A dimensionality reduction framework for detection of multiscale structure in heterogeneous networks. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(2): 341 357 Mar. 2012.
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu 2/7/2012 Jure Leskovec, Stanford C246: Mining Massive Datasets 2 Web pages are not equally important www.joe-schmoe.com
More informationCS6220: DATA MINING TECHNIQUES
CS6220: DATA MINING TECHNIQUES Mining Graph/Network Data Instructor: Yizhou Sun yzsun@ccs.neu.edu November 16, 2015 Methods to Learn Classification Clustering Frequent Pattern Mining Matrix Data Decision
More informationThanks to Jure Leskovec, Stanford and Panayiotis Tsaparas, Univ. of Ioannina for slides
Thanks to Jure Leskovec, Stanford and Panayiotis Tsaparas, Univ. of Ioannina for slides Web Search: How to Organize the Web? Ranking Nodes on Graphs Hubs and Authorities PageRank How to Solve PageRank
More informationWiki Definition. Reputation Systems I. Outline. Introduction to Reputations. Yury Lifshits. HITS, PageRank, SALSA, ebay, EigenTrust, VKontakte
Reputation Systems I HITS, PageRank, SALSA, ebay, EigenTrust, VKontakte Yury Lifshits Wiki Definition Reputation is the opinion (more technically, a social evaluation) of the public toward a person, a
More informationIdentifying influential spreaders in complex networks based on entropy method
Abstract Identifying influential spreaders in complex networks based on entropy method Xiaojian Ma a, Yinghong Ma School of Business, Shandong Normal University, Jinan 250014, China; a xiaojianma0813@163.com
More informationA new centrality measure for probabilistic diffusion in network
ACSIJ Advances in Computer Science: an International Journal, Vol. 3, Issue 5, No., September 204 ISSN : 2322-557 A new centrality measure for probabilistic diffusion in network Kiyotaka Ide, Akira Namatame,
More informationDiffusion of information and social contagion
Diffusion of information and social contagion Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics
More informationCommunities, Spectral Clustering, and Random Walks
Communities, Spectral Clustering, and Random Walks David Bindel Department of Computer Science Cornell University 3 Jul 202 Spectral clustering recipe Ingredients:. A subspace basis with useful information
More informationMobiHoc 2014 MINIMUM-SIZED INFLUENTIAL NODE SET SELECTION FOR SOCIAL NETWORKS UNDER THE INDEPENDENT CASCADE MODEL
MobiHoc 2014 MINIMUM-SIZED INFLUENTIAL NODE SET SELECTION FOR SOCIAL NETWORKS UNDER THE INDEPENDENT CASCADE MODEL Jing (Selena) He Department of Computer Science, Kennesaw State University Shouling Ji,
More informationHeat Kernel Based Community Detection
Heat Kernel Based Community Detection Joint with David F. Gleich, (Purdue), supported by" NSF CAREER 1149756-CCF Kyle Kloster! Purdue University! Local Community Detection Given seed(s) S in G, find a
More informationA Note on Google s PageRank
A Note on Google s PageRank According to Google, google-search on a given topic results in a listing of most relevant web pages related to the topic. Google ranks the importance of webpages according to
More informationLink Analysis Information Retrieval and Data Mining. Prof. Matteo Matteucci
Link Analysis Information Retrieval and Data Mining Prof. Matteo Matteucci Hyperlinks for Indexing and Ranking 2 Page A Hyperlink Page B Intuitions The anchor text might describe the target page B Anchor
More informationPage rank computation HPC course project a.y
Page rank computation HPC course project a.y. 2015-16 Compute efficient and scalable Pagerank MPI, Multithreading, SSE 1 PageRank PageRank is a link analysis algorithm, named after Brin & Page [1], and
More informationOn the Precision of Social and Information Networks
On the Precision of Social and Information Networks Kamesh Munagala (Duke) Reza Bosagh Zadeh (Stanford) Ashish Goel (Stanford) Aneesh Sharma(Twitter, Inc.) Information Networks Social Networks play an
More informationModeling, Analysis, and Control of Information Propagation in Multi-layer and Multiplex Networks. Osman Yağan
Modeling, Analysis, and Control of Information Propagation in Multi-layer and Multiplex Networks Osman Yağan Department of ECE Carnegie Mellon University Joint work with Y. Zhuang and V. Gligor (CMU) Alex
More informationA Parameterized Centrality Metric for Network Analysis
APS/123-QED A Parameterized Centrality Metric for Network Analysis Rumi Ghosh and Kristina Lerman USC Information Sciences Institute 4676 Admiralty Way, Marina del Rey, CA 90292 (Dated: October 20, 2010)
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 Non-overlapping vs. overlapping communities 11/10/2010 Jure Leskovec, Stanford CS224W: Social
More informationCS249: ADVANCED DATA MINING
CS249: ADVANCED DATA MINING Graph and Network Instructor: Yizhou Sun yzsun@cs.ucla.edu May 31, 2017 Methods Learnt Classification Clustering Vector Data Text Data Recommender System Decision Tree; Naïve
More informationSpectral Graph Theory for. Dynamic Processes on Networks
Spectral Graph Theory for Dynamic Processes on etworks Piet Van Mieghem in collaboration with Huijuan Wang, Dragan Stevanovic, Fernando Kuipers, Stojan Trajanovski, Dajie Liu, Cong Li, Javier Martin-Hernandez,
More informationCSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68
CSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68 References 1 L. Freeman, Centrality in Social Networks: Conceptual Clarification, Social Networks, Vol. 1, 1978/1979, pp. 215 239. 2 S. Wasserman
More informationAnalytically tractable processes on networks
University of California San Diego CERTH, 25 May 2011 Outline Motivation 1 Motivation Networks Random walk and Consensus Epidemic models Spreading processes on networks 2 Networks Motivation Networks Random
More information1998: enter Link Analysis
1998: enter Link Analysis uses hyperlink structure to focus the relevant set combine traditional IR score with popularity score Page and Brin 1998 Kleinberg Web Information Retrieval IR before the Web
More informationORIE 4741: Learning with Big Messy Data. Spectral Graph Theory
ORIE 4741: Learning with Big Messy Data Spectral Graph Theory Mika Sumida Operations Research and Information Engineering Cornell September 15, 2017 1 / 32 Outline Graph Theory Spectral Graph Theory Laplacian
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
Data Mining and Analysis: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA
More informationLink prediction in drug-target interactions network using similarity indices
Link prediction in drug-target interactions network using similarity indices Yiding Lu (Homerton College) Supervisor: Dr Anna Korhonen, Dr Pietro Lio Department of Computer Science University of Cambridge
More informationNetwork Infusion to Infer Information Sources in Networks Soheil Feizi, Ken Duffy, Manolis Kellis, and Muriel Medard
Computer Science and Artificial Intelligence Laboratory Technical Report MIT-CSAIL-TR-214-28 December 2, 214 Network Infusion to Infer Information Sources in Networks Soheil Feizi, Ken Duffy, Manolis Kellis,
More informationModeling face-to-face social interaction networks
Modeling face-to-face social interaction networks Romualdo Pastor-Satorras Dept. Fisica i Enginyería Nuclear Universitat Politècnica de Catalunya Spain http://www.fen.upc.edu/~romu Work done in collaboration
More informationIntroduction to Search Engine Technology Introduction to Link Structure Analysis. Ronny Lempel Yahoo Labs, Haifa
Introduction to Search Engine Technology Introduction to Link Structure Analysis Ronny Lempel Yahoo Labs, Haifa Outline Anchor-text indexing Mathematical Background Motivation for link structure analysis
More informationLecture II: Matrix Functions in Network Science, Part 1
Lecture II: Matrix Functions in Network Science, Part 1 Michele Benzi Department of Mathematics and Computer Science Emory University Atlanta, Georgia, USA Summer School on Theory and Computation of Matrix
More informationECS 253 / MAE 253, Lecture 13 May 15, Diffusion, Cascades and Influence Mathematical models & generating functions
ECS 253 / MAE 253, Lecture 13 May 15, 2018 Diffusion, Cascades and Influence Mathematical models & generating functions Last week: spatial flows and game theory on networks Optimal location of facilities
More informationAnalysis of an Optimal Measurement Index Based on the Complex Network
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 5 Special Issue on Application of Advanced Computing and Simulation in Information Systems Sofia 2016 Print ISSN: 1311-9702;
More informationIntelligent Data Analysis. PageRank. School of Computer Science University of Birmingham
Intelligent Data Analysis PageRank Peter Tiňo School of Computer Science University of Birmingham Information Retrieval on the Web Most scoring methods on the Web have been derived in the context of Information
More informationFacebook Friends! and Matrix Functions
Facebook Friends! and Matrix Functions! Graduate Research Day Joint with David F. Gleich, (Purdue), supported by" NSF CAREER 1149756-CCF Kyle Kloster! Purdue University! Network Analysis Use linear algebra
More informationMetrics: Growth, dimension, expansion
Metrics: Growth, dimension, expansion Social and Technological Networks Rik Sarkar University of Edinburgh, 2017. Metric A distance measure d is a metric if: d(u,v) 0 d(u,v) = 0 iff u=v d(u,v) = d(u,v)
More informationNetworks as vectors of their motif frequencies and 2-norm distance as a measure of similarity
Networks as vectors of their motif frequencies and 2-norm distance as a measure of similarity CS322 Project Writeup Semih Salihoglu Stanford University 353 Serra Street Stanford, CA semih@stanford.edu
More informationSynchronization in Quotient Network Based on Symmetry
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2014, 8, 455-461 455 Synchronization in Quotient Network Based on Symmetry Open Access Tao Shaohua,1, Feng
More informationTemporal Networks aka time-varying networks, time-stamped graphs, dynamical networks...
Temporal Networks aka time-varying networks, time-stamped graphs, dynamical networks... Network Theory and Applications ECS 253 / MAE 253 Spring 2016 Márton Pósfai (posfai@ucdavis.edu) Sources Reviews:
More informationData science with multilayer networks: Mathematical foundations and applications
Data science with multilayer networks: Mathematical foundations and applications CDSE Days University at Buffalo, State University of New York Monday April 9, 2018 Dane Taylor Assistant Professor of Mathematics
More informationFriendship and Mobility: User Movement In Location-Based Social Networks. Eunjoon Cho* Seth A. Myers* Jure Leskovec
Friendship and Mobility: User Movement In Location-Based Social Networks Eunjoon Cho* Seth A. Myers* Jure Leskovec Outline Introduction Related Work Data Observations from Data Model of Human Mobility
More informationFour graph partitioning algorithms. Fan Chung University of California, San Diego
Four graph partitioning algorithms Fan Chung University of California, San Diego History of graph partitioning NP-hard approximation algorithms Spectral method, Fiedler 73, Folklore Multicommunity flow,
More informationGroups of vertices and Core-periphery structure. By: Ralucca Gera, Applied math department, Naval Postgraduate School Monterey, CA, USA
Groups of vertices and Core-periphery structure By: Ralucca Gera, Applied math department, Naval Postgraduate School Monterey, CA, USA Mostly observed real networks have: Why? Heavy tail (powerlaw most
More informationMachine Learning for Data Science (CS4786) Lecture 11
Machine Learning for Data Science (CS4786) Lecture 11 Spectral clustering Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2016sp/ ANNOUNCEMENT 1 Assignment P1 the Diagnostic assignment 1 will
More informationKINETICS OF SOCIAL CONTAGION. János Kertész Central European University. SNU, June
KINETICS OF SOCIAL CONTAGION János Kertész Central European University SNU, June 1 2016 Theory: Zhongyuan Ruan, Gerardo Iniguez, Marton Karsai, JK: Kinetics of social contagion Phys. Rev. Lett. 115, 218702
More informationORIE 6334 Spectral Graph Theory September 22, Lecture 11
ORIE 6334 Spectral Graph Theory September, 06 Lecturer: David P. Williamson Lecture Scribe: Pu Yang In today s lecture we will focus on discrete time random walks on undirected graphs. Specifically, we
More informationSlide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University.
Slide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University http://www.mmds.org #1: C4.5 Decision Tree - Classification (61 votes) #2: K-Means - Clustering
More informationKINETICS OF COMPLEX SOCIAL CONTAGION. János Kertész Central European University. Pohang, May 27, 2016
KINETICS OF COMPLEX SOCIAL CONTAGION János Kertész Central European University Pohang, May 27, 2016 Theory: Zhongyuan Ruan, Gerardo Iniguez, Marton Karsai, JK: Kinetics of social contagion Phys. Rev. Lett.
More informationOnline Sampling of High Centrality Individuals in Social Networks
Online Sampling of High Centrality Individuals in Social Networks Arun S. Maiya and Tanya Y. Berger-Wolf Department of Computer Science University of Illinois at Chicago 85 S. Morgan, Chicago, IL 667,
More informationLink Prediction. Eman Badr Mohammed Saquib Akmal Khan
Link Prediction Eman Badr Mohammed Saquib Akmal Khan 11-06-2013 Link Prediction Which pair of nodes should be connected? Applications Facebook friend suggestion Recommendation systems Monitoring and controlling
More informationComplex Networks CSYS/MATH 303, Spring, Prof. Peter Dodds
Complex Networks CSYS/MATH 303, Spring, 2011 Prof. Peter Dodds Department of Mathematics & Statistics Center for Complex Systems Vermont Advanced Computing Center University of Vermont Licensed under the
More informationInfluence Maximization in Dynamic Social Networks
Influence Maximization in Dynamic Social Networks Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang and Xiaoming Sun Department of Computer Science and Technology, Tsinghua University Department of Computer
More informationDiffusion of Innovations in Social Networks
Daron Acemoglu Massachusetts Institute of Technology, Department of Economics, Cambridge, MA, 02139, daron@mit.edu Diffusion of Innovations in Social Networks Asuman Ozdaglar Massachusetts Institute of
More informationDiffusion of Innovation
Diffusion of Innovation Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Social Network Analysis
More informationNetwork Observational Methods and. Quantitative Metrics: II
Network Observational Methods and Whitney topics Quantitative Metrics: II Community structure (some done already in Constraints - I) The Zachary Karate club story Degree correlation Calculating degree
More informationCommunities Via Laplacian Matrices. Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices
Communities Via Laplacian Matrices Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices The Laplacian Approach As with betweenness approach, we want to divide a social graph into
More informationInformation Retrieval and Search. Web Linkage Mining. Miłosz Kadziński
Web Linkage Analysis D24 D4 : Web Linkage Mining Miłosz Kadziński Institute of Computing Science Poznan University of Technology, Poland www.cs.put.poznan.pl/mkadzinski/wpi Web mining: Web Mining Discovery
More information