Sciweavers

112 search results - page 3 / 23
» Linear Laplacian Discrimination for Feature Extraction
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Feature Extraction by Maximizing the Average Neighborhood Margin
A novel algorithm called Average Neighborhood Margin Maximization (ANMM) is proposed for supervised linear feature extraction. For each data point, ANMM aims at pulling the neighb...
Fei Wang, Changshui Zhang
ICPR
2008
IEEE
14 years 1 months ago
Linear discriminant analysis for data with subcluster structure
Linear discriminant analysis (LDA) is a widely-used feature extraction method in classification. However, the original LDA has limitations due to the assumption of a unimodal str...
Haesun Park, Jaegul Choo, Barry L. Drake, Jinwoo K...
ICASSP
2011
IEEE
12 years 11 months ago
Distributed linear discriminant analysis
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
Sergio Valcarcel Macua, Pavle Belanovic, Santiago ...
CGF
2007
94views more  CGF 2007»
13 years 7 months ago
Effective Derivation of Similarity Transformations for Implicit Laplacian Mesh Editing
Laplacian coordinates as a local shape descriptor have been employed in mesh editing. As they are encoded in the global coordinate system, they need to be transformed locally to r...
Hongbo Fu, Oscar Kin-Chung Au, Chiew-Lan Tai
ACL
2006
13 years 8 months ago
Modeling Commonality among Related Classes in Relation Extraction
This paper proposes a novel hierarchical learning strategy to deal with the data sparseness problem in relation extraction by modeling the commonality among related classes. For e...
Guodong Zhou, Jian Su, Min Zhang