Sciweavers

1658 search results - page 96 / 332
» Learning Mixtures of Gaussians
Sort
View
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
16 years 6 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
ICML
2004
IEEE
16 years 7 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
ICPR
2010
IEEE
15 years 10 months ago
Gaussian Process Learning from Order Relationships Using Expectation Propagation
A method for Gaussian process learning of a scalar function from a set of pair-wise order relationships is presented. Expectation propagation is used to obtain an approximation to...
Ruixuan Wang, Stephen James Mckenna
NIPS
2001
15 years 7 months ago
Learning a Gaussian Process Prior for Automatically Generating Music Playlists
This paper presents AutoDJ: a system for automatically generating music playlists based on one or more seed songs selected by a user. AutoDJ uses Gaussian Process Regression to le...
John C. Platt, Christopher J. C. Burges, S. Swenso...
FOCS
2010
IEEE
15 years 4 months ago
Learning Convex Concepts from Gaussian Distributions with PCA
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
Santosh Vempala