Sciweavers

1187 search results - page 41 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
ICML
2006
IEEE
15 years 10 months ago
The support vector decomposition machine
In machine learning problems with tens of thousands of features and only dozens or hundreds of independent training examples, dimensionality reduction is essential for good learni...
Francisco Pereira, Geoffrey J. Gordon
ICML
2010
IEEE
14 years 10 months ago
Local Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
Minyoung Kim, Fernando De la Torre
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
14 years 11 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
CVPR
1999
IEEE
15 years 11 months ago
Face Recognition Using Shape and Texture
We introduce in this paper a new face coding and recognition method which employs the Enhanced FLD (Fisher Linear Discrimimant) Model (EFM)on integrated shape (vector) and texture...
Chengjun Liu, Harry Wechsler
SIGIR
2004
ACM
15 years 3 months ago
Locality preserving indexing for document representation
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
Xiaofei He, Deng Cai, Haifeng Liu, Wei-Ying Ma