Social Dynamics of Informa0on Kris0na Lerman USC Informa0on Sciences Ins0tute
|
|
- Arleen Bennett
- 6 years ago
- Views:
Transcription
1 Social Dynamics of Informa0on Kris0na Lerman USC Informa0on Sciences Ins0tute h"p://
2 Social media has changed how people create, share and consume informa:on h"p://blog.socialflow.com/post/ / breaking- bin- laden- visualizing- the- power- of- a- single
3 Social informa0cs
4 Outline 1. A meme is not a virus uncovering the microscopic mechanisms of informa:on spread how psychological factors shape social interac:ons and the diffusion of informa:on 2. Measuring network structure How social interac:ons affect how we measure network structure e.g., iden:fy central nodes and communi:es in the network Explore these ques:ons via empirical studies of social media
5 Social news on Twi;er Users tweet short messages Retweet posts of others Tweets may contain URLs to online content, news Social networks Users follow friends to see Tweets by friends Retweets by friends Dataset sta:s:cs 70K URLs 700K users, 36M edges
6 Social news on Digg Users share news Submit links to news stories Vote on stories of submi"ed by others Social networks Users follow friends to see Stories friends submi"ed Stories friends voted on Dataset sta:s:cs* 3.5K stories 258K users, 1.7M edges *h"p://
7 A meme is not a virus: How is informa0on spead different from an epidemic?
8 Informa0on spread as social contagion A meme is an idea that behaves like a virus that moves through a popula:on, taking hold in each person it infects M. Gladwell infected exposed
9 Informa0on spread as social contagion A meme is an idea that behaves like a virus that moves through a popula:on, taking hold in each person it infects M. Gladwell infected exposed
10 Mechanics of contagion: epidemic threshold How many people are infected in an outbreak? standard model of contagion (independent cascade)
11 Mechanics of contagion: epidemic threshold How many people are infected in an outbreak? standard model of contagion (independent cascade) dies out goes viral epidemic threshold
12 Distribu0on of outbreaks in social media How many people are infected by informa0on? # connected users who share (re- tweet) a post with same URL Digg 3.5K URLs 258K users 1.7M edges Twi;er 70K URLs 700K users 36M edges [Lerman et al. Social Contagion: An Empirical Study of Informa0on Spread on Digg and Twi;er Follower Graphs arxiv: ]
13 Distribu0on of outbreaks in social media Viral outbreaks in social media are rare In most cases, memes reach small frac:on of poten:al audience Why?
14 How do people respond to repeated exposures? Exposure response: probability of infec0on given x infected friends p(infec:on x) Non- monotonic exposure response also observed on Twi"er [Romero et al, 2011] #infected friends [Ver Steeg, Ghosh & Lerman What Stops Social Epidemics? in ICWSM arxiv: ]
15 Failure to respond to repeated exposures limits epidemic size in social media Epidemic threshold unchanged Es:mated transmissibility actual cascades simulated cascades using empirical exposure response [Ver Steeg, Ghosh & Lerman What Stops Social Epidemics? in ICWSM arxiv: ]
16
17 A;en0on and the Web Evidence from eye- tracking studies prob. to view post posi:on [Counts & Fisher ICWSM 11] A;en0on limits how far down the page a user navigates
18 Visibility and limited a;en0on new post at top of user s queue post visibility prob. to view post post near the top is highly visible: takes li;le effort to find; user is more likely to see it posi:on
19 Visibility and limited a;en0on some 0me later: newer posts appear at the top post visibility prob. to view post posi:on post is less visible: takes more effort to find; user is less likely to see it
20 Visibility and GUI Twi;er visibility: repost moves it to top posi0on prob. to view post Digg visibility: repost does not change posi0on prob. to view post posi:on posi:on web site GUI affects visibility of reposted memes
21 Users retweet a post when it is most visible Retweet probability vs 0me since exposure by a friend Twi;er (single exposure) Digg Visibility decays as friends add new posts to a user s 0meline: the more friends, the quicker the decay [Hodas & Lerman How Limited Visibility and Divided A;en0on Constrain Social Contagion in SocialCom arxiv: ]
22 Users divide a;en0on over all friends Repost probability vs number of friends user follows (single exposure) Twi;er Digg [Hodas & Lerman How Limited Visibility and Divided A;en0on Constrain Social Contagion in SocialCom arxiv: ]
23 Summary Social contagion is different from viral contagion Due to their limited a"en:on, highly connected people are less suscep:ble to becoming infected Rapidly decaying visibility of posts, combined with limited a"en:on, prevents social epidemics from spreading More info Ver Steeg, Ghosh & Lerman. What Stops Social Epidemics? in ICWSM arxiv: Hodas & Lerman How Limited Visibility and Divided A"en:on Constrain Social Contagion in SocialCom arxiv:
24 Measuring network structure: structure = topology x dynamics
25 Analyzing network structure Central nodes Community structure Strength of :es Zachary, J. Anthro. Research 33 No. 4. (1977)
26 Analyzing network structure Central nodes Network structure is a product of both topology and dynamics Community structure Strength of :es Mathema0cal framework Empirical analysis of data Numerical simula0ons Zachary, J. Anthro. Research 33 No. 4. (1977)
27 Dynamic processes on networks Random walk Epidemics Transi:on rule A"empt to infect one out- neighbor Models Phone calls, web surfing, money exchange, Transi:on rule A"empt to infect all out- neighbors Models Viral contagion, signaling by broadcasts
28 Dynamic processes and centrality A node is central if it is owen visited by the dynamic process random walk dynamics epidemic dynamics steady state distribu:on given by PageRank [Brin & Page, 1998] steady state distribu:on given by Alpha- Centrality [Bonacich, 1987]
29 adjacency matrix A = out- degree matrix D out = D in = in- degree matrix
30 Tangent: Alpha- Centrality (AC) [Bonacich 1987] cr α = A + αa 2 + α 2 A = A(I αa) 1 Measures the number of paths between nodes, each path a"enuated by its length with parameter α Holds while α < 1/λ max, where λ max is largest eigenvalue of A Parameter α sets the length scale of interac:ons α = 0: only neighbors contribute to cr α degree centrality α 1/λ max : more distant nodes contribute, un:l cr α becomes a global metric eigenvector centrality length scale diverges Diverging length scale Cri:cal phenomenon [Ghosh and Lerman, Parameterized Metric for Network Analysis Physical Review E, 2011]
31 What is the cri0cal phenomenon? Epidemic threshold Cri:cal value of transmissibility α c =1/λ max [Wang et al., 2003] For α < α c, epidemic dies out, i.e., reaches vanishing frac:on of nodes For α > α c, epidemic reaches a large frac:on of nodes 1/λ max [Ver Steeg, Ghosh & Lerman, What stops social epidemics? ICWSM, 2011]
32 Limited- a;en0on dynamics Epidemics Limited- a"en:on epidemics Transi:on rule A"empt to infect all out- neighbors Models Viral contagion, signaling by broadcasts Transi:on rule A"empt to infect all out- neighbors Suscep:bility ~ 1/in- degree Models Communica:on in social media
33 Limited- a;en0on Alpha- Centrality (laac) lacr α = AD 1 in + α( 1 AD ) 2 in + α 2 ( 1 AD ) 3 in +... during an epidemic: AC. limited- a;en0on epidemic: laac α=0.14
34 Likelihood of an infec0on random walk w/jump: PageRank (PR) limited- a;en0on random walk w/jumps (lapr) random jump prob.= 0.14
35 Likelihood of an infec0on during an epidemic [AC] limited- a;en0on epidemic [laac] during a random walk w/ restarts [PageRank] limited- a;en0on random walk w/restarts [lapagerank]
36 Choosing appropriate centrality: social media case study follower submitter follower follower
37 Gold standard
38 Which centrality is right for social media? Correla:on between the gold standard and the rankings predicted by Alpha- Centrality and limited- a;en0on AC Digg Twi;er limited- a"en:on Alpha- Centrality best predicts node centrality [Lerman et al., Designing Centrality for Social Media submi"ed to SDM 13]
39 Community detec0on Divide the network into group such that nodes within a group are more similar to each other than to other nodes [Zachary An Informa0on Flow Model for Conflict and Fission in Small Groups. J. Anthro. Research 33 No. 4. (1977)]
40 Dynamics of synchroniza0on in networks ater a long 0me Hierarchical community structure revealed en route to synchroniza0on [Arenas et al. Synchroniza0on Reveals Topological Scales in Complex Networks, Phys. Rev. LeE. 96 (2006)]
41 Mathema0cs of synchroniza0on Random walks Kuramoto model of coupled oscillators nodes are coupled via diffusive interac:ons (random walk- like) Linear model: Laplacian
42 Mathema0cs of synchroniza0on Random walks Kuramoto model of coupled oscillators nodes are coupled via diffusive interac:ons (random walk- like) Epidemics Non- conserva:ve model of coupled oscillators nodes are coupled through epidemic- like interac:ons Linear model: Laplacian Linear model: Replicator
43 Network structure via the eigenvalue spectrum Eigenvalue spectrum characterizes graph structure Number of null eigvals of L # disconnected components Time to reach steady state smallest posi:ve eigval (Cheeger bound) Gaps between consecu:ve eigvals rela:ve difference of :me scales
44 Network structure via simulated dynamics Simulate different synchroniza:on models (L vs R) star:ng from a random ini:al configura:on Measure similarity (degree of synchroniza:on) between nodes awer a period of :me Cluster nodes by their similarity i.e., nodes in the same cluster are more synchronized with each other than with nodes in other clusters
45 Network structure via simulated dynamics Degree of synchroniza:on of pairs of nodes in the Karate Club network over :me More synchronized Less synchronized
46 Community structure of karate club
47 Community structure of Digg social network Whiskers Core
48 Community structure of Digg social network is preserved at 0ghter resolu0on scales Whiskers Core
49 Community structure of Digg social network is preserved at 0ghter resolu0on scales Whiskers Core
50 Community structure of Digg social network is preserved at 0ghter resolu0on scales Whiskers
51 Dynamics reveals different views of network structure core of Digg small communi:es (whiskers) Li"le overlap between the cores discovered by the two models 40K nodes 360K edges total 3.7K users in small communi:es 450 users in small communi:es [Ghosh & Lerman, Role of Dynamic Interac:ons in Mul:- scale Analysis of Community Structure arxiv preprint]
52 Dynamics reveals different views of network structure Quality of small communi:es Quality is measured by co- ac:vity of pairs of community members Anomalous communi:es discovered by conserva:ve model in the center of the network (scale =1) A 13- core group of 26 users with 300 co- votes on average A 4- core group of 9 users with 600 co- votes on average [Ghosh & Lerman, Role of Dynamic Interac:ons in Mul:- scale Analysis of Community Structure arxiv proprint]
53 also for Facebook social network core of AU network small communi:es (whiskers) Li"le overlap between the cores discovered by the two models 6.4K nodes 200K edges total 1.3K users in small communi:es 32 users in small communi:es [Ghosh & Lerman, Role of Dynamic Interac:ons in Mul:- scale Analysis of Community Structure arxiv preprint]
54 Summary Informa:on diffusion in social media What stops social epidemics? in ICWSM- 11 How limited visibility and divided a"en:on constrain social contagion, in Social Compu:ng 2012 Dynamics and network structure Centrality Rethinking centrality: the role of dynamical processes in social network analysis, arxiv: Communi:es Network structure, topology & dynamics in synchroniza:on, Phys. Rev E. 2012, arxiv: Social :es Using proximity to predict ac:vity in social networks, arxiv:
55 Acknowledgments Collaborators Rumi Ghosh (USC Ph.D., 2012) Nathan Hodas Greg Ver Steeg Jeon- Hyung Kang Tad Hogg Sponsors
Social and Technological Network Analysis. Lecture 4: Community Detec=on and Overlapping Communi=es. Dr. Cecilia Mascolo
Social and Technological Network Analysis Lecture 4: Community Detec=on and Overlapping Communi=es Dr. Cecilia Mascolo Communi=es Weak =es (Lecture 2) seemed to bridge groups of =ghtly coupled nodes (communi=es)
More informationSocial and Technological Network Analysis. Lecture 4: Community Detec=on and Overlapping Communi=es. Prof. Cecilia Mascolo
Social and Technological Network Analysis Lecture 4: Community Detec=on and Overlapping Communi=es Prof. Cecilia Mascolo Communi=es Weak =es (Lecture 2) seemed to bridge groups of =ghtly coupled nodes
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 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 informationPPI Network Alignment Advanced Topics in Computa8onal Genomics
PPI Network Alignment 02-715 Advanced Topics in Computa8onal Genomics PPI Network Alignment Compara8ve analysis of PPI networks across different species by aligning the PPI networks Find func8onal orthologs
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 informationMining Social Network Graphs
Mining Social Network Graphs Analysis of Large Graphs: Community Detection Rafael Ferreira da Silva rafsilva@isi.edu http://rafaelsilva.com Note to other teachers and users of these slides: We would be
More informationDiffusion and Clustering on Large Graphs
Diffusion and Clustering on Large Graphs Alexander Tsiatas Thesis Proposal / Advancement Exam 8 December 2011 Introduction Graphs are omnipresent in the real world both natural and man-made Examples of
More informationCS 5614: (Big) Data Management Systems. B. Aditya Prakash Lecture #21: Graph Mining 2
CS 5614: (Big) Data Management Systems B. Aditya Prakash Lecture #21: Graph Mining 2 Networks & Communi>es We o@en think of networks being organized into modules, cluster, communi>es: VT CS 5614 2 Goal:
More informationSocial Networks Measures. Single- node Measures: Based on some proper7es of specific nodes Graph- based measures: Based on the graph- structure
Social Networks Measures Single- node Measures: Based on some proper7es of specific nodes Graph- based measures: Based on the graph- structure of the network Graph- based measures of social influence Previously
More informationImpact of Clustering on Epidemics in Random Networks
Impact of Clustering on Epidemics in Random Networks Joint work with Marc Lelarge INRIA-ENS 8 March 2012 Coupechoux - Lelarge (INRIA-ENS) Epidemics in Random Networks 8 March 2012 1 / 19 Outline 1 Introduction
More informationUsing Sequen+al Run+me Distribu+ons for the Parallel Speedup Predic+on of SAT Local Search
Using Sequen+al Run+me Distribu+ons for the Parallel Speedup Predic+on of SAT Local Search Alejandro Arbelaez - CharloBe Truchet - Philippe Codognet JFLI University of Tokyo LINA, UMR 6241 University of
More informationCascades. Rik Sarkar. Social and Technological Networks. University of Edinburgh, 2018.
Cascades Social and Technological Networks Rik Sarkar University of Edinburgh, 2018. Course Solutions to Ex0 are up Make sure you are comfortable with this material Notes 1 with exercise questions are
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 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 a
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 informationIntroduction to network metrics
Universitat Politècnica de Catalunya Version 0.5 Complex and Social Networks (2018-2019) Master in Innovation and Research in Informatics (MIRI) Instructors Argimiro Arratia, argimiro@cs.upc.edu, http://www.cs.upc.edu/~argimiro/
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 informationNon Overlapping Communities
Non Overlapping Communities Davide Mottin, Konstantina Lazaridou HassoPlattner Institute Graph Mining course Winter Semester 2016 Acknowledgements Most of this lecture is taken from: http://web.stanford.edu/class/cs224w/slides
More informationSupplementary material to Epidemic spreading on complex networks with community structures
Supplementary material to Epidemic spreading on complex networks with community structures Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden Supplementary otes Supplementary ote etwork
More informationLearning Network Graph of SIR Epidemic Cascades Using Minimal Hitting Set based Approach
Learning Network Graph of SIR Epidemic Cascades Using Minimal Hitting Set based Approach Zhuozhao Li and Haiying Shen Dept. of Electrical and Computer Engineering Clemson University, SC, USA Kang Chen
More informationCommunity Preserving Network Embedding
Community Preserving Network Embedding Xiao Wang, Peng Cui, Jing Wang, Jian Pei, Wenwu Zhu, Shiqiang Yang Presented by: Ben, Ashwati, SK What is Network Embedding 1. Representation of a node in an m-dimensional
More informationSocial-Network Graphs
Social-Network Graphs Mining Social Networks Facebook, Google+, Twitter Email Networks, Collaboration Networks Identify communities Similar to clustering Communities usually overlap Identify similarities
More informationCS6200 Informa.on Retrieval. David Smith College of Computer and Informa.on Science Northeastern University
CS6200 Informa.on Retrieval David Smith College of Computer and Informa.on Science Northeastern University Indexing Process Indexes Indexes are data structures designed to make search faster Text search
More informationLink Analysis Informa0on Retrieval. Evangelos Kanoulas
Link Analysis Informa0on Retrieval Evangelos Kanoulas e.kanoulas@uva.nl How Search Works Logging Clicks Context Crawling Quality Freshness Spaminess Text processing & Indexing Ranking Algorithm Content
More informationMachine Learning Crash Course: Part I
Machine Learning Crash Course: Part I Ariel Kleiner August 21, 2012 Machine learning exists at the intersec
More informationCentralities (4) By: Ralucca Gera, NPS. Excellence Through Knowledge
Centralities (4) By: Ralucca Gera, NPS Excellence Through Knowledge Some slide from last week that we didn t talk about in class: 2 PageRank algorithm Eigenvector centrality: i s Rank score is the sum
More informationCS60092: Informa0on Retrieval
Introduc)on to CS60092: Informa0on Retrieval Sourangshu Bha1acharya Today s lecture hypertext and links We look beyond the content of documents We begin to look at the hyperlinks between them Address ques)ons
More informationCS 6140: Machine Learning Spring 2017
CS 6140: Machine Learning Spring 2017 Instructor: Lu Wang College of Computer and Informa@on Science Northeastern University Webpage: www.ccs.neu.edu/home/luwang Email: luwang@ccs.neu.edu Logis@cs Grades
More informationCommunity-Based Recommendations: a Solution to the Cold Start Problem
Community-Based Recommendations: a Solution to the Cold Start Problem Shaghayegh Sahebi Intelligent Systems Program University of Pittsburgh sahebi@cs.pitt.edu William W. Cohen Machine Learning Department
More informationNetwork Analysis Integra2ve Genomics module
Network Analysis Integra2ve Genomics module Michael Inouye Centre for Systems Genomics University of Melbourne, Australia Summer Ins@tute in Sta@s@cal Gene@cs 2016 SeaBle, USA @minouye271 inouyelab.org
More informationL6: System design: behavior models
L6: System design: behavior models Limita6ons of func6onal decomposi6on Behavior models State diagrams Flow charts Data flow diagrams En6ty rela6onship diagrams Unified Modeling Language Capstone design
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 informationOnline Social Networks and Media
Online Social Networks and Media Absorbing Random Walks Link Prediction Why does the Power Method work? If a matrix R is real and symmetric, it has real eigenvalues and eigenvectors: λ, w, λ 2, w 2,, (λ
More informationEmbedding System Dynamics in Agent Based Models for Complex Adap;ve Systems
Embedding System Dynamics in Agent Based Models for Complex Adap;ve Systems Kiyan Ahmadizadeh, Maarika Teose, Carla Gomes, Yrjo Grohn, Steve Ellner, Eoin O Mahony, Becky Smith, Zhao Lu, Becky Mitchell
More informationTwi$er s Trending Topics exploita4on pa$erns
Twi$er s Trending Topics exploita4on pa$erns Despoina Antonakaki Paraskevi Fragopoulou, So6ris Ioannidis isocial Mee6ng, February 4-5th, 2014 Online Users World popula6ons percentage of online users: 39%
More informationChunking: An Empirical Evalua3on of So7ware Architecture (?)
Chunking: An Empirical Evalua3on of So7ware Architecture (?) Rachana Koneru David M. Weiss Iowa State University weiss@iastate.edu rachana.koneru@gmail.com With participation by Audris Mockus, Jeff St.
More informationA geometric model for on-line social networks
WOSN 10 June 22, 2010 A geometric model for on-line social networks Anthony Bonato Ryerson University Geometric model for OSNs 1 Complex Networks web graph, social networks, biological networks, internet
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 informationSearch Engines. Informa1on Retrieval in Prac1ce. Annotations by Michael L. Nelson
Search Engines Informa1on Retrieval in Prac1ce Annotations by Michael L. Nelson All slides Addison Wesley, 2008 Indexes Indexes are data structures designed to make search faster Text search has unique
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 Scale-Free Networks Generation Properties Analysis Dynamic
More informationOverlapping Communities
Yangyang Hou, Mu Wang, Yongyang Yu Purdue Univiersity Department of Computer Science April 25, 2013 Overview Datasets Algorithm I Algorithm II Algorithm III Evaluation Overview Graph models of many real
More informationSocial and Technological Network Analysis. Lecture 6: Network Robustness and Applica=ons. Dr. Cecilia Mascolo
Social and Technological Network Analysis Lecture 6: Network Robustness and Applica=ons Dr. Cecilia Mascolo In This Lecture We revisit power- law networks and define the concept of robustness We show the
More informationAn applica)on of Markov Chains: PageRank. Finding relevant informa)on on the Web
An applica)on of Markov Chains: PageRank Finding relevant informa)on on the Web Please Par)cipate h>p://www.st.ewi.tudelc.nl/~marco/lectures.html How much do you know about PageRank? 1) Nothing. 2) I
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 informationToday s lecture hypertext and links
Today s lecture hypertext and links Introduc*on to Informa(on Retrieval CS276 Informa*on Retrieval and Web Search Chris Manning and Pandu Nayak Link analysis We look beyond the content of documents We
More informationInforma(on Retrieval
Introduc*on to Informa(on Retrieval CS276 Informa*on Retrieval and Web Search Chris Manning and Pandu Nayak Link analysis Today s lecture hypertext and links We look beyond the content of documents We
More informationThis is not the chapter you re looking for [handwave]
Chapter 4 This is not the chapter you re looking for [handwave] The plan of this course was to have 4 parts, and the fourth part would be half on analyzing random graphs, and looking at different models,
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 informationHomework 4: Clustering, Recommenders, Dim. Reduction, ML and Graph Mining (due November 19 th, 2014, 2:30pm, in class hard-copy please)
Virginia Tech. Computer Science CS 5614 (Big) Data Management Systems Fall 2014, Prakash Homework 4: Clustering, Recommenders, Dim. Reduction, ML and Graph Mining (due November 19 th, 2014, 2:30pm, in
More informationCommunity Detection. Community
Community Detection Community In social sciences: Community is formed by individuals such that those within a group interact with each other more frequently than with those outside the group a.k.a. group,
More informationData fusion and multi-cue data matching using diffusion maps
Data fusion and multi-cue data matching using diffusion maps Stéphane Lafon Collaborators: Raphy Coifman, Andreas Glaser, Yosi Keller, Steven Zucker (Yale University) Part of this work was supported by
More informationWeek 10: DTMC Applications Randomized Routing. Network Performance 10-1
Week 10: DTMC Applications Randomized Routing Network Performance 10-1 Random Walk: Probabilistic Routing Random neighbor selection e.g. in ad-hoc/sensor network due to: Scalability: no routing table (e.g.
More informationThe Role of Information Scent in On-line Browsing:
The Role of Information Scent in On-line Browsing: Extensions of the ACT-R Utility and Concept Formation Mechanisms Peter Pirolli User Interface Research Area Supported in part by Office of Naval Research
More informationCombinatorial Mathema/cs and Algorithms at Exascale: Challenges and Promising Direc/ons
Combinatorial Mathema/cs and Algorithms at Exascale: Challenges and Promising Direc/ons Assefaw Gebremedhin Purdue University (Star/ng August 2014, Washington State University School of Electrical Engineering
More informationBasic Network Concepts
Basic Network Concepts Basic Vocabulary Alice Graph Network Edges Links Nodes Vertices Chuck Bob Edges Alice Chuck Bob Edge Weights Alice Chuck Bob Apollo 13 Movie Network Main Actors in Apollo 13 the
More informationTELCOM2125: Network Science and Analysis
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 2 Part 4: Dividing Networks into Clusters The problem l Graph partitioning
More informationThe Coral Project: Defending against Large-scale Attacks on the Internet. Chenxi Wang
1 The Coral Project: Defending against Large-scale Attacks on the Internet Chenxi Wang chenxi@cmu.edu http://www.ece.cmu.edu/coral.html The Motivation 2 Computer viruses and worms are a prevalent threat
More informationSearch Engines. Informa1on Retrieval in Prac1ce. Annota1ons by Michael L. Nelson
Search Engines Informa1on Retrieval in Prac1ce Annota1ons by Michael L. Nelson All slides Addison Wesley, 2008 Evalua1on Evalua1on is key to building effec$ve and efficient search engines measurement usually
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 informationSpectral Methods for Network Community Detection and Graph Partitioning
Spectral Methods for Network Community Detection and Graph Partitioning M. E. J. Newman Department of Physics, University of Michigan Presenters: Yunqi Guo Xueyin Yu Yuanqi Li 1 Outline: Community Detection
More informationDiffusion Models in Social Networks: Algorithmic and Game- theore<c Aspects
Diffusion Models in Social Networks: Algorithmic and Game- theore
More informationImage Analysis & Retrieval. CS/EE 5590 Special Topics (Class Ids: 44873, 44874) Fall 2016, M/W Lec 18.
Image Analysis & Retrieval CS/EE 5590 Special Topics (Class Ids: 44873, 44874) Fall 2016, M/W 4-5:15pm@Bloch 0012 Lec 18 Image Hashing Zhu Li Dept of CSEE, UMKC Office: FH560E, Email: lizhu@umkc.edu, Ph:
More informationArchitectures, and Protocol Design Issues for Mobile Social Networks: A Survey
Applica@ons, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey N. Kayastha,D. Niyato, P. Wang and E. Hossain, Proceedings of the IEEEVol. 99, No. 12, Dec. 2011. Sabita Maharjan
More informationOp#mizing PGAS overhead in a mul#-locale Chapel implementa#on of CoMD
Op#mizing PGAS overhead in a mul#-locale Chapel implementa#on of CoMD Riyaz Haque and David F. Richards This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore
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 informationBotGraph: Large Scale Spamming Botnet Detec5on
BotGraph: Large Scale Spamming Botnet Detec5on Yao Zhao Yinglian Xie *, Fang Yu *, Qifa Ke *, Yuan Yu *, Yan Chen and Eliot Gillum EECS Department, Northwestern University MicrosoK Research Silicon Valley
More information151 Project 3. Bison Management
Suppose you take over the management of a certain Bison popula8on. The popula8on dynamics are similar to those of the popula8on we considered in Project 2 but differ in a few important ways: The adult
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 the Web? First try: Human curated Web directories Yahoo, DMOZ, LookSmart Second
More informationWeb- Scale Mul,media: Op,mizing LSH. Malcolm Slaney Yury Li<shits Junfeng He Y! Research
Web- Scale Mul,media: Op,mizing LSH Malcolm Slaney Yury Li
More informationToday s Class. High Dimensional Data & Dimensionality Reduc8on. Readings for This Week: Today s Class. Scien8fic Data. Misc. Personal Data 2/22/12
High Dimensional Data & Dimensionality Reduc8on Readings for This Week: Graphical Histories for Visualiza8on: Suppor8ng Analysis, Communica8on, and Evalua8on, Jeffrey Heer, Jock D. Mackinlay, Chris Stolte,
More informationDependency Cycles in So/ware Systems: Quality Issues and Opportuni:es for Refactoring
Dependency Cycles in So/ware Systems: Quality Issues and Opportuni:es for Refactoring Tosin Daniel Oyetoyan Doctoral Thesis Presentation Trondheim, Norway June 26 th 2015 Agenda v Introduc)on v Research
More informationExtending Heuris.c Search
Extending Heuris.c Search Talk at Hebrew University, Cri.cal MAS group Roni Stern Department of Informa.on System Engineering, Ben Gurion University, Israel 1 Heuris.c search 2 Outline Combining lookahead
More informationExperimental Evaluation of TCP Performance in Multi-rate WLANs. Naeem Khademi, :30
Experimental Evaluation of TCP Performance in Multi-rate 802.11 WLANs Naeem Khademi, 07.06.2012 11:30 Rate Adapta)on (bit- rate selec)on) Rate Adapta)on (RA): predicts changes in the channel condi0on (random?)
More informationPrerequisites for Rou4ng
Basic Zroute Flow Prerequisites for Rou4ng Library requirements Zroute gets all of the design rule informa4on from the technology file; therefore, you must ensure that all design rules are defined in the
More informationRandom Simplicial Complexes
Random Simplicial Complexes Duke University CAT-School 2015 Oxford 8/9/2015 Part I Random Combinatorial Complexes Contents Introduction The Erdős Rényi Random Graph The Random d-complex The Random Clique
More informationDetecting and Analyzing Communities in Social Network Graphs for Targeted Marketing
Detecting and Analyzing Communities in Social Network Graphs for Targeted Marketing Gautam Bhat, Rajeev Kumar Singh Department of Computer Science and Engineering Shiv Nadar University Gautam Buddh Nagar,
More informationCommunity Detection Using Random Walk Label Propagation Algorithm and PageRank Algorithm over Social Network
Community Detection Using Random Walk Label Propagation Algorithm and PageRank Algorithm over Social Network 1 Monika Kasondra, 2 Prof. Kamal Sutaria, 1 M.E. Student, 2 Assistent Professor, 1 Computer
More informationMSA220 - Statistical Learning for Big Data
MSA220 - Statistical Learning for Big Data Lecture 13 Rebecka Jörnsten Mathematical Sciences University of Gothenburg and Chalmers University of Technology Clustering Explorative analysis - finding groups
More informationTools zur Op+mierung eingebe2eter Mul+core- Systeme. Bernhard Bauer
Tools zur Op+mierung eingebe2eter Mul+core- Systeme Bernhard Bauer Agenda Mo+va+on So.ware Engineering & Mul5core Think Parallel Models Added Value Tooling Quo Vadis? The Mul5core Era Moore s Law: The
More informationUnsupervised Learning. Mostly Clustering
Unsupervised Learning Mostly Clustering Word clustering Input: stack exchange ques
More informationModeling and Detecting Community Hierarchies
Modeling and Detecting Community Hierarchies Maria-Florina Balcan, Yingyu Liang Georgia Institute of Technology Age of Networks Massive amount of network data How to understand and utilize? Internet [1]
More informationMining Web Data. Lijun Zhang
Mining Web Data Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Web Crawling and Resource Discovery Search Engine Indexing and Query Processing Ranking Algorithms Recommender Systems
More informationApplying Data Visualiza0on to Analyze Ebola Call Center Trends
eh ea lth A F R I C A Applying Data Visualiza0on to Analyze Ebola Call Center Trends Sara Brown, MPH, CBIP Associate Crow Insight www.crowinsight.com Overview ehealth Africa & its role in figh=ng the Ebola
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 informationA Model For Predicting Influential Users In Social Network
A Model For Predicting Influential Users In Social Network Sriganga B K 1, Ragini Krishna 2, and Dr. Prashanth C M 3 1 Post Graduate Student, Dept of CS&E, SCE, Bangalore, India. 2 Mrs.Ragini Krishna,
More informationBuilding social services: Social TV case study
Building social services: Social TV case study CFP All-Members Meeting May 14, 2009 Venice, Italy Natalie Klym nklym@cfp.mit.edu The Social TV study combines two research streams The future of television
More informationCrowdsourcing the Acquisi3on and Analysis of Mobile Videos for Disaster Response
IEEE Big Data 2015, October 31, 2015 Crowdsourcing the Acquisi3on and Analysis of Mobile Videos for Disaster Response Presented by Hien To Dr. Seon Ho Kim Integrated Media Systems Center University of
More informationIdentification of top K influential communities in big networks
DOI 10.1186/s40537-016-0050-7 RESEARCH Open Access Identification of top K influential communities in big networks Justin Zhan *, Vivek Guidibande and Sai Phani Krishna Parsa *Correspondence: justin.zhan@unlv.edu
More informationClustering in Networks
Clustering in Networks (Spectral Clustering with the Graph Laplacian... a brief introduction) Tom Carter Computer Science CSU Stanislaus http://csustan.csustan.edu/ tom/clustering April 1, 2012 1 Our general
More informationMining Web Data. Lijun Zhang
Mining Web Data Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Web Crawling and Resource Discovery Search Engine Indexing and Query Processing Ranking Algorithms Recommender Systems
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 the Web? First try: Human curated Web directories Yahoo, DMOZ, LookSmart Second
More informationProbabilis)c Quality Models to Improve Communica)on and Ac)onability
Probabilis)c Quality Models to Improve Communica)on and Ac)onability Morgan Ericsson 1, Welf Löwe, Anna Wingkvist Linnaeus University, Sweden 1 email: morgan.ericsson@lnu.se, twi,er: @morganericsson Probabilis)c
More informationSEMINAR: GRAPH-BASED METHODS FOR NLP
SEMINAR: GRAPH-BASED METHODS FOR NLP Organisatorisches: Seminar findet komplett im Mai statt Seminarausarbeitungen bis 15. Juli (?) Hilfen Seminarvortrag / Ausarbeitung auf der Webseite Tucan number for
More informationCommunity detection algorithms survey and overlapping communities. Presented by Sai Ravi Kiran Mallampati
Community detection algorithms survey and overlapping communities Presented by Sai Ravi Kiran Mallampati (sairavi5@vt.edu) 1 Outline Various community detection algorithms: Intuition * Evaluation of the
More informationAbsorbing Random walks Coverage
DATA MINING LECTURE 3 Absorbing Random walks Coverage Random Walks on Graphs Random walk: Start from a node chosen uniformly at random with probability. n Pick one of the outgoing edges uniformly at random
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/2016fa/ Survey Survey Survey Competition I Out! Preliminary report of
More informationFounda'ons of Game AI
Founda'ons of Game AI Level 3 Basic Movement Prof Alexiei Dingli 2D Movement 2D Movement 2D Movement 2D Movement 2D Movement Movement Character considered as a point 3 Axis (x,y,z) Y (Up) Z X Character
More informationCOMP5331: Knowledge Discovery and Data Mining
COMP5331: Knowledge Discovery and Data Mining Acknowledgement: Slides modified based on the slides provided by Lawrence Page, Sergey Brin, Rajeev Motwani and Terry Winograd, Jon M. Kleinberg 1 1 PageRank
More informationVulnerability Analysis (III): Sta8c Analysis
Computer Security Course. Vulnerability Analysis (III): Sta8c Analysis Slide credit: Vijay D Silva 1 Efficiency of Symbolic Execu8on 2 A Sta8c Analysis Analogy 3 Syntac8c Analysis 4 Seman8cs- Based Analysis
More information