Inference for loglinear models (contd):
|
|
- Archibald Kevin Harrington
- 6 years ago
- Views:
Transcription
1 Stat 504, Lecture 25 1 Inference for loglinear models (contd): Loglinear/Logit connection Intro to Graphical Models
2 Stat 504, Lecture 25 2 Loglinear Models no distinction between response and explanatory variables distribution = link = Logit Models models how binary response variable depends on a set of explanatory variables distribution = link = They are related in a sense that the loglinear models are more general than logit models, and some logit models are equivalent to certain loglinear models (e.g. consider the admissions data example and HW9). if you have a binary response variable in the loglinear model, you can construct the logits to help with the interpretation of the loglinear model. some logit models with only categorical variables have equivalent loglinear models
3 Stat 504, Lecture 25 3 A Key to using logit models to interpret loglinear models: the differences between Λ s equal log of odds, and functions of Λ s equal odds ratios. Let s consider the Blue collar worker data and the homogeneous model (MW, MS, SW): Loglinear model: and the probability of worker s job satisfaction: π ij = P (High worker satisfaction M = i, S = j Logit model: Constant: Effect of management quality: Effect of supervisor s job satisfaction:
4 Stat 504, Lecture 25 4
5 Stat 504, Lecture 25 5 Model Selection: Ref. Ch. 9 (Agresti), and more advanced topics on model selection with ordinal data are in Sec. 9.4 and 9.5. One response variable: The logit models can be fit directly and are simpler because they have fewer parameters than the equivalent loglinear model. If the response variable has more than two levels, you can use a polytomous logit model. If you use loglinear models, the highestway associations among the explanatory variables should be included in all models. Whether you use logit or loglinear formualations, the results will be the same regardless of which formulation you use. Two or more response variables: Use loglinear models because they are more general.
6 Stat 504, Lecture 25 6 Model selection strategies with Loglinear models Determine if some variables are responses and some explanatory. Include associations terms for the explanatory variables in the model. Focus your model search on models that relate the responses to explanatory variables. If a margin is fixed by design, included the appropriate term in the loglinear model (to ensure that the marginal fitted values from the model equal to observed margin). Try to determine the level of complexity that is neccessary by fitting models with marginal/main effects only all 2way associations all 3way associations, etc... all highestway associations. Backward elimination strategy (analogous to one discussed for logit models) or a stepwise procedure (be careful in using computer aglorithms; you are better off doing likelihood ratio tests, e.g. blue collar data, or a 4-way table handout from Fienberg on detergent use).
7 Stat 504, Lecture 25 7 Classes of nested models: loglinear models hierarchical loglinear models graphical loglinear models decomposable loglinear models conditional independence models
8 Stat 504, Lecture 25 8 More on model building/selection: Graphical Models Graphical models are useful and are widely applicable Graphs visually represent scientific content of models and thus facilitate communication. Graphs break down complex problems/models into smaller and simpler pieces that can be studied separately. Graphs are natural data structures for programming History: Statistical Physics (Gibbs, 1902) Genetics and Path analysis (Wright, 1921,1923, 1934) Contingency tables (Barlett(1935))
9 Stat 504, Lecture 25 9 References: Cowell, R.G., Dawid, A.P., Lauritzen, S.L, and Spiegelhalter, D.J. (1999) Probabilistic Networks and Expert Systems. NY: Springer-Verlag. Darroch, J.N., Lauritzen, S.L., and Speed, T.P. (1980). Markov fields and log-linear models for contingency tables. Annals of Statistics, 8, Edwards, D. (2000). Introductions to Graphical Modeling,2nd edition. NY: SpringerVerlag. (includes MIM software). Lauritzen, S.L. (1996). Graphical Models. NY: Oxford Science Publications. Whittaker, J. (1990). Graphical Models in Applied Multivariate Statistics. Chichester: Wiley.
10 Stat 504, Lecture Some on-line references: Murphy, K. (1998) A brief introduction to graphical models and Bayesian networks. murphyk/bayes/bayes.html Graphical models in R: MIM, a graphical modeling software:
11 Stat 504, Lecture Graphical Models and Contingency Tables Determine when marginal and partial associations are the same such that we can collapse a multi-way table into a smaller table (or tables) to study certain associations. Represent substantive theories and hypotheses, which correspond to certain loglinear/logit models. Two basci types of graphs: undirected graphical models directed graphical models (or Bayesian Networks). Other: chain graphs, ancestral graphs, etc...
12 Stat 504, Lecture Example 1: The Blue Collar Worker Data Example 2: The Ries-Smith Detergent Study (Fienberg, 1980) Example 3: The Czech autoworkers data come from a prospective epidemiological study of 1841 Czech car factory workers (Edwards and Havranek (1985)). The table cross-classifies the autoworkers for progonostic factors in coronary heart disease. The labels for variables are A for whether or not the worker smokes, B indicates strenuous mental work, C corresponds to strenuous physical work, D stands for systolic pressure, E corresponds to ratio of β and α lipoproteins, and F represents family anamnesis of coronary heart disease.
13 Stat 504, Lecture B no yes F E D C A no yes no yes neg < 3 < 140 no yes no yes < 140 no yes no yes pos < 3 < 140 no yes no yes < 140 no yes no yes Table 1: Prognostic factors in coronary heart disease. Source: Edwards and Havranek (1985).
14 Stat 504, Lecture Some terminology and definitions (common to all graphical models): Vertices V (or nodes) are points that represent variables. Edges, E, are lines that connect two vertices. Graph, G = {V, E}, consists of a finite set of vertices V and edges, E. The presence of an edge between two vertices indicates that an association may exist between the two variables. The absence of an edge between two vertices indicates that the two variables are independent.
15 Stat 504, Lecture Undirected graph (no arrows, undirected relationships Directed graph (with arrows, implying causal relationship
16 Stat 504, Lecture Adjacent vertices: directly connected by an edge Path: a sequence of distinct edges that take you from one variable to another Separted: two variables are separated if all paths between them are intersected by another variable (or a set of variables) Complete: there is an edge between every pair of vertices Clique: a subset of vertices that s maximally complete Boundary: of a variable (vertex) are all vertices in a set K, but not the variable of interest, adjacent to the vertex of interest.
17 Stat 504, Lecture Example:
18 Stat 504, Lecture Independence Graphs: Key result: Two variables are conditionally independent given any subset of variables that separates them. Def: An independence graph is (conditional) independence graph if there is no edge between two vertices whenever variables they represent are conditionally independent given all the remaining variables. This definition links partial associations to absence of an edge. Note: 1) If all r.v. s are categorical, then all graphical models for those are loglinear models (but not vice versa) 2) Different loglinear models may have the same graphical representation
19 Stat 504, Lecture Examples:
20 Stat 504, Lecture Link between loglinear models and graphs is the partial association model for k variables: two-way terms set to zero e.g. A indep. of B given ALL the other variables is equiv. to NO edge between A and B in the corresponding graph Markov properties Pairwise Markov property : Setting two-way association terms to zero specifies pairwise Markov relationship in the graph Global Markov property: Local Markov property: Equivalence Theorem: describes equivalence between different Markov properties.
21 Stat 504, Lecture Partial Association Model in 4-dim (Example 2 (detergent study) from Fienberg) Let S=1, U=2, T=3, P=4 Suppose we analyze the data without a regard for the response, but with the loglinear model. There are 6 PA models for setting 6 first order interaction terms equal to zero: There is only one significant two-way term We also eliminated higher way order terms!
22 Stat 504, Lecture A graphical approach to model selection: Fit all partial association models and compute p-values (i.e. unconditional edge exclusion test) drop non-significant edges from the graph, and form a resulting independence graph check for the inclusion of edges, one at the time, using conditional tests and add back significant edges (i.e. conditional edge inclusion test) check for exclusion of edges
23 Stat 504, Lecture For our 4-way example, begin with the model that only includes edge between U and P because u 24 = λ UP jk = 0. Test of inclusion of other edges: So now we add edges (1,3) and (3,4). Now we have a decomposable graph and we don t gain much by dropping an edge. Now again, we can check for inclusion of edge (2,3), by checking for inclusion of two terms,u 23 andu 234. We get G 2 = 0.7, df = 1 and G 2 = 3.5, df = 2. This is not significant. But if we use AIC = G 2 df = > 0 says include the edge in the model!
24 Stat 504, Lecture Now use BIC = G 2 df log(n) = 7.24 < 0 says do NOT include the edge. The global search using BIC yields the best model [1][3][24] if you want the logit version of the model where the preference is the response and first three variables explanatory then you need to include those in the model, e.g. [123][34][24], G 2 = 8.4., df = 9. Do the conditional test for [34]: G 2 = 3.8, df = 1, p value =
25 Stat 504, Lecture Example 3: Begin by all PA-models and computing G 2 for exclusion of edges: Each G 2 has df=16, so a critical chi-square value for p-value=0.05 is If we drop the edges we get the following graph: G 2 = 83.75, df = 51, p value = , thus we deleted too many edges!
26 Stat 504, Lecture There is about 32,768 decomposable models! How about model: [bf][bc][ace][ade] where graph is triangulated and decomposable. But the model doesn t fit too well either.
27 Stat 504, Lecture But if we do stepwise model selection in MIM, for example we get this as the best graphical model which is not decomposable: G 2 = 58.28, df = 49, p value = 0.17
36-720: Graphical Models
36-720: Graphical Models Brian Junker September 17, 2007 Undirected Graphs and Conditional Independence Generators and Graphs Graphical Models Log-Linear Graphical Models Example Decomposabe Models 1 36-720
More informationFMA901F: Machine Learning Lecture 6: Graphical Models. Cristian Sminchisescu
FMA901F: Machine Learning Lecture 6: Graphical Models Cristian Sminchisescu Graphical Models Provide a simple way to visualize the structure of a probabilistic model and can be used to design and motivate
More informationLecture 13: May 10, 2002
EE96 Pat. Recog. II: Introduction to Graphical Models University of Washington Spring 00 Dept. of Electrical Engineering Lecture : May 0, 00 Lecturer: Jeff Bilmes Scribe: Arindam Mandal, David Palmer(000).
More informationStat 5421 Lecture Notes Graphical Models Charles J. Geyer April 27, Introduction. 2 Undirected Graphs
Stat 5421 Lecture Notes Graphical Models Charles J. Geyer April 27, 2016 1 Introduction Graphical models come in many kinds. There are graphical models where all the variables are categorical (Lauritzen,
More informationProbabilistic Graphical Models
Overview of Part One Probabilistic Graphical Models Part One: Graphs and Markov Properties Christopher M. Bishop Graphs and probabilities Directed graphs Markov properties Undirected graphs Examples Microsoft
More informationDecomposition of log-linear models
Graphical Models, Lecture 5, Michaelmas Term 2009 October 27, 2009 Generating class Dependence graph of log-linear model Conformal graphical models Factor graphs A density f factorizes w.r.t. A if there
More informationComputer vision: models, learning and inference. Chapter 10 Graphical Models
Computer vision: models, learning and inference Chapter 10 Graphical Models Independence Two variables x 1 and x 2 are independent if their joint probability distribution factorizes as Pr(x 1, x 2 )=Pr(x
More information3 : Representation of Undirected GMs
0-708: Probabilistic Graphical Models 0-708, Spring 202 3 : Representation of Undirected GMs Lecturer: Eric P. Xing Scribes: Nicole Rafidi, Kirstin Early Last Time In the last lecture, we discussed directed
More informationResearch Article Structural Learning about Directed Acyclic Graphs from Multiple Databases
Abstract and Applied Analysis Volume 2012, Article ID 579543, 9 pages doi:10.1155/2012/579543 Research Article Structural Learning about Directed Acyclic Graphs from Multiple Databases Qiang Zhao School
More informationGraphical Models. David M. Blei Columbia University. September 17, 2014
Graphical Models David M. Blei Columbia University September 17, 2014 These lecture notes follow the ideas in Chapter 2 of An Introduction to Probabilistic Graphical Models by Michael Jordan. In addition,
More informationProbabilistic Graphical Models
Overview of Part Two Probabilistic Graphical Models Part Two: Inference and Learning Christopher M. Bishop Exact inference and the junction tree MCMC Variational methods and EM Example General variational
More informationThe Basics of Graphical Models
The Basics of Graphical Models David M. Blei Columbia University September 30, 2016 1 Introduction (These notes follow Chapter 2 of An Introduction to Probabilistic Graphical Models by Michael Jordan.
More informationGraph Theory. Probabilistic Graphical Models. L. Enrique Sucar, INAOE. Definitions. Types of Graphs. Trajectories and Circuits.
Theory Probabilistic ical Models L. Enrique Sucar, INAOE and (INAOE) 1 / 32 Outline and 1 2 3 4 5 6 7 8 and 9 (INAOE) 2 / 32 A graph provides a compact way to represent binary relations between a set of
More informationComputer Vision Group Prof. Daniel Cremers. 4. Probabilistic Graphical Models Directed Models
Prof. Daniel Cremers 4. Probabilistic Graphical Models Directed Models The Bayes Filter (Rep.) (Bayes) (Markov) (Tot. prob.) (Markov) (Markov) 2 Graphical Representation (Rep.) We can describe the overall
More informationJunction Trees and Chordal Graphs
Graphical Models, Lecture 6, Michaelmas Term 2011 October 24, 2011 Decomposability Factorization of Markov distributions Explicit formula for MLE Consider an undirected graph G = (V, E). A partitioning
More informationarxiv:cmp-lg/ v1 12 Feb 1997
arxiv:cmp-lg/9702008v1 12 Feb 1997 Appears in the Proceedings of the 5th Conference on Applied Natural Language Processing (ANLP-97), April 1997, Washington, DC Sequential Model Selection for Word Sense
More informationComputer Vision Group Prof. Daniel Cremers. 4. Probabilistic Graphical Models Directed Models
Prof. Daniel Cremers 4. Probabilistic Graphical Models Directed Models The Bayes Filter (Rep.) (Bayes) (Markov) (Tot. prob.) (Markov) (Markov) 2 Graphical Representation (Rep.) We can describe the overall
More informationLecture 5: Exact inference. Queries. Complexity of inference. Queries (continued) Bayesian networks can answer questions about the underlying
given that Maximum a posteriori (MAP query: given evidence 2 which has the highest probability: instantiation of all other variables in the network,, Most probable evidence (MPE: given evidence, find an
More informationSTA 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 5 Inference
More informationD-Separation. b) the arrows meet head-to-head at the node, and neither the node, nor any of its descendants, are in the set C.
D-Separation Say: A, B, and C are non-intersecting subsets of nodes in a directed graph. A path from A to B is blocked by C if it contains a node such that either a) the arrows on the path meet either
More informationThe grbase Package. August 13, Author Søren Højsgaard Claus Dethlefsen
The grbase Package August 13, 2005 Version 0.1.23 Date 2005-08-12 Title grbase - a package for graphical modelling in R Author Søren Højsgaard , Claus Dethlefsen
More informationGraphical models are a lot like a circuit diagram they are written down to visualize and better understand a problem.
Machine Learning (ML, F16) Lecture#15 (Tuesday, Nov. 1st) Lecturer: Byron Boots Graphical Models 1 Graphical Models Often, one is interested in representing a joint distribution P over a set of n random
More informationLecture 4: Undirected Graphical Models
Lecture 4: Undirected Graphical Models Department of Biostatistics University of Michigan zhenkewu@umich.edu http://zhenkewu.com/teaching/graphical_model 15 September, 2016 Zhenke Wu BIOSTAT830 Graphical
More information2. Graphical Models. Undirected graphical models. Factor graphs. Bayesian networks. Conversion between graphical models. Graphical Models 2-1
Graphical Models 2-1 2. Graphical Models Undirected graphical models Factor graphs Bayesian networks Conversion between graphical models Graphical Models 2-2 Graphical models There are three families of
More informationLecture 5: Exact inference
Lecture 5: Exact inference Queries Inference in chains Variable elimination Without evidence With evidence Complexity of variable elimination which has the highest probability: instantiation of all other
More informationMarkov bases for decomposable graphical models
Bernoulli 9(6), 23, 193 118 ISSN 135265 c 23 ISI/BS Markov bases for decomposable graphical models ADRIAN DOBRA Institute of Statistics Decision Sciences Department of Molecular Genetics & Microbiology,
More informationHandbook of Statistical Modeling for the Social and Behavioral Sciences
Handbook of Statistical Modeling for the Social and Behavioral Sciences Edited by Gerhard Arminger Bergische Universität Wuppertal Wuppertal, Germany Clifford С. Clogg Late of Pennsylvania State University
More informationLog-linear Models of Contingency Tables: Multidimensional Tables
CSSS/SOC/STAT 536: Logistic Regression and Log-linear Models Log-linear Models of Contingency Tables: Multidimensional Tables Christopher Adolph University of Washington, Seattle March 10, 2005 Assistant
More informationThe grbase Package. October 25, 2007
The grbase Package October 25, 2007 Version 0.2.1 Title A package for graphical modelling in R Author Søren Højsgaard , Claus Dethlefsen Maintainer Claus Dethlefsen
More informationUndirected Graphical Models. Raul Queiroz Feitosa
Undirected Graphical Models Raul Queiroz Feitosa Pros and Cons Advantages of UGMs over DGMs UGMs are more natural for some domains (e.g. context-dependent entities) Discriminative UGMs (CRF) are better
More informationOn some subclasses of circular-arc graphs
On some subclasses of circular-arc graphs Guillermo Durán - Min Chih Lin Departamento de Computación Facultad de Ciencias Exactas y Naturales Universidad de Buenos Aires e-mail: {willy,oscarlin}@dc.uba.ar
More informationJunction Trees and Chordal Graphs
Graphical Models, Lecture 6, Michaelmas Term 2009 October 30, 2009 Decomposability Factorization of Markov distributions Explicit formula for MLE Consider an undirected graph G = (V, E). A partitioning
More informationSTATISTICS (STAT) Statistics (STAT) 1
Statistics (STAT) 1 STATISTICS (STAT) STAT 2013 Elementary Statistics (A) Prerequisites: MATH 1483 or MATH 1513, each with a grade of "C" or better; or an acceptable placement score (see placement.okstate.edu).
More informationStructure Estimation in Graphical Models
Wald Lecture, World Meeting on Probability and Statistics Istanbul 2012 Structure estimation Some examples General points Advances in computing has set focus on estimation of structure: Model selection
More informationGraphical Modeling for High Dimensional Data
Journal of Modern Applied Statistical Methods Volume 11 Issue 2 Article 17 11-1-2012 Graphical Modeling for High Dimensional Data Munni Begum Ball State University, Muncie, IN Jay Bagga Ball State University,
More informationForensic Statistics and Graphical Models (2) Richard Gill Spring Semester
Forensic Statistics and Graphical Models (2) Richard Gill Spring Semester 2015 http://www.math.leidenuniv.nl/~gill/teaching/graphical Graph Theory An undirected graph consists of a set of vertices and
More informationmimr A package for graphical modelling in R
DSC 2003 Working Papers (Draft Versions) http://www.ci.tuwien.ac.at/conferences/dsc-2003/ mimr A package for graphical modelling in R Søren Højsgaard Abstract The mimr package for graphical modelling in
More informationLecture 11: May 1, 2000
/ EE596 Pat. Recog. II: Introduction to Graphical Models Spring 2000 Lecturer: Jeff Bilmes Lecture 11: May 1, 2000 University of Washington Dept. of Electrical Engineering Scribe: David Palmer 11.1 Graph
More information2. Graphical Models. Undirected pairwise graphical models. Factor graphs. Bayesian networks. Conversion between graphical models. Graphical Models 2-1
Graphical Models 2-1 2. Graphical Models Undirected pairwise graphical models Factor graphs Bayesian networks Conversion between graphical models Graphical Models 2-2 Graphical models Families of graphical
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Raquel Urtasun and Tamir Hazan TTI Chicago April 25, 2011 Raquel Urtasun and Tamir Hazan (TTI-C) Graphical Models April 25, 2011 1 / 17 Clique Trees Today we are going to
More informationHierarchical Generalized Linear Models
Generalized Multilevel Linear Models Introduction to Multilevel Models Workshop University of Georgia: Institute for Interdisciplinary Research in Education and Human Development 07 Generalized Multilevel
More informationImproving Markov Chain Monte Carlo Model Search for Data Mining
Machine Learning, 50, 127 158, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Improving Markov hain Monte arlo Model Search for ata Mining PAOLO GIUII giudici@unipv.it epartment
More informationGENERATING JUNCTION TREES OF DECOMPOSABLE GRAPHS WITH THE CHRISTMAS TREE ALGORITHM
GENERATING JUNCTION TREES OF DECOMPOSABLE GRAPHS WITH THE CHRISTMAS TREE ALGORITHM JIMMY OLSSON, TATJANA PAVLENKO, FELIX L. RIOS Abstract. The junction tree representation provides an attractive structural
More informationSocial science application of graphical models on mobility data
Social science application of graphical models on mobility data Summary of the PhD dissertation of Renáta Németh Supervisor: Tamás Rudas, DSc Department of Statistics Doctoral Program in Sociology Eötvös
More informationCHAPTER 1 INTRODUCTION
Introduction CHAPTER 1 INTRODUCTION Mplus is a statistical modeling program that provides researchers with a flexible tool to analyze their data. Mplus offers researchers a wide choice of models, estimators,
More information2 Review of Set Theory
2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply
More informationOn the usage of the grim package
On the usage of the grim package Søren Højsgaard grim version 0.2-0 as of 2017-03-31 Contents 1 Introduction 2 2 Introductory examples 2 2.1 A Discrete Model................................ 2 2.2 Model
More informationEnumerating the decomposable neighbours of a decomposable graph under a simple perturbation scheme
Enumerating the decomposable neighbours of a decomposable graph under a simple perturbation scheme Alun Thomas Department of Biomedical Informatics University of Utah Peter J Green Department of Mathematics
More informationCS242: Probabilistic Graphical Models Lecture 2B: Loopy Belief Propagation & Junction Trees
CS242: Probabilistic Graphical Models Lecture 2B: Loopy Belief Propagation & Junction Trees Professor Erik Sudderth Brown University Computer Science September 22, 2016 Some figures and materials courtesy
More informationApplied Multivariate Analysis
Department of Mathematics and Statistics, University of Vaasa, Finland Spring 2017 Choosing Statistical Method 1 Choice an appropriate method 2 Cross-tabulation More advance analysis of frequency tables
More informationModel selection. Peter Hoff. 560 Hierarchical modeling. Statistics, University of Washington 1/41
1/41 Model selection 560 Hierarchical modeling Peter Hoff Statistics, University of Washington /41 Modeling choices Model: A statistical model is a set of probability distributions for your data. In HLM,
More informationVariational Methods for Graphical Models
Chapter 2 Variational Methods for Graphical Models 2.1 Introduction The problem of probabb1istic inference in graphical models is the problem of computing a conditional probability distribution over the
More informationStatistical Techniques in Robotics (STR, S15) Lecture#06 (Wednesday, January 28)
Statistical Techniques in Robotics (STR, S15) Lecture#06 (Wednesday, January 28) Lecturer: Byron Boots Graphical Models 1 Graphical Models Often one is interested in representing a joint distribution P
More informationMachine Learning!!!!! Srihari. Chain Graph Models. Sargur Srihari
Chain Graph Models Sargur Srihari srihari@cedar.buffalo.edu 1 Topics PDAGs or Chain Graphs Generalization of CRF to Chain Graphs Independencies in Chain Graphs Summary BN versus MN 2 Partially Directed
More informationA Particular Type of Non-associative Algebras and Graph Theory
A Particular Type of Non-associative Algebras and Graph Theory JUAN NÚÑEZ, MARITHANIA SILVERO & M. TRINIDAD VILLAR University of Seville Department of Geometry and Topology Aptdo. 1160. 41080-Seville SPAIN
More informationSparse Nested Markov Models with Log-linear Parameters
Sparse Nested Markov Models with Log-linear Parameters Ilya Shpitser Mathematical Sciences University of Southampton i.shpitser@soton.ac.uk Robin J. Evans Statistical Laboratory Cambridge University rje42@cam.ac.uk
More informationStrategies for Modeling Two Categorical Variables with Multiple Category Choices
003 Joint Statistical Meetings - Section on Survey Research Methods Strategies for Modeling Two Categorical Variables with Multiple Category Choices Christopher R. Bilder Department of Statistics, University
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationDraft: More complex graph computations for undirected graphical models by the CoCo bundle for R
DSC 2003 Working Papers (Draft Versions) http://www.ci.tuwien.ac.at/conferences/dsc-2003/ Draft: More complex graph computations for undirected graphical models by the CoCo bundle for R Jens Henrik Badsberg
More informationLecture 13: Model selection and regularization
Lecture 13: Model selection and regularization Reading: Sections 6.1-6.2.1 STATS 202: Data mining and analysis October 23, 2017 1 / 17 What do we know so far In linear regression, adding predictors always
More informationGraphical Models Reconstruction
Graphical Models Reconstruction Graph Theory Course Project Firoozeh Sepehr April 27 th 2016 Firoozeh Sepehr Graphical Models Reconstruction 1/50 Outline 1 Overview 2 History and Background 3 Graphical
More informationSTA 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 12 Combining
More informationGraphical models and message-passing algorithms: Some introductory lectures
Graphical models and message-passing algorithms: Some introductory lectures Martin J. Wainwright 1 Introduction Graphical models provide a framework for describing statistical dependencies in (possibly
More informationMachine Learning. Sourangshu Bhattacharya
Machine Learning Sourangshu Bhattacharya Bayesian Networks Directed Acyclic Graph (DAG) Bayesian Networks General Factorization Curve Fitting Re-visited Maximum Likelihood Determine by minimizing sum-of-squares
More informationEdge-exchangeable graphs and sparsity
Edge-exchangeable graphs and sparsity Tamara Broderick Department of EECS Massachusetts Institute of Technology tbroderick@csail.mit.edu Diana Cai Department of Statistics University of Chicago dcai@uchicago.edu
More informationCS242: Probabilistic Graphical Models Lecture 3: Factor Graphs & Variable Elimination
CS242: Probabilistic Graphical Models Lecture 3: Factor Graphs & Variable Elimination Instructor: Erik Sudderth Brown University Computer Science September 11, 2014 Some figures and materials courtesy
More informationLecture 9: Undirected Graphical Models Machine Learning
Lecture 9: Undirected Graphical Models Machine Learning Andrew Rosenberg March 5, 2010 1/1 Today Graphical Models Probabilities in Undirected Graphs 2/1 Undirected Graphs What if we allow undirected graphs?
More informationIntroduction to information theory and coding - Lecture 1 on Graphical models
Introduction to information theory and coding - Lecture 1 on Graphical models Louis Wehenkel Department of Electrical Engineering and Computer Science University of Liège Montefiore - Liège - October,
More informationECE521 W17 Tutorial 10
ECE521 W17 Tutorial 10 Shenlong Wang and Renjie Liao *Some of materials are credited to Jimmy Ba, Eric Sudderth, Chris Bishop Introduction to A4 1, Graphical Models 2, Message Passing 3, HMM Introduction
More informationMatchings in Graphs. Definition 1 Let G = (V, E) be a graph. M E is called as a matching of G if v V we have {e M : v is incident on e E} 1.
Lecturer: Scribe: Meena Mahajan Rajesh Chitnis Matchings in Graphs Meeting: 1 6th Jan 010 Most of the material in this lecture is taken from the book Fast Parallel Algorithms for Graph Matching Problems
More informationMixture Models and the EM Algorithm
Mixture Models and the EM Algorithm Padhraic Smyth, Department of Computer Science University of California, Irvine c 2017 1 Finite Mixture Models Say we have a data set D = {x 1,..., x N } where x i is
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Lecture 17 EM CS/CNS/EE 155 Andreas Krause Announcements Project poster session on Thursday Dec 3, 4-6pm in Annenberg 2 nd floor atrium! Easels, poster boards and cookies
More informationMore details on Loopy BP
Readings: K&F: 11.3, 11.5 Yedidia et al. paper from the class website Chapter 9 - Jordan Loopy Belief Propagation Generalized Belief Propagation Unifying Variational and GBP Learning Parameters of MNs
More informationHierarchical Mixture Models for Nested Data Structures
Hierarchical Mixture Models for Nested Data Structures Jeroen K. Vermunt 1 and Jay Magidson 2 1 Department of Methodology and Statistics, Tilburg University, PO Box 90153, 5000 LE Tilburg, Netherlands
More informationChapter 2 PRELIMINARIES. 1. Random variables and conditional independence
Chapter 2 PRELIMINARIES In this chapter the notation is presented and the basic concepts related to the Bayesian network formalism are treated. Towards the end of the chapter, we introduce the Bayesian
More informationLecture 3: Conditional Independence - Undirected
CS598: Graphical Models, Fall 2016 Lecture 3: Conditional Independence - Undirected Lecturer: Sanmi Koyejo Scribe: Nate Bowman and Erin Carrier, Aug. 30, 2016 1 Review for the Bayes-Ball Algorithm Recall
More informationSmall Survey on Perfect Graphs
Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families
More informationCOMP90051 Statistical Machine Learning
COMP90051 Statistical Machine Learning Semester 2, 2016 Lecturer: Trevor Cohn 21. Independence in PGMs; Example PGMs Independence PGMs encode assumption of statistical independence between variables. Critical
More information11.4 Bipartite Multigraphs
11.4 Bipartite Multigraphs Introduction Definition A graph G is bipartite if we can partition the vertices into two disjoint subsets U and V such that every edge of G has one incident vertex in U and the
More information15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018
15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming
More informationK-structure, Separating Chain, Gap Tree, and Layered DAG
K-structure, Separating Chain, Gap Tree, and Layered DAG Presented by Dave Tahmoush Overview Improvement on Gap Tree and K-structure Faster point location Encompasses Separating Chain Better storage Designed
More informationRegression. Dr. G. Bharadwaja Kumar VIT Chennai
Regression Dr. G. Bharadwaja Kumar VIT Chennai Introduction Statistical models normally specify how one set of variables, called dependent variables, functionally depend on another set of variables, called
More informationMarkov Random Fields and Gibbs Sampling for Image Denoising
Markov Random Fields and Gibbs Sampling for Image Denoising Chang Yue Electrical Engineering Stanford University changyue@stanfoed.edu Abstract This project applies Gibbs Sampling based on different Markov
More informationThe External Network Problem
The External Network Problem Jan van den Heuvel and Matthew Johnson CDAM Research Report LSE-CDAM-2004-15 December 2004 Abstract The connectivity of a communications network can often be enhanced if the
More informationA New Approach For Convert Multiply-Connected Trees in Bayesian networks
A New Approach For Convert Multiply-Connected Trees in Bayesian networks 1 Hussein Baloochian, Alireza khantimoory, 2 Saeed Balochian 1 Islamic Azad university branch of zanjan 2 Islamic Azad university
More informationDeep Boltzmann Machines
Deep Boltzmann Machines Sargur N. Srihari srihari@cedar.buffalo.edu Topics 1. Boltzmann machines 2. Restricted Boltzmann machines 3. Deep Belief Networks 4. Deep Boltzmann machines 5. Boltzmann machines
More informationEstimation of Item Response Models
Estimation of Item Response Models Lecture #5 ICPSR Item Response Theory Workshop Lecture #5: 1of 39 The Big Picture of Estimation ESTIMATOR = Maximum Likelihood; Mplus Any questions? answers Lecture #5:
More informationExam Advanced Data Mining Date: Time:
Exam Advanced Data Mining Date: 11-11-2010 Time: 13.30-16.30 General Remarks 1. You are allowed to consult 1 A4 sheet with notes written on both sides. 2. Always show how you arrived at the result of your
More informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More informationCSE 158. Web Mining and Recommender Systems. Midterm recap
CSE 158 Web Mining and Recommender Systems Midterm recap Midterm on Wednesday! 5:10 pm 6:10 pm Closed book but I ll provide a similar level of basic info as in the last page of previous midterms CSE 158
More informationDynamic Thresholding for Image Analysis
Dynamic Thresholding for Image Analysis Statistical Consulting Report for Edward Chan Clean Energy Research Center University of British Columbia by Libo Lu Department of Statistics University of British
More informationLecture 1: Examples, connectedness, paths and cycles
Lecture 1: Examples, connectedness, paths and cycles Anders Johansson 2011-10-22 lör Outline The course plan Examples and applications of graphs Relations The definition of graphs as relations Connectedness,
More informationThe Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs
The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs G. Ayorkor Mills-Tettey Anthony Stentz M. Bernardine Dias CMU-RI-TR-07-7 July 007 Robotics Institute Carnegie Mellon University
More informationMulti-label classification using rule-based classifier systems
Multi-label classification using rule-based classifier systems Shabnam Nazmi (PhD candidate) Department of electrical and computer engineering North Carolina A&T state university Advisor: Dr. A. Homaifar
More informationMachine Learning (BSMC-GA 4439) Wenke Liu
Machine Learning (BSMC-GA 4439) Wenke Liu 01-31-017 Outline Background Defining proximity Clustering methods Determining number of clusters Comparing two solutions Cluster analysis as unsupervised Learning
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression
More informationECE521: Week 11, Lecture March 2017: HMM learning/inference. With thanks to Russ Salakhutdinov
ECE521: Week 11, Lecture 20 27 March 2017: HMM learning/inference With thanks to Russ Salakhutdinov Examples of other perspectives Murphy 17.4 End of Russell & Norvig 15.2 (Artificial Intelligence: A Modern
More informationProblem Set 7 Solutions
6.42/8.62J Mathematics for Computer Science March 29, 25 Srini Devadas and Eric Lehman Problem Set 7 Solutions Due: Monday, April 4 at 9 PM Problem. Every function has some subset of these properties:
More informationDirected Graphical Models
Copyright c 2008 2010 John Lafferty, Han Liu, and Larry Wasserman Do Not Distribute Chapter 18 Directed Graphical Models Graphs give a powerful way of representing independence relations and computing
More informationMultiple-imputation analysis using Stata s mi command
Multiple-imputation analysis using Stata s mi command Yulia Marchenko Senior Statistician StataCorp LP 2009 UK Stata Users Group Meeting Yulia Marchenko (StataCorp) Multiple-imputation analysis using mi
More information