Sciweavers

1364 search results - page 115 / 273
» Sampling Methods for Unsupervised Learning
Sort
View
ICML
2004
IEEE
16 years 3 months ago
Variational methods for the Dirichlet process
Variational inference methods, including mean field methods and loopy belief propagation, have been widely used for approximate probabilistic inference in graphical models. While ...
David M. Blei, Michael I. Jordan
MLDM
2005
Springer
15 years 8 months ago
Linear Manifold Clustering
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
Robert M. Haralick, Rave Harpaz
IJON
2010
121views more  IJON 2010»
15 years 4 days ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen
PRIB
2010
Springer
242views Bioinformatics» more  PRIB 2010»
15 years 1 months ago
Consensus of Ambiguity: Theory and Application of Active Learning for Biomedical Image Analysis
Abstract. Supervised classifiers require manually labeled training samples to classify unlabeled objects. Active Learning (AL) can be used to selectively label only “ambiguous...
Scott Doyle, Anant Madabhushi
ICML
2007
IEEE
16 years 3 months ago
Optimal dimensionality of metric space for classification
In many real-world applications, Euclidean distance in the original space is not good due to the curse of dimensionality. In this paper, we propose a new method, called Discrimina...
Wei Zhang, Xiangyang Xue, Zichen Sun, Yue-Fei Guo,...