Sciweavers

1364 search results - page 13 / 273
» Sampling Methods for Unsupervised Learning
Sort
View
ICML
2008
IEEE
15 years 11 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
JMLR
2010
211views more  JMLR 2010»
14 years 5 months ago
Minimum Conditional Entropy Clustering: A Discriminative Framework for Clustering
In this paper, we introduce an assumption which makes it possible to extend the learning ability of discriminative model to unsupervised setting. We propose an informationtheoreti...
Bo Dai, Baogang Hu
ESA
2006
Springer
118views Algorithms» more  ESA 2006»
15 years 2 months ago
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
120
Voted
ISNN
2004
Springer
15 years 4 months ago
Unsupervised Learning for Hierarchical Clustering Using Statistical Information
This paper proposes a novel hierarchical clustering method that can classify given data without specified knowledge of the number of classes. In this method, at each node of a hie...
Masaru Okamoto, Nan Bu, Toshio Tsuji
ICDM
2006
IEEE
225views Data Mining» more  ICDM 2006»
15 years 5 months ago
Adaptive Kernel Principal Component Analysis with Unsupervised Learning of Kernels
Choosing an appropriate kernel is one of the key problems in kernel-based methods. Most existing kernel selection methods require that the class labels of the training examples ar...
Daoqiang Zhang, Zhi-Hua Zhou, Songcan Chen