Sciweavers

1419 search results - page 149 / 284
» Approximation Methods for Supervised Learning
Sort
View
115
Voted
NIPS
2004
15 years 2 months ago
Learning Gaussian Process Kernels via Hierarchical Bayes
We present a novel method for learning with Gaussian process regression in a hierarchical Bayesian framework. In a first step, kernel matrices on a fixed set of input points are l...
Anton Schwaighofer, Volker Tresp, Kai Yu
ICML
2004
IEEE
16 years 1 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 1 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 1 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
ACCV
2010
Springer
14 years 7 months ago
Descriptor Learning Based on Fisher Separation Criterion for Texture Classification
Abstract. This paper proposes a novel method to deal with the representation issue in texture classification. A learning framework of image descriptor is designed based on the Fish...
Yimo Guo, Guoying Zhao, Matti Pietikäinen, Zh...