Modeling Social and Information Networks: Opportunities for Machine Learning
Description
Emergence of the web, social media and online social networking websites gave rise to detailed traces of human social activity. This offers many opportunities to analyze and model behaviors of millions of people. For example, we can now study ''planetary scale'' dynamics of a full Microsoft Instant Messenger network of 240 million people, with more than 255 billion exchanged messages per month.
Many types of data, especially web and "social" data, come in a form of a network or a graph. This tutorial will cover several aspects of such network data: macroscopic properties of network data sets; statistical models for modeling large scale network structure of static and dynamic networks; properties and models of network structure and evolution at the level of groups of nodes and algorithms for extracting such structures. I will also present several applications and case studies of blogs, instant messaging, Wikipedia and web search.
Machine learning as a topic will be present throughout the tutorial. The idea of the tutorial is to introduce the machine learning community to recent developments in the area of social and information networks that underpin the Web and other on-line media.
| Slides | |
| 0:00 | Modeling Large Social & Information Networks |
| 0:26 | About the tutorial |
| 0:56 | Networks: rich data |
| 1:57 | Why networks? |
| 3:58 | Networks of the Real-world (1) |
| 6:01 | Networks of the Real-world (2) |
| 6:48 | Networks as Phenomena |
| 7:28 | Models and Laws of Networks |
| 8:21 | Mining Social Network Data |
| 10:03 | Networks: Rich Social Data |
| 10:56 | Networks: A Matter of Scale |
| 11:41 | Networks: Scale Matters |
| 12:53 | Networks: Structure & Process |
| 13:45 | Tutorial outline |
| 15:01 | Modeling global network structure |
| 15:05 | Motivation |
| 15:08 | Random graph model |
| 16:08 | Properties of random graphs |
| 19:55 | Degrees in real networks (1) |
| 20:44 | Degrees in real networks (2) |
| 21:40 | Degrees in real networks (3) |
| 24:25 | The long tail |
| 26:49 | Power law degree exponents |
| 27:51 | Estimating alpha |
| 30:12 | Flickr: Power-law degree exponent |
| 31:49 | Poisson vs. Scale-free networks |
| 32:37 | Model: Preferential attachment |
| 34:40 | Many extensions and variations |
| 36:09 | Does Preferential attachment hold? (1) |
| 36:48 | Does Preferential attachment hold? (2) |
| 38:28 | Consequence 1: network resilience |
| 40:16 | Consequence 2: Web search |
| 41:10 | Properties of social networks |
| 42:21 | World social network |
| 43:01 | Small world of messaging (1) |
| 44:03 | Small world of messaging (2) |
| 44:13 | Edge locality in networks |
| 47:14 | Small-world model (1) |
| 47:40 | Small-world model (2) |
| 48:31 | Clustering and diameter in a Small-world model |
| 50:02 | Consequence: Navigation (1) |
| 51:14 | Consequence: Navigation (2) |
| 52:15 | Consequence: Navigation (3) |
| 54:11 | Network evolution (1) |
| 55:39 | Network evolution (2) |
| 57:11 | Diameter of a densifying G |
| 57:50 | Diameter of a rewired network |
| 58:54 | Modeling densification & diameter |
| 60:38 | Generating realistic graphs |
| 61:59 | Kronecker product: Definition |
| 62:58 | Kronecker graphs (1) |
| 63:48 | Kronecker graphs (2) |
| 65:49 | Kronecker initiator matrices |
| 66:27 | Kronecker graphs: Interpretation |
| 69:15 | Estimating Kronecker graphs |
| 71:25 | Kronecker graphs: Estimation |
| 71:29 | Estimation: Epinions |
| 72:40 | Kronecker: Consequences |
| 73:28 | Modeling local network structure (links) |
| 73:54 | Link prediction in networks |
| 74:17 | Link prediction via node distance (1) |
| 74:53 | Link prediction via node distance (2) |
| 75:19 | Link prediction via node distance (3) |
| 76:28 | Link prediction via node distance (4) |
| 78:33 | Hierarchical random graphs |
| 79:43 | HRG: More examples |
| 80:25 | HRG: Model estimation (1) |
| 82:09 | HRG: Model estimation (2) |
| 83:07 | HRG: Consensus hierarchies |
| 83:09 | HRG: Link prediction (1) |
| 84:32 | Exponential random graphs (p*) |
| 85:05 | p*: Definition |
| 85:29 | p*: What kinds of features? |
| 86:20 | Example: p1 (earliest ERG model) |
| 87:18 | p*: Parameter estimation |
| 87:40 | p*: Maximizing likelihood |
| 87:44 | p*: Example |
| 89:28 | p*: Issues |
| 90:10 | Statistical Relational Learning |
| 91:20 | Network structure at the level of groups of nodes |
| 91:40 | Group formation in networks |
| 93:32 | Group growth as diffusion |
| 94:21 | P(join) vs. # friends in the group |
| 95:33 | Groups: More subtle features |
| 96:01 | Connectedness of Friends (1) |
| 97:15 | Connectedness of Friends (2) |
| 97:57 | Connectedness of Friends (1) |
| 98:05 | Connectedness of Friends (2) |
| 98:10 | Predicting group growth |
| 98:57 | Network communities |
| 99:52 | Finding network communities |
| 100:18 | Network communities |
| 100:27 | Finding network communities |
| 100:28 | Social Network Data |
| 101:01 | Micro-markets in sponsored search |
| 101:46 | Clustering and Community Finding |
| 102:39 | Hierarchically nested communities |
| 103:17 | Algorithm of Girvan-Newman (1) |
| 104:38 | Algorithm of Girvan-Newman (2) |
| 105:01 | Girvan-Newman: Results (1) |
| 105:47 | Girvan-Newman: Results (2) |
| 106:11 | How to compute betweenness (1) |
| 106:45 | How to compute betweenness (2) |
| 107:27 | How to compute betweenness (3) |
| 109:32 | Girvan-Newman: Results (1) |
| 109:46 | Hierarchical random graphs |
| 110:58 | Network communities |
| 111:25 | Small vs. Large networks |
| 112:03 | How expressed are communities? |
| 114:10 | Community score (quality) (1) |
| 114:20 | Community score (quality) (2) |
| 114:28 | Community score (quality) (3) |
| 114:37 | Community score (quality) (4) |
| 114:49 | Network Community Profile Plot (1) |
| 115:46 | Network Community Profile Plot (2) |
| 116:42 | Probing networks |
| 117:02 | Network Community Profile Plot (2) |
| 117:04 | Probing networks |
| 117:42 | NCP plot: Meshes |
| 119:24 | NCP plot: Manifold dataset |
| 120:00 | NCP plot: Zachary's karate club |
| 120:04 | NCP plot: Network Science |
| 121:09 | NCP plot: Hierarchical networks |
| 121:57 | Natural hypothesis |
| 122:26 | Large networks: Very different |
| 123:01 | More NCP plots of networks |
| 123:31 | NCP: LiveJournal |
| 124:09 | Explanation: Upward part |
| 125:11 | Explanation: Downward part |
| 126:04 | Community size is constant |
| 127:20 | What if we remove whiskers? (1) |
| 128:16 | What if we remove whiskers? (2) |
| 128:25 | Suggested network structure |
| 129:32 | Caveat: How do we cut? |
| 129:34 | NCP: Complete picture |
| 129:37 | Kronecker & Network structure (1) |
| 130:48 | Kronecker & Network structure (2) |
| 132:22 | Small vs. Large networks |
| 133:10 | Cluster structure of large networks |
| 134:00 | Comparison with "Ground truth" (1) |
| 135:36 | Comparison with "Ground truth" (2) |
| 137:05 | Community structure: Conclusion |
| 137:48 | Community structure: Implications |
| 138:52 | The end: Conclusion |
| 139:14 | The end: Reflections (1) |
| 139:29 | The end: Reflections (2) |
| 140:16 | The end: Reflections (3) |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





