L
Lawrence K. Saul
Researcher at University of California, San Diego
Publications - 138
Citations - 40154
Lawrence K. Saul is an academic researcher from University of California, San Diego. The author has contributed to research in topics: Hidden Markov model & Nonlinear dimensionality reduction. The author has an hindex of 49, co-authored 133 publications receiving 37255 citations. Previous affiliations of Lawrence K. Saul include Massachusetts Institute of Technology & University of Pennsylvania.
Papers
More filters
Journal ArticleDOI
Nonlinear dimensionality reduction by locally linear embedding.
Sam T. Roweis,Lawrence K. Saul +1 more
TL;DR: Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
Proceedings Article
Distance Metric Learning for Large Margin Nearest Neighbor Classification
TL;DR: In this article, a Mahanalobis distance metric for k-NN classification is trained with the goal that the k-nearest neighbors always belong to the same class while examples from different classes are separated by a large margin.
Journal ArticleDOI
Distance Metric Learning for Large Margin Nearest Neighbor Classification
TL;DR: This paper shows how to learn a Mahalanobis distance metric for kNN classification from labeled examples in a globally integrated manner and finds that metrics trained in this way lead to significant improvements in kNN Classification.
Journal ArticleDOI
An introduction to variational methods for graphical models
TL;DR: This paper presents a tutorial introduction to the use of variational methods for inference and learning in graphical models (Bayesian networks and Markov random fields), and describes a general framework for generating variational transformations based on convex duality.
Journal ArticleDOI
Think globally, fit locally: unsupervised learning of low dimensional manifolds
Lawrence K. Saul,Sam T. Roweis +1 more
TL;DR: Locally linear embedding (LLE), an unsupervised learning algorithm that computes low dimensional, neighborhood preserving embeddings of high dimensional data, is described and several extensions that enhance its performance are discussed.