Sciweavers

695 search results - page 2 / 139
» The structure of intrinsic complexity of learning
Sort
View
ECCV
2006
Springer
14 years 6 months ago
Riemannian Manifold Learning for Nonlinear Dimensionality Reduction
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...
Tony Lin, Hongbin Zha, Sang Uk Lee
MVA
2010
130views Computer Vision» more  MVA 2010»
13 years 3 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh
CIKM
2009
Springer
13 years 11 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
ETVC
2008
13 years 6 months ago
Intrinsic Geometries in Learning
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
Richard Nock, Frank Nielsen
NIPS
2007
13 years 6 months ago
Learning the structure of manifolds using random projections
We present a simple variant of the k-d tree which automatically adapts to intrinsic low dimensional structure in data.
Yoav Freund, Sanjoy Dasgupta, Mayank Kabra, Nakul ...