CRITICAL BOUNDARY VECTOR CONCEPT IN NEAREST NEIGHBOR CLASSIFIERS USING K-MEANS CENTERS FOR EFFICIENT TEMPLATE REDUCTION

Wenjun Xia, Tadashi Shibata

2011

Abstract

Dealing with large data sets, the computational cost and resource demands using the nearest neighbor (NN) classifier can be prohibitive. Aiming at efficient template condensation, this paper proposes a template re-duction algorithm for NN classifier by introducing the concept of critical boundary vectors in conjunction with K-means centers. Initially K-means centers are used as substitution for the entire template set. Then, in order to enhance the classification performance, critical boundary vectors are selected according to a newly proposed training algorithm which completes with only single iteration. COIL-20 and COIL-100 databases were utilized for evaluating the performance of image categorization in which the bio-inspired directional-edge-based image feature representation (Suzuki and Shibata. 2004) was employed. UCI iris and UCI Landsat databases were also utilized to evaluate the system for other classification tasks using numerical-valued vectors. Experimental results show that by using the reduced template sets, the proposed algorithm shows a superior performance to NN classifier using all samples, and comparable to Support Vector Machines using Gaussian kernel which are computationally more expensive.

References

  1. Bajramovic, F., Mattern, F., Butko, N., (2006). A comparison of nearest neighbor search algorithms for generic object recognition. In ACIVS'06, Advanced Concepts for Intelligent Vision Systems.
  2. Bovolo, F., Bruzzone, L., Carlin, L., (2010). A novel technique for subpixel image classification based on support vector machine. IEEE Transactions on Image Processing, 19, 2983-2999.
  3. Chapelle, O., Haffner, P., Vapnik, V. N., (1999). Support vector machines for histogram-based image classification. IEEE Transactions on Neural Networks, 10, 1055-1064.
  4. Eick, C. F., Zeidat, N., Vilalta, R., (2004). Using representative-based clustering for nearest neighbor dataset editing. In ICDM'04, IEEE International Conference on Data Mining.
  5. Fayed, H., Atiya, A., (2009). A novel template reduction approach for the k-nearest neighbor method. IEEE Transactions on Neural Networks, 20, 890-896.
  6. Hsu, C. W., Lin, C. J., (2002). A comparison of methods for multiclass support vector machines. IEEE Transactions on Neural Networks, 13, 415-425
  7. Ma, Y., Shibata, T., (2010). A binary-tree hierarchical multiple-chip architecture of real-time large-scale learning processor systems. Japanese Journal of Applied Physics, 49, 04DE08-04DE08-8.
  8. Nikolaidis, K., Goulermas, J. Y., Wu, Q. H., (2011). A class boundary preserving algorithm for data condensation. Pattern Recognition, 44, 704-715.
  9. Shikano, H., Ito, K., Fujita, K., Shibata, T., (2007). A realtime learning processor based on k-means algorithm with automatic seeds generation. In Soc'07, the 2007 International Symposium on System-on-Chip.
  10. Suzuki, Y., Shibata, T., (2004). Multiple-clue face detection algorithm using edge-based feature vectors. In ICASSP'04, IEEE International Conference on Acoustic, Speech, and Signal Processing.
  11. Wu, Y. Q., Ianakiev, K., Govindaraju, V., (2002). Improved k-nearest neighbor classification. Pattern Recognition, 35, 2311-2318.
  12. Zhou, Y., Li, Y. W., Xia, S. X., (2009). An improved KNN text classification algorithm based on clustering. Journal of Computers, 4, 230-237.
Download


Paper Citation


in Harvard Style

Xia W. and Shibata T. (2011). CRITICAL BOUNDARY VECTOR CONCEPT IN NEAREST NEIGHBOR CLASSIFIERS USING K-MEANS CENTERS FOR EFFICIENT TEMPLATE REDUCTION . In Proceedings of the International Conference on Neural Computation Theory and Applications - Volume 1: NCTA, (IJCCI 2011) ISBN 978-989-8425-84-3, pages 93-98. DOI: 10.5220/0003642600930098


in Bibtex Style

@conference{ncta11,
author={Wenjun Xia and Tadashi Shibata},
title={CRITICAL BOUNDARY VECTOR CONCEPT IN NEAREST NEIGHBOR CLASSIFIERS USING K-MEANS CENTERS FOR EFFICIENT TEMPLATE REDUCTION},
booktitle={Proceedings of the International Conference on Neural Computation Theory and Applications - Volume 1: NCTA, (IJCCI 2011)},
year={2011},
pages={93-98},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003642600930098},
isbn={978-989-8425-84-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Neural Computation Theory and Applications - Volume 1: NCTA, (IJCCI 2011)
TI - CRITICAL BOUNDARY VECTOR CONCEPT IN NEAREST NEIGHBOR CLASSIFIERS USING K-MEANS CENTERS FOR EFFICIENT TEMPLATE REDUCTION
SN - 978-989-8425-84-3
AU - Xia W.
AU - Shibata T.
PY - 2011
SP - 93
EP - 98
DO - 10.5220/0003642600930098