More from the Same Authors

• 2020 Session: Orals & Spotlights Track 27: Unsupervised/Probabilistic »
  Marina Meila · Kun Zhang
• 2018 Poster: How to tell when a clustering is (approximately) correct using convex relaxations »
  Marina Meila
• 2017 : Topological Data Analisys with GUDHI and scalable manifold learning and clustering with megaman »
  Vincent Rouvreau · Marina Meila
• 2017 : Discussion: Geometric Data Analysis »
  Frederic Chazal · Marina Meila
• 2017 Workshop: Synergies in Geometric Data Analysis (TWO DAYS) »
  Marina Meila · Frederic Chazal · Yu-Chia Chen
• 2017 Poster: Improved Graph Laplacian via Geometric Self-Consistency »
  Dominique Perrault-Joncas · Marina Meila · James McQueen
• 2016 Poster: Nearly Isometric Embedding by Relaxation »
  James McQueen · Marina Meila · Dominique Perrault-Joncas
• 2016 Poster: Graph Clustering: Block-models and model free results »
  Yali Wan · Marina Meila
• 2015 Poster: A class of network models recoverable by spectral clustering »
  Yali Wan · Marina Meila
• 2014 Poster: Recursive Inversion Models for Permutations »
  Christopher Meek · Marina Meila
• 2011 Poster: Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators »
  Dominique C Perrault-Joncas · Marina Meila
• 2011 Spotlight: Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators »
  Dominique C Perrault-Joncas · Marina Meila
• 2009 Workshop: Learning with Orderings »
  Tiberio Caetano · Carlos Guestrin · Jonathan Huang · Risi Kondor · Guy Lebanon · Marina Meila