Sciweavers

2033 search results - page 196 / 407
» Ranking on Data Manifolds
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 6 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
GRC
2010
IEEE
15 years 7 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
CVPR
2005
IEEE
16 years 8 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
ICPR
2008
IEEE
16 years 7 months ago
Hand motion expertise analysis using dynamic hierarchical activity modeling and isomap
Several domains such as sports, surgery, dance etc. are characterized by a significant influence of expertise of the performer on the motion pattern and style. The retrieval of ex...
Kanav Kahol, Mithra Vankipuram
ICML
2009
IEEE
16 years 7 months ago
Prototype vector machine for large scale semi-supervised learning
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
Kai Zhang, James T. Kwok, Bahram Parvin