loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Conference on Pattern Recognition (ICPR'06) Volume 4
Classification Using the Local Probabilistic Centers of k-Nearest Neighbors
Hong Kong
August 20-August 24
ISBN: 0-7695-2521-0
Bo Yu Li, Fudan University, Shanghai, 200433, P.R. China.
Yun Wen Chen, Fudan University, Shanghai, 200433, P.R. China.
In high dimensional feature space with finite samples, severe bias can be introduced in the nearest neighbor algorithm. In this paper, we propose a new classification method, which performs classification task based on local probability center of each class. Moreover, this prototypebased method classifies the query sample by using two measures, one is the distance between query and local probability centers, the other is the posterior probability of query. Although both measures are effect, the experiments show the second one is the better. The investigation results prove that this method improves the classification performance of nearest neighbor algorithm substantially.
Citation:
Bo Yu Li, Yun Wen Chen, "Classification Using the Local Probabilistic Centers of k-Nearest Neighbors," icpr, vol. 4, pp.954, 18th International Conference on Pattern Recognition (ICPR'06) Volume 4, 2006
Usage of this product signifies your acceptance of the Terms of Use.