Sciweavers

356 search results - page 24 / 72
» Further results on the subspace distance
Sort
View
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
13 years 12 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
ANOR
2006
64views more  ANOR 2006»
13 years 10 months ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz
CVPR
2007
IEEE
14 years 12 months ago
Face Recognition Using Kernel Ridge Regression
In this paper, we present novel ridge regression (RR) and kernel ridge regression (KRR) techniques for multivariate labels and apply the methods to the problem of face recognition...
Senjian An, Wanquan Liu, Svetha Venkatesh
AUSAI
2005
Springer
14 years 3 months ago
New Feature Extraction Approaches for Face Recognition
All the traditional PCA-based and LDA-based methods are based on the analysis of vectors. So, it is difficult to evaluate the covariance matrices in such a high-dimensional vector ...
Vo Dinh Minh Nhat, Sungyoung Lee
VLSISP
2010
254views more  VLSISP 2010»
13 years 8 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...