Sciweavers

75 search results - page 1 / 15
» Optimal dimensionality of metric space for classification
Sort
View
ICML
2007
IEEE
14 years 5 months ago
Optimal dimensionality of metric space for classification
In many real-world applications, Euclidean distance in the original space is not good due to the curse of dimensionality. In this paper, we propose a new method, called Discrimina...
Wei Zhang, Xiangyang Xue, Zichen Sun, Yue-Fei Guo,...
BMCBI
2006
173views more  BMCBI 2006»
13 years 4 months ago
Kernel-based distance metric learning for microarray data classification
Background: The most fundamental task using gene expression data in clinical oncology is to classify tissue samples according to their gene expression levels. Compared with tradit...
Huilin Xiong, Xue-wen Chen
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 5 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
CIVR
2006
Springer
131views Image Analysis» more  CIVR 2006»
13 years 8 months ago
A Multi-feature Optimization Approach to Object-Based Image Classification
This paper proposes a novel approach for the construction and use of multi-feature spaces in image classification. The proposed technique combines low-level descriptors and defines...
Qianni Zhang, Ebroul Izquierdo
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 5 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon