Sciweavers

98 search results - page 14 / 20
» Regression on manifolds using kernel dimension reduction
Sort
View
IRI
2007
IEEE
14 years 1 months ago
Enhancing Text Analysis via Dimensionality Reduction
Many applications require analyzing vast amounts of textual data, but the size and inherent noise of such data can make processing very challenging. One approach to these issues i...
David G. Underhill, Luke McDowell, David J. Marche...
PR
2010
186views more  PR 2010»
13 years 5 months ago
Feature extraction by learning Lorentzian metric tensor and its extensions
We develop a supervised dimensionality reduction method, called Lorentzian Discriminant Projection (LDP), for feature extraction and classification. Our method represents the str...
Risheng Liu, Zhouchen Lin, Zhixun Su, Kewei Tang
ICASSP
2011
IEEE
12 years 10 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 7 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
EOR
2007
165views more  EOR 2007»
13 years 6 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang