Sciweavers

99 search results - page 6 / 20
» Generalization of the Kantorovich Method of Dimensional Redu...
Sort
View
MCS
2001
Springer
14 years 2 months ago
Input Decimation Ensembles: Decorrelation through Dimensionality Reduction
Using an ensemble of classifiers instead of a single classifier has been shown to improve generalization performance in many machine learning problems [4, 16]. However, the exten...
Nikunj C. Oza, Kagan Tumer
TNN
2008
105views more  TNN 2008»
13 years 9 months ago
Generalized Linear Discriminant Analysis: A Unified Framework and Efficient Model Selection
Abstract--High-dimensional data are common in many domains, and dimensionality reduction is the key to cope with the curse-of-dimensionality. Linear discriminant analysis (LDA) is ...
Shuiwang Ji, Jieping Ye
PR
2008
129views more  PR 2008»
13 years 9 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
CDC
2008
IEEE
118views Control Systems» more  CDC 2008»
14 years 4 months ago
A density projection approach to dimension reduction for continuous-state POMDPs
Abstract— Research on numerical solution methods for partially observable Markov decision processes (POMDPs) has primarily focused on discrete-state models, and these algorithms ...
Enlu Zhou, Michael C. Fu, Steven I. Marcus
CORR
2012
Springer
198views Education» more  CORR 2012»
12 years 5 months ago
Lipschitz Parametrization of Probabilistic Graphical Models
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the ￿p-norm of the parameters. We discuss several implications ...
Jean Honorio