Sciweavers

133 search results - page 14 / 27
» Adaptive metric dimensionality reduction
Sort
View
BMCBI
2006
173views more  BMCBI 2006»
13 years 6 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
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
13 years 11 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ISM
2006
IEEE
138views Multimedia» more  ISM 2006»
13 years 6 months ago
Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, ca...
Nieves R. Brisaboa, Antonio Fariña, Oscar P...
IJCAI
2007
13 years 8 months ago
A Subspace Kernel for Nonlinear Feature Extraction
Kernel based nonlinear Feature Extraction (KFE) or dimensionality reduction is a widely used pre-processing step in pattern classification and data mining tasks. Given a positive...
Mingrui Wu, Jason D. R. Farquhar
ICML
2009
IEEE
14 years 7 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri