Meila, Marina

49 publications

ICML 2025 The Noisy Laplacian: A Threshold Phenomenon for Non-Linear Dimension Reduction Alex Kokot, Octavian-Vlad Murad, Marina Meila
AISTATS 2024 Consistency of Dictionary-Based Manifold Learning Samson J. Koelle, Hanyu Zhang, Octavian-Vlad Murad, Marina Meila
NeurIPSW 2024 Isometry Pursuit Samson J Koelle, Marina Meila
JMLR 2022 Manifold Coordinates with Physical Meaning Samson J. Koelle, Hanyu Zhang, Marina Meila, Yu-Chia Chen
ICMLW 2021 Tangent Space Least Adaptive Clustering James Buenfil, Samson J Koelle, Marina Meila
NeurIPS 2021 The Decomposition of the Higher-Order Homology Embedding Constructed from the $k$-Laplacian Yu-Chia Chen, Marina Meila
NeurIPS 2019 Selecting the Independent Coordinates of Manifolds with Large Aspect Ratios Yu-Chia Chen, Marina Meila
NeurIPS 2018 How to Tell When a Clustering Is (approximately) Correct Using Convex Relaxations Marina Meila
NeurIPS 2017 Improved Graph Laplacian via Geometric Self-Consistency Dominique Joncas, Marina Meila, James McQueen
NeurIPS 2016 Graph Clustering: Block-Models and Model Free Results Yali Wan, Marina Meila
MLOSS 2016 Megaman: Scalable Manifold Learning in Python James McQueen, Marina Meilă, Jacob VanderPlas, Zhongyue Zhang
NeurIPS 2016 Nearly Isometric Embedding by Relaxation James McQueen, Marina Meila, Dominique Joncas
NeurIPS 2015 A Class of Network Models Recoverable by Spectral Clustering Yali Wan, Marina Meila
UAI 2015 Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI 2015, July 12-16, 2015, Amsterdam, the Netherlands Marina Meila, Tom Heskes
NeurIPS 2014 Recursive Inversion Models for Permutations Christopher Meek, Marina Meila
AISTATS 2013 Consensus Ranking with Signed Permutations Raman Arora, Marina Meila
MLJ 2012 Local Equivalences of Distances Between Clusterings - A Geometric Perspective Marina Meila
NeurIPS 2011 Directed Graph Embedding: An Algorithm Based on Continuous Limits of Laplacian-Type Operators Dominique C. Perrault-joncas, Marina Meila
JMLR 2010 An Exponential Model for Infinite Rankings Marina Meilă, Le Bao
UAI 2010 Dirichlet Process Mixtures of Generalized Mallows Models Marina Meila, Harr Chen
AISTATS 2010 Learning Bayesian Network Structure Using LP Relaxations Tommi Jaakkola, David Sontag, Amir Globerson, Marina Meila
AISTATS 2009 Tractable Search for Learning Exponential Models of Rankings Bhushan Mandhani, Marina Meila
UAI 2008 Estimation and Clustering with Infinite Rankings Marina Meila, Le Bao
UAI 2007 Consensus Ranking Under the Exponential Model Marina Meila, Kapil Phadnis, Arthur Patterson, Jeff A. Bilmes
AISTATS 2007 Preface Marina Meila, Xiaotong Shen
ICML 2006 The Uniqueness of a Good Optimum for K-Means Marina Meila
ICML 2005 Comparing Clusterings: An Axiomatic View Marina Meila
AISTATS 2005 Regularized Spectral Learning Marina Meilă, Susan Shortreed, Liang Xu
AAAI 2005 Spectral Clustering of Biological Sequence Data William Pentney, Marina Meila
UAI 2005 Unsupervised Spectral Learning Susan M. Shortreed, Marina Meila
ICCV 2003 A New Paradigm for Recognizing 3-D Object Shapes from Range Data Salvador Ruiz-Correa, Linda G. Shapiro, Marina Meila
COLT 2003 Comparing Clusterings by the Variation of Information Marina Meila
AISTATS 2003 Data Centering in Feature Space Marina Meilă
NeurIPS 2003 Discriminating Deformable Shape Classes Salvador Ruiz-correa, Linda G. Shapiro, Marina Meila, Gabriel Berson
NeurIPS 2002 Real-Time Particle Filters Cody Kwok, Dieter Fox, Marina Meila
CVPR 2001 A New Signature-Based Method for Efficient 3-D Object Recognition Salvador Ruiz-Correa, Linda G. Shapiro, Marina Meila
AISTATS 2001 A Random Walks View of Spectral Segmentation Marina Meilă, Jianbo Shi
MLJ 2001 An Experimental Comparison of Model-Based Clustering Methods Marina Meila, David Heckerman
NeurIPS 2001 Intransitive Likelihood-Ratio Classifiers Jeff Bilmes, Gang Ji, Marina Meila
NeurIPS 2000 Learning Segmentation by Random Walks Marina Meila, Jianbo Shi
JMLR 2000 Learning with Mixtures of Trees Marina Meila, Michael I. Jordan
UAI 2000 Tractable Bayesian Learning of Tree Belief Networks Marina Meila, Tommi S. Jaakkola
ICML 1999 An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High-Dimensional Sparse Data Marina Meila
NeurIPS 1999 Maximum Entropy Discrimination Tommi Jaakkola, Marina Meila, Tony Jebara
UAI 1998 An Experimental Comparison of Several Clustering and Initialization Methods Marina Meila, David Heckerman
AISTATS 1997 An Objective Function for Belief Net Triangulation Marina Meilă, Michael I. Jordan
NeurIPS 1997 Estimating Dependency Structure as a Hidden Variable Marina Meila, Michael I. Jordan
NeurIPS 1996 Triangulation by Continuous Embedding Marina Meila, Michael I. Jordan
NeurIPS 1995 Learning Fine Motion by Markov Mixtures of Experts Marina Meila, Michael I. Jordan