Sciweavers

570 search results - page 43 / 114
» Intrinsic Geometries in Learning
Sort
View
FOCM
2007
76views more  FOCM 2007»
13 years 7 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
ICML
2005
IEEE
14 years 8 months ago
Clustering through ranking on manifolds
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
Markus Breitenbach, Gregory Z. Grudic
CVPR
2005
IEEE
14 years 9 months ago
Local Discriminant Embedding and Its Variants
We present a new approach, called local discriminant embedding (LDE), to manifold learning and pattern classification. In our framework, the neighbor and class relations of data a...
Hwann-Tzong Chen, Huang-Wei Chang, Tyng-Luh Liu
PKDD
2005
Springer
85views Data Mining» more  PKDD 2005»
14 years 1 months ago
Improving Generalization by Data Categorization
In most of the learning algorithms, examples in the training set are treated equally. Some examples, however, carry more reliable or critical information about the target than the ...
Ling Li, Amrit Pratap, Hsuan-Tien Lin, Yaser S. Ab...
IJCV
2010
186views more  IJCV 2010»
13 years 6 months ago
An Approach to the Parameterization of Structure for Fast Categorization
A decomposition is described, which parameterizes the geometry and appearance of contours and regions of gray-scale images with the goal of fast categorization. To express the con...
Christoph Rasche