NIPS Proceedingsβ

Marina Meila

14 Papers

  • Improved Graph Laplacian via Geometric Self-Consistency (2017)
  • Graph Clustering: Block-models and model free results (2016)
  • Nearly Isometric Embedding by Relaxation (2016)
  • A class of network models recoverable by spectral clustering (2015)
  • Recursive Inversion Models for Permutations (2014)
  • Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators (2011)
  • Discriminating Deformable Shape Classes (2003)
  • Real-Time Particle Filters (2002)
  • Intransitive Likelihood-Ratio Classifiers (2001)
  • Learning Segmentation by Random Walks (2000)
  • Maximum Entropy Discrimination (1999)
  • Estimating Dependency Structure as a Hidden Variable (1997)
  • Triangulation by Continuous Embedding (1996)
  • Learning Fine Motion by Markov Mixtures of Experts (1995)