Sciweavers

576 search results - page 4 / 116
» Structured metric learning for high dimensional problems
Sort
View
ICPR
2010
IEEE
14 years 1 months ago
A Bound on the Performance of LDA in Randomly Projected Data Spaces
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...
Robert John Durrant, Ata Kaban
ICMLA
2009
13 years 4 months ago
Learning Deep Neural Networks for High Dimensional Output Problems
State-of-the-art pattern recognition methods have difficulty dealing with problems where the dimension of the output space is large. In this article, we propose a new framework ba...
Benjamin Labbé, Romain Hérault, Cl&e...
ICASSP
2010
IEEE
13 years 6 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
ICML
1995
IEEE
14 years 7 months ago
Visualizing High-Dimensional Structure with the Incremental Grid Growing Neural Network
Understanding high-dimensional real world data usually requires learning the structure of the data space. The structure maycontain high-dimensional clusters that are related in co...
Justine Blackmore, Risto Miikkulainen
CVPR
2010
IEEE
14 years 2 months ago
Data Fusion through Cross-modality Metric Learning using Similarity-Sensitive Hashing
Visual understanding is often based on measuring similarity between observations. Learning similarities specific to a certain perception task from a set of examples has been show...
Michael Bronstein, Alexander Bronstein, Nikos Para...