Sciweavers

39 search results - page 6 / 8
» Adaptive Metric nearest Neighbor Classification
Sort
View
CLA
2006
13 years 8 months ago
Towards an Iterative Classification Based on Concept Lattice
In this paper, we propose a generic description of the concept lattice as classifier in an iterative recognition process. We also present the development of a new structural signat...
Stéphanie Guillas, Karell Bertet, Jean-Marc...
PRICAI
2010
Springer
13 years 4 months ago
Sparse Representation: Extract Adaptive Neighborhood for Multilabel Classification
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...
Shuo Xiang, Songcan Chen, Lishan Qiao
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 7 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
ICIP
2007
IEEE
14 years 8 months ago
Query-Driven Locally Adaptive Fisher Faces and Expert-Model for Face Recognition
We present a novel expert-model of Query-Driven Locally Adaptive (QDLA) Fisher faces for robust face recognition. For each query face, the proposed method first fits local Fisher ...
Yun Fu, Junsong Yuan, Zhu Li, Thomas S. Huang, Yin...
CVPR
2004
IEEE
14 years 9 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
Qifa Ke, Takeo Kanade