Mixed Membership Stochastic Blockmodels
|
|
|
- Isabella Fitzgerald
- 5 years ago
- Views:
Transcription
1 Mixed Membership Stochastic Blockmodels Journal of Machine Learning Research, 2008 by E.M. Airoldi, D.M. Blei, S.E. Fienberg, E.P. Xing as interpreted by Ted Westling STAT 572 Intro Talk April 22, 2014 Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 1
2 Overview 1. Notation and motivation 2. Previous blockmodels 3. The Mixed Membership Stochastic Blockmodel 4. Conclusion and next steps Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 2
3 Overview 1. Notation and motivation 2. Previous blockmodels 3. The Mixed Membership Stochastic Blockmodel 4. Conclusion and next steps Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 3
4 Network theory: notation Individuals p, q {1,..., N}. We observe relations/interactions R(p, q) on pairs of individuals. Here we assume R(p, q) {0, 1}, R(p, p) = 0, but do not assume R(p, q) = R(q, p) (we deal with directed networks). Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 4
5 Network theory: data representations p q R(p,q) Table 3 Graph Adjacency matrix i, j element is R(i, j) Adjacency matrix, black=1, white=0 Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 5
6 The Problem: Scientific Motivation We believe the relations are a function of unobserved groupings among the individuals. We want to recover the groups so we can a) predict new relations or b) interpret the existing network structure. Example: Monk network. Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 6
7 The Problem: Pictures Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 7
8 The Problem: Pictures Figure: Two visualizations of the same binary adjacency matrix. Each filled-in square represents a directed edge. Left: ordered randomly. Right: ordered by group membership. Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 7
9 Overview 1. Notation and motivation 2. Previous blockmodels 3. The Mixed Membership Stochastic Blockmodel 4. Conclusion and next steps Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 8
10 Brief blockmodel history 1975: CONCOR developed by Harrison White and colleagues 1983: Holland, Laskey & Leinhardt introduce stochastic blockmodel for blocks known a priori. 1987: Wasserman & Anderson extend to a posteriori estimation. 2004: Kemp, Griffiths & Tenenbaum allow unknown and unlimited number of blocks in the Infinite Relational Model. Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 9
11 Infinite Relational Model Observe binary relations R(p, q) between nodes p, q {1,..., N}. Each node p is a member of exactly one block of K total blocks, K N unknown. Let z p be an indicator vector of block membership for node p, i.e. z p = (0, 1, 0). B is a K K matrix of block relationships. If p is in block g and q is in block h then the probability of observing an interaction from node p to node q is B gh. R(p, q) Bernoulli(z T p Bz q ). For example, if p is in block 3 and q is in block 2 then P(R(p, q) = 1) = B 32. Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 10
12 Block structure Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 11
13 Overview 1. Notation and motivation 2. Previous blockmodels 3. The Mixed Membership Stochastic Blockmodel 4. Conclusion and next steps Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 12
14 The Mixed Membership Stochastic Blockmodel Previous models assume each node is assumed to belong to exactly one latent block - e.g. z p = (0, 1, 0, 0). Instead, in the MMB we assume each node has a distribution π p over the latent blocks. For each interaction from p to q, both p and q draw a particular block to be a part of for the interaction: z p q Discrete(π p ), z p q Discrete(π q ). Then R(p, q) Bernoulli(z T p qbz p q ). K chosen by BIC. Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 13
15 Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 14
16 Overview 1. Notation and motivation 2. Previous blockmodels 3. The Mixed Membership Stochastic Blockmodel 4. Conclusion and next steps Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 15
17 Conclusion and next steps Blockmodels allow clustering nodes from observed network data. MMB extends blockmodels to let nodes be in different groups to different extents, but commit to one group during any given interaction. Next steps: estimation... Ted Westling Mixed Membership Stochastic Blockmodels STAT 572 Intro Talk 16
Mixed Membership Stochastic Blockmodels
Mixed Membership Stochastic Blockmodels Journal of Machine Learning Research, 2008 by E.M. Airoldi, D.M. Blei, S.E. Fienberg, E.P. Xing as interpreted by Ted Westling STAT 572 Final Talk May 8, 2014 Ted
Mixed Membership Stochastic Blockmodels
Mixed Membership Stochastic Blockmodels (2008) Edoardo M. Airoldi, David M. Blei, Stephen E. Fienberg and Eric P. Xing Herrissa Lamothe Princeton University Herrissa Lamothe (Princeton University) Mixed
Two-sample hypothesis testing for random dot product graphs
Two-sample hypothesis testing for random dot product graphs Minh Tang Department of Applied Mathematics and Statistics Johns Hopkins University JSM 2014 Joint work with Avanti Athreya, Vince Lyzinski,
arxiv: v1 [cs.si] 7 Dec 2013
![arxiv: v1 [cs.si] 7 Dec 2013](/thumbs/96/127747645.jpg "arxiv: v1 [cs.si] 7 Dec 2013")
Sequential Monte Carlo Inference of Mixed Membership Stochastic Blockmodels for Dynamic Social Networks arxiv:1312.2154v1 [cs.si] 7 Dec 2013 Tomoki Kobayashi, Koji Eguchi Graduate School of System Informatics,
Applying Latent Dirichlet Allocation to Group Discovery in Large Graphs
Lawrence Livermore National Laboratory Applying Latent Dirichlet Allocation to Group Discovery in Large Graphs Keith Henderson and Tina Eliassi-Rad keith@llnl.gov and eliassi@llnl.gov This work was performed
Nonparametric Bayesian Matrix Factorization for Assortative Networks
Nonparametric Bayesian Matrix Factorization for Assortative Networks Mingyuan Zhou IROM Department, McCombs School of Business Department of Statistics and Data Sciences The University of Texas at Austin
GLAD: Group Anomaly Detection in Social Media Analysis
GLAD: Group Anomaly Detection in Social Media Analysis Poster #: 1150 Rose Yu, Xinran He and Yan Liu University of Southern California Group Anomaly Detection Anomalous phenomenon in social media data
Network Event Data over Time: Prediction and Latent Variable Modeling
Network Event Data over Time: Prediction and Latent Variable Modeling Padhraic Smyth University of California, Irvine Machine Learning with Graphs Workshop, July 25 th 2010 Acknowledgements PhD students:
Hierarchical Models for Social Networks
Hierarchical Models for Social Networks Tracy M. Sweet University of Maryland Innovative Assessment Collaboration November 4, 2014 Acknowledgements Program for Interdisciplinary Education Research (PIER)
IV. Analyse de réseaux biologiques
IV. Analyse de réseaux biologiques Catherine Matias CNRS - Laboratoire de Probabilités et Modèles Aléatoires, Paris catherine.matias@math.cnrs.fr http://cmatias.perso.math.cnrs.fr/ ENSAE - 2014/2015 Sommaire
arxiv: v2 [stat.ap] 24 Jul 2010
![arxiv: v2 [stat.ap] 24 Jul 2010](/thumbs/94/118914714.jpg "arxiv: v2 [stat.ap] 24 Jul 2010")
Variational Bayesian inference and complexity control for stochastic block models arxiv:0912.2873v2 [stat.ap] 24 Jul 2010 P. Latouche, E. Birmelé and C. Ambroise Laboratoire Statistique et Génome, UMR
Theory and Methods for the Analysis of Social Networks
Theory and Methods for the Analysis of Social Networks Alexander Volfovsky Department of Statistical Science, Duke University Lecture 1: January 16, 2018 1 / 35 Outline Jan 11 : Brief intro and Guest lecture
Statistical Mechanics of Semi Supervised Clustering in Sparse Graphs
Statistical Mechanics of Semi Supervised Clustering in Sparse Graphs Aram Galstyan and Greg Ver Steeg USC Information Science Institue Marina del Rey, CA 90292 galstyan,gregv@isi.edu Armen Allahverdyan
Mixed Membership Matrix Factorization
Mixed Membership Matrix Factorization Lester Mackey 1 David Weiss 2 Michael I. Jordan 1 1 University of California, Berkeley 2 University of Pennsylvania International Conference on Machine Learning, 2010
GraphRNN: A Deep Generative Model for Graphs (24 Feb 2018)
GraphRNN: A Deep Generative Model for Graphs (24 Feb 2018) Jiaxuan You, Rex Ying, Xiang Ren, William L. Hamilton, Jure Leskovec Presented by: Jesse Bettencourt and Harris Chan March 9, 2018 University
Random function priors for exchangeable arrays with applications to graphs and relational data
Random function priors for exchangeable arrays with applications to graphs and relational data James Robert Lloyd Department of Engineering University of Cambridge Peter Orbanz Department of Statistics
arxiv: v1 [stat.ml] 29 Jul 2012
![arxiv: v1 [stat.ml] 29 Jul 2012](/thumbs/86/94765812.jpg "arxiv: v1 [stat.ml] 29 Jul 2012")
arxiv:1207.6745v1 [stat.ml] 29 Jul 2012 Universally Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs Daniel L. Sussman, Minh Tang, Carey E. Priebe Johns Hopkins
A Modified Method Using the Bethe Hessian Matrix to Estimate the Number of Communities
Journal of Advanced Statistics, Vol. 3, No. 2, June 2018 https://dx.doi.org/10.22606/jas.2018.32001 15 A Modified Method Using the Bethe Hessian Matrix to Estimate the Number of Communities Laala Zeyneb
Modeling heterogeneity in random graphs
Modeling heterogeneity in random graphs Catherine MATIAS CNRS, Laboratoire Statistique & Génome, Évry (Soon: Laboratoire de Probabilités et Modèles Aléatoires, Paris) http://stat.genopole.cnrs.fr/ cmatias
arxiv: v1 [stat.me] 12 May 2017
![arxiv: v1 [stat.me] 12 May 2017](/thumbs/93/113616437.jpg "arxiv: v1 [stat.me] 12 May 2017")
Consistency of adjacency spectral embedding for the mixed membership stochastic blockmodel Patrick Rubin-Delanchy *, Carey E. Priebe **, and Minh Tang ** * University of Oxford and Heilbronn Institute
Mixed Membership Matrix Factorization
Mixed Membership Matrix Factorization Lester Mackey University of California, Berkeley Collaborators: David Weiss, University of Pennsylvania Michael I. Jordan, University of California, Berkeley 2011
Nonparametric Latent Feature Models for Link Prediction
Nonparametric Latent Feature Models for Link Prediction Kurt T. Miller EECS University of California Berkeley, CA 94720 tadayuki@cs.berkeley.edu Thomas L. Griffiths Psychology and Cognitive Science University
arxiv: v1 [stat.me] 30 May 2007
![arxiv: v1 [stat.me] 30 May 2007](/thumbs/83/87832290.jpg "arxiv: v1 [stat.me] 30 May 2007")
Mixed Membership Stochastic Blockmodels Edoardo M. Airoldi, Princeton University David M. Blei, Princeton University Stephen E. Fienberg, Carnegie Mellon University (eairoldi@princeton.edu) (blei@cs.princeton.edu)
Modeling homophily and stochastic equivalence in symmetric relational data
Modeling homophily and stochastic equivalence in symmetric relational data Peter D. Hoff Departments of Statistics and Biostatistics University of Washington Seattle, WA 98195-4322. hoff@stat.washington.edu
Modeling Organizational Positions Chapter 2
Modeling Organizational Positions Chapter 2 2.1 Social Structure as a Theoretical and Methodological Problem Chapter 1 outlines how organizational theorists have engaged a set of issues entailed in the
Confidence Sets for Network Structure
Confidence Sets for Network Structure Edoardo M. Airoldi 1, David S. Choi 2 and Patrick J. Wolfe 1 1 Department of Statistics, Harvard University 2 School of Engineering and Applied Sciences, Harvard University
Collaborative topic models: motivations cont
Collaborative topic models: motivations cont Two topics: machine learning social network analysis Two people: " boy Two articles: article A! girl article B Preferences: The boy likes A and B --- no problem.
Hierarchical Models, Nested Models and Completely Random Measures
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/238729763 Hierarchical Models, Nested Models and Completely Random Measures Article March 2012
An introduction to clustering techniques
- ABSTRACT Cluster analysis has been used in a wide variety of fields, such as marketing, social science, biology, pattern recognition etc. It is used to identify homogenous groups of cases to better understand
Nonparametric Mixed Membership Models
5 Nonparametric Mixed Membership Models Daniel Heinz Department of Mathematics and Statistics, Loyola University of Maryland, Baltimore, MD 21210, USA CONTENTS 5.1 Introduction................................................................................
Characterization and inference of weighted graph topologies from observations of diffused signals
Characterization and inference of weighted graph topologies from observations of diffused signals Bastien Pasdeloup*, Vincent Gripon*, Grégoire Mercier*, Dominique Pastor*, Michael G. Rabbat** * name.surname@telecom-bretagne.eu
A Latent Mixed Membership Model for Relational Data
A Latent Mixed Membership Model for Relational Data Edoardo Airoldi, David Blei, Eric Xing School of Computer Science Carnegie Mellon University {eairoldi,blei,xing}@cs.cmu.edu Stephen Fienberg Department
Outline Inverse of a Relation Properties of Relations. Relations. Alice E. Fischer. April, 2018
Relations Alice E. Fischer April, 2018 1 Inverse of a Relation 2 Properties of Relations The Inverse of a Relation Let R be a relation from A to B. Define the inverse relation, R 1 from B to A as follows.
Likelihood Inference for Large Scale Stochastic Blockmodels with Covariates based on a Divide-and-Conquer Parallelizable Algorithm with Communication
arxiv:1610.09724v2 [stat.co] 12 Feb 2018 Likelihood Inference for Large Scale Stochastic Blockmodels with Covariates based on a Divide-and-Conquer Parallelizable Algorithm with Communication Sandipan Roy,
Hierarchical Mixed Membership Stochastic Blockmodels for Multiple Networks and Experimental Interventions
22 Hierarchical Mixed Membership Stochastic Blockmodels for Multiple Networks and Experimental Interventions Tracy M. Sweet Department of Human Development and Quantitative Methodology, University of Maryland,
A Tensor Spectral Approach to Learning Mixed Membership Community Models
JMLR: Workshop and Conference Proceedings vol 30 (2013) 1 15 A Tensor Spectral Approach to Learning Mixed Membership Community Models Animashree Anandkumar University of California, Irvine Rong Ge Princeton
Intelligent Systems (AI-2)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 11 Oct, 3, 2016 CPSC 422, Lecture 11 Slide 1 422 big picture: Where are we? Query Planning Deterministic Logics First Order Logics Ontologies
Dynamic Probabilistic Models for Latent Feature Propagation in Social Networks
Dynamic Probabilistic Models for Latent Feature Propagation in Social Networks Creighton Heaukulani ckh28@cam.ac.uk Zoubin Ghahramani zoubin@eng.cam.ac.uk University of Cambridge, Dept. of Engineering,
Lecture 6: Gaussian Mixture Models (GMM)
Helsinki Institute for Information Technology Lecture 6: Gaussian Mixture Models (GMM) Pedram Daee 3.11.2015 Outline Gaussian Mixture Models (GMM) Models Model families and parameters Parameter learning
13: Variational inference II
10-708: Probabilistic Graphical Models, Spring 2015 13: Variational inference II Lecturer: Eric P. Xing Scribes: Ronghuo Zheng, Zhiting Hu, Yuntian Deng 1 Introduction We started to talk about variational
Learning latent structure in complex networks
Learning latent structure in complex networks Lars Kai Hansen www.imm.dtu.dk/~lkh Current network research issues: Social Media Neuroinformatics Machine learning Joint work with Morten Mørup, Sune Lehmann
Bayesian Learning (II)
Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen Bayesian Learning (II) Niels Landwehr Overview Probabilities, expected values, variance Basic concepts of Bayesian learning MAP
Haupthseminar: Machine Learning. Chinese Restaurant Process, Indian Buffet Process
Haupthseminar: Machine Learning Chinese Restaurant Process, Indian Buffet Process Agenda Motivation Chinese Restaurant Process- CRP Dirichlet Process Interlude on CRP Infinite and CRP mixture model Estimation
Topic Models. Brandon Malone. February 20, Latent Dirichlet Allocation Success Stories Wrap-up
Much of this material is adapted from Blei 2003. Many of the images were taken from the Internet February 20, 2014 Suppose we have a large number of books. Each is about several unknown topics. How can
Statistical Model for Soical Network
Statistical Model for Soical Network Tom A.B. Snijders University of Washington May 29, 2014 Outline 1 Cross-sectional network 2 Dynamic s Outline Cross-sectional network 1 Cross-sectional network 2 Dynamic
Period: Date: Lesson 3B: Properties of Dilations and Equations of lines
Name: Period: Date: : Properties of Dilations and Equations of lines Learning Targets I can identify the properties of dilation mentioned as followed: dilation takes a line not passing through the center
Topic Modelling and Latent Dirichlet Allocation
Topic Modelling and Latent Dirichlet Allocation Stephen Clark (with thanks to Mark Gales for some of the slides) Lent 2013 Machine Learning for Language Processing: Lecture 7 MPhil in Advanced Computer
Lecture 11: Unsupervised Machine Learning
CSE517A Machine Learning Spring 2018 Lecture 11: Unsupervised Machine Learning Instructor: Marion Neumann Scribe: Jingyu Xin Reading: fcml Ch6 (Intro), 6.2 (k-means), 6.3 (Mixture Models); [optional]:
Machine Learning for Data Science (CS4786) Lecture 12
Machine Learning for Data Science (CS4786) Lecture 12 Gaussian Mixture Models Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2016fa/ Back to K-means Single link is sensitive to outliners We
Lecture: Local Spectral Methods (1 of 4)
Stat260/CS294: Spectral Graph Methods Lecture 18-03/31/2015 Lecture: Local Spectral Methods (1 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide
Review and Motivation
Review and Motivation We can model and visualize multimodal datasets by using multiple unimodal (Gaussian-like) clusters. K-means gives us a way of partitioning points into N clusters. Once we know which
Stochastic blockmodeling of relational event dynamics
Christopher DuBois Carter T. Butts Padhraic Smyth Department of Statistics University of California, Irvine Department of Sociology Department of Statistics Institute for Mathematical and Behavioral Sciences
Lecture 6 (supplemental): Stochastic Block Models
3 Lecture 6 (supplemental): Stochastic Block Models Aaron Clauset @aaronclauset Assistant Professor of Computer Science University of Colorado Boulder External Faculty, Santa Fe Institute 2017 Aaron Clauset
Dynamic Infinite Relational Model for Time-varying Relational Data Analysis
Dynamic Infinite Relational Model for Time-varying Relational Data Analysis Katsuhiko Ishiguro Tomoharu Iwata Naonori Ueda NTT Communication Science Laboratories Kyoto, 619-0237 Japan {ishiguro,iwata,ueda}@cslab.kecl.ntt.co.jp
Bayesian decision making
Bayesian decision making Václav Hlaváč Czech Technical University in Prague Czech Institute of Informatics, Robotics and Cybernetics 166 36 Prague 6, Jugoslávských partyzánů 1580/3, Czech Republic http://people.ciirc.cvut.cz/hlavac,
Performance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project
Performance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project Devin Cornell & Sushruth Sastry May 2015 1 Abstract In this article, we explore
Stochastic calculus for summable processes 1
Stochastic calculus for summable processes 1 Lecture I Definition 1. Statistics is the science of collecting, organizing, summarizing and analyzing the information in order to draw conclusions. It is a
Comparing Means from Two-Sample
Comparing Means from Two-Sample Kwonsang Lee University of Pennsylvania kwonlee@wharton.upenn.edu April 3, 2015 Kwonsang Lee STAT111 April 3, 2015 1 / 22 Inference from One-Sample We have two options to
Lecture 3a: Dirichlet processes
Lecture 3a: Dirichlet processes Cédric Archambeau Centre for Computational Statistics and Machine Learning Department of Computer Science University College London c.archambeau@cs.ucl.ac.uk Advanced Topics
Non-Parametric Bayes
Non-Parametric Bayes Mark Schmidt UBC Machine Learning Reading Group January 2016 Current Hot Topics in Machine Learning Bayesian learning includes: Gaussian processes. Approximate inference. Bayesian
Unified Modeling of User Activities on Social Networking Sites
Unified Modeling of User Activities on Social Networking Sites Himabindu Lakkaraju IBM Research - India Manyata Embassy Business Park Bangalore, Karnataka - 5645 klakkara@in.ibm.com Angshu Rai IBM Research
Community Detection. fundamental limits & efficient algorithms. Laurent Massoulié, Inria
Community Detection fundamental limits & efficient algorithms Laurent Massoulié, Inria Community Detection From graph of node-to-node interactions, identify groups of similar nodes Example: Graph of US
Advanced Machine Learning
Advanced Machine Learning Nonparametric Bayesian Models --Learning/Reasoning in Open Possible Worlds Eric Xing Lecture 7, August 4, 2009 Reading: Eric Xing Eric Xing @ CMU, 2006-2009 Clustering Eric Xing
Probabilistic Graphical Models
School of Computer Science Probabilistic Graphical Models Infinite Feature Models: The Indian Buffet Process Eric Xing Lecture 21, April 2, 214 Acknowledgement: slides first drafted by Sinead Williamson
STAT 518 Intro Student Presentation
STAT 518 Intro Student Presentation Wen Wei Loh April 11, 2013 Title of paper Radford M. Neal [1999] Bayesian Statistics, 6: 475-501, 1999 What the paper is about Regression and Classification Flexible
arxiv: v1 [stat.me] 6 Nov 2014
![arxiv: v1 [stat.me] 6 Nov 2014](/thumbs/96/127044078.jpg "arxiv: v1 [stat.me] 6 Nov 2014")
Network Cross-Validation for Determining the Number of Communities in Network Data Kehui Chen 1 and Jing Lei arxiv:1411.1715v1 [stat.me] 6 Nov 014 1 Department of Statistics, University of Pittsburgh Department
Quilting Stochastic Kronecker Graphs to Generate Multiplicative Attribute Graphs
Quilting Stochastic Kronecker Graphs to Generate Multiplicative Attribute Graphs Hyokun Yun (work with S.V.N. Vishwanathan) Department of Statistics Purdue Machine Learning Seminar November 9, 2011 Overview
Introduction to statistical analysis of Social Networks
The Social Statistics Discipline Area, School of Social Sciences Introduction to statistical analysis of Social Networks Mitchell Centre for Network Analysis Johan Koskinen http://www.ccsr.ac.uk/staff/jk.htm!
Latent Dirichlet Allocation (LDA)
Latent Dirichlet Allocation (LDA) A review of topic modeling and customer interactions application 3/11/2015 1 Agenda Agenda Items 1 What is topic modeling? Intro Text Mining & Pre-Processing Natural Language
Overlapping Community Detection at Scale: A Nonnegative Matrix Factorization Approach
Overlapping Community Detection at Scale: A Nonnegative Matrix Factorization Approach Author: Jaewon Yang, Jure Leskovec 1 1 Venue: WSDM 2013 Presenter: Yupeng Gu 1 Stanford University 1 Background Community
Functions. Copyright Cengage Learning. All rights reserved.
Functions Copyright Cengage Learning. All rights reserved. 2.1 What is a Function? Copyright Cengage Learning. All rights reserved. Objectives Functions All Around Us Definition of Function Evaluating
Lecture 12: Link Analysis for Web Retrieval
Lecture 12: Link Analysis for Web Retrieval Trevor Cohn COMP90042, 2015, Semester 1 What we ll learn in this lecture The web as a graph Page-rank method for deriving the importance of pages Hubs and authorities
Journal of the American Statistical Association, Vol. 96, No (Sep., 2001), pp
Estimation and Prediction for Stochastic Blockstructures Krzysztof Nowicki; Tom A. B. Snijders Journal of the American Statistical Association, Vol. 96, No. 455. (Sep., 2001), pp. 1077-1087. Stable URL:
Machine Learning. Gaussian Mixture Models. Zhiyao Duan & Bryan Pardo, Machine Learning: EECS 349 Fall
Machine Learning Gaussian Mixture Models Zhiyao Duan & Bryan Pardo, Machine Learning: EECS 349 Fall 2012 1 The Generative Model POV We think of the data as being generated from some process. We assume
Variational Bayesian Dirichlet-Multinomial Allocation for Exponential Family Mixtures
17th Europ. Conf. on Machine Learning, Berlin, Germany, 2006. Variational Bayesian Dirichlet-Multinomial Allocation for Exponential Family Mixtures Shipeng Yu 1,2, Kai Yu 2, Volker Tresp 2, and Hans-Peter
STATS 306B: Unsupervised Learning Spring Lecture 2 April 2
STATS 306B: Unsupervised Learning Spring 2014 Lecture 2 April 2 Lecturer: Lester Mackey Scribe: Junyang Qian, Minzhe Wang 2.1 Recap In the last lecture, we formulated our working definition of unsupervised
Mixtures of Gaussians. Sargur Srihari
Mixtures of Gaussians Sargur srihari@cedar.buffalo.edu 1 9. Mixture Models and EM 0. Mixture Models Overview 1. K-Means Clustering 2. Mixtures of Gaussians 3. An Alternative View of EM 4. The EM Algorithm
An Infinite Product of Sparse Chinese Restaurant Processes
An Infinite Product of Sparse Chinese Restaurant Processes Yarin Gal Tomoharu Iwata Zoubin Ghahramani yg279@cam.ac.uk CRP quick recap The Chinese restaurant process (CRP) Distribution over partitions of
Machine Learning for Data Science (CS4786) Lecture 24
Machine Learning for Data Science (CS4786) Lecture 24 Graphical Models: Approximate Inference Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2016sp/ BELIEF PROPAGATION OR MESSAGE PASSING Each
The social sciences have investigated the structure of small
A nonparametric view of network models and Newman Girvan and other modularities Peter J. Bickel a,1 and Aiyou Chen b a University of California, Berkeley, CA 9472; and b Alcatel-Lucent Bell Labs, Murray
Applications of Convex Optimization on the Graph Isomorphism problem
Applications of Convex Optimization on the Graph Isomorphism problem 1 1 Department of Information and Computer Sciences UC Irvine March 8, 2011 Outline Motivation 1 Motivation The Graph Isomorphism problem
Mixed-membership Models (and an introduction to variational inference)
Mixed-membership Models (and an introduction to variational inference) David M. Blei Columbia University November 24, 2015 Introduction We studied mixture models in detail, models that partition data into
arxiv: v1 [math.st] 26 Jan 2018
![arxiv: v1 [math.st] 26 Jan 2018](/thumbs/83/88188538.jpg "arxiv: v1 [math.st] 26 Jan 2018")
CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION arxiv:1801.08724v1 [math.st] 26 Jan 2018 CAN M. LE, ELIZAVETA LEVINA AND ROMAN VERSHYNIN Abstract. Random matrix theory has played
Variational inference for the Stochastic Block-Model
Variational inference for the Stochastic Block-Model S. Robin AgroParisTech / INRA Workshop on Random Graphs, April 2011, Lille S. Robin (AgroParisTech / INRA) Variational inference for SBM Random Graphs,
Bayesian Hidden Markov Models and Extensions
Bayesian Hidden Markov Models and Extensions Zoubin Ghahramani Department of Engineering University of Cambridge joint work with Matt Beal, Jurgen van Gael, Yunus Saatci, Tom Stepleton, Yee Whye Teh Modeling
STA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Statistics! rsalakhu@utstat.toronto.edu! http://www.utstat.utoronto.ca/~rsalakhu/ Sidney Smith Hall, Room 6002 Lecture 11 Project
MAD-Bayes: MAP-based Asymptotic Derivations from Bayes
MAD-Bayes: MAP-based Asymptotic Derivations from Bayes Tamara Broderick Brian Kulis Michael I. Jordan Cat Clusters Mouse clusters Dog 1 Cat Clusters Dog Mouse Lizard Sheep Picture 1 Picture 2 Picture 3
Computer Vision Group Prof. Daniel Cremers. 6. Mixture Models and Expectation-Maximization
Prof. Daniel Cremers 6. Mixture Models and Expectation-Maximization Motivation Often the introduction of latent (unobserved) random variables into a model can help to express complex (marginal) distributions
RaRE: Social Rank Regulated Large-scale Network Embedding
RaRE: Social Rank Regulated Large-scale Network Embedding Authors: Yupeng Gu 1, Yizhou Sun 1, Yanen Li 2, Yang Yang 3 04/26/2018 The Web Conference, 2018 1 University of California, Los Angeles 2 Snapchat
Matrix estimation by Universal Singular Value Thresholding
Matrix estimation by Universal Singular Value Thresholding Courant Institute, NYU Let us begin with an example: Suppose that we have an undirected random graph G on n vertices. Model: There is a real symmetric
arxiv: v2 [stat.ml] 30 Dec 2015
![arxiv: v2 [stat.ml] 30 Dec 2015](/thumbs/89/98950054.jpg "arxiv: v2 [stat.ml] 30 Dec 2015")
Infinite Edge Partition Models for Overlapping Community Detection and Link Prediction Mingyuan Zhou McCombs School of Business, The University of Texas at Austin, Austin, TX 78712, USA arxiv:11.06218v2
Bayesian non parametric inference of discrete valued networks
Bayesian non parametric inference of discrete valued networks Laetitia Nouedoui, Pierre Latouche To cite this version: Laetitia Nouedoui, Pierre Latouche. Bayesian non parametric inference of discrete
Bayesian Nonparametrics: Dirichlet Process
Bayesian Nonparametrics: Dirichlet Process Yee Whye Teh Gatsby Computational Neuroscience Unit, UCL http://www.gatsby.ucl.ac.uk/~ywteh/teaching/npbayes2012 Dirichlet Process Cornerstone of modern Bayesian
Efficient Online Inference for Bayesian Nonparametric Relational Models
Efficient Online Inference for Bayesian Nonparametric Relational Models Dae Il Kim, Prem Gopalan 2, David M. Blei 2, and Erik B. Sudderth Department of Computer Science, Brown University, {daeil,sudderth}@cs.brown.edu
A Random Dot Product Model for Weighted Networks arxiv: v1 [stat.ap] 8 Nov 2016
![A Random Dot Product Model for Weighted Networks arxiv: v1 [stat.ap] 8 Nov 2016](/thumbs/79/79491591.jpg "A Random Dot Product Model for Weighted Networks arxiv: v1 [stat.ap] 8 Nov 2016")
A Random Dot Product Model for Weighted Networks arxiv:1611.02530v1 [stat.ap] 8 Nov 2016 Daryl R. DeFord 1 Daniel N. Rockmore 1,2,3 1 Department of Mathematics, Dartmouth College, Hanover, NH, USA 03755
Spectral thresholds in the bipartite stochastic block model
Spectral thresholds in the bipartite stochastic block model Laura Florescu and Will Perkins NYU and U of Birmingham September 27, 2016 Laura Florescu and Will Perkins Spectral thresholds in the bipartite
Machine Learning Summer School, Austin, TX January 08, 2015
Parametric Department of Information, Risk, and Operations Management Department of Statistics and Data Sciences The University of Texas at Austin Machine Learning Summer School, Austin, TX January 08,
Bayesian Networks. Machine Learning, Fall Slides based on material from the Russell and Norvig AI Book, Ch. 14
Bayesian Networks Machine Learning, Fall 2010 Slides based on material from the Russell and Norvig AI Book, Ch. 14 1 Administrativia Bayesian networks The inference problem: given a BN, how to make predictions
arxiv: v2 [cs.lg] 18 Jun 2018
![arxiv: v2 [cs.lg] 18 Jun 2018](/thumbs/96/127779734.jpg "arxiv: v2 [cs.lg] 18 Jun 2018")
Dynamic Network Model from Partial Observations Elahe Ghalebi TU Wien eghalebi@cps.tuwien.ac.at Baharan Mirzasoleiman Stanford University baharanm@cs.stanford.edu arxiv:1805.10616v2 [cs.lg] 18 Jun 2018
9/12/17. Types of learning. Modeling data. Supervised learning: Classification. Supervised learning: Regression. Unsupervised learning: Clustering
Types of learning Modeling data Supervised: we know input and targets Goal is to learn a model that, given input data, accurately predicts target data Unsupervised: we know the input only and want to make