Sciweavers

576 search results - page 20 / 116
» Structured metric learning for high dimensional problems
Sort
View
175
Voted
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
15 years 10 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
BMCBI
2006
173views more  BMCBI 2006»
14 years 9 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
93
Voted
BMVC
2010
14 years 7 months ago
Iterative Hyperplane Merging: A Framework for Manifold Learning
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
Harry Strange, Reyer Zwiggelaar
ISCAS
2008
IEEE
145views Hardware» more  ISCAS 2008»
15 years 4 months ago
Group learning using contrast NMF : Application to functional and structural MRI of schizophrenia
— Non-negative Matrix factorization (NMF) has increasingly been used as a tool in signal processing in the last couple of years. NMF, like independent component analysis (ICA) is...
Vamsi K. Potluru, Vince D. Calhoun
ICANN
2010
Springer
14 years 10 months ago
Kernel-Based Learning from Infinite Dimensional 2-Way Tensors
Abstract. In this paper we elaborate on a kernel extension to tensorbased data analysis. The proposed ideas find applications in supervised learning problems where input data have ...
Marco Signoretto, Lieven De Lathauwer, Johan A. K....