Abstract
A distance based classification is one of the popular methods for classifying instances using a point-to-point distance based on the nearest neighbour or k-NEAREST NEIGHBOUR (k-NN). The representation of distance measure can be one of the various measures available (e.g. Euclidean distance, Manhattan distance, Mahalanobis distance or other specific distance measures). In this paper, we propose a modified nearest neighbour method called Nearest Neighbour Distance Matrix (NNDM) for classification based on unsupervised and supervised distance matrix. In the proposed NNDM method, an Euclidean distance method coupled with a distance loss function is used to create a distance matrix. In our approach, distances of each instance to the rest of the training instances data will be used to create the training distance matrix (TADM). Then, the TADM will be used to classify a new instance. In supervised NNDM, two instances that belong to different classes will be pushed apart from each other. This is to ensure that the instances that are located next to each other belong to the same class. Based on the experimental results, we found that the trained distance matrix yields reasonable performance in classification.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cover, T.M., Hart, P.E.: Nearest Neighbor Pattern Classification. IEEE Transactions in Information Theory IT-13, 21–27 (1967)
Weinberger, K.Q., Saul, L.K.: Distance Metric Learning for Large Margin Nearest Neighbor Classification. Journal of Machine Learning Research 10, 207–244 (2009)
Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape context. IEEE Trans. PAMI 24, 705–722 (2002)
Simard, P.Y., LeChun, Y., Decker, J.: Efficient pattern Recognition using a new transformation distance. In: Hanson, S., Cowan, J., Giles, L. (eds.) Advances in Neural Information Processing System, vol. 6, pp. 50–58. Morgan Kaufman, San Mateo (1993)
Zhang, B., Srihari, S.N.: Fast k-Nearest Neighbor Classification Using Cluster-Based Trees. IEEE Transaction on Pattern Analysis and Machine Intelligence 26, 525–528 (2004)
Chopra, S., Hadsell, R., LeCun, Y.: Learning a similarity metric discriminatively, with application to face verification. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2005), pp. 349–356 (2005)
Goldberger, J., Roweis, S., Hinton, G., Salakhutdinov, R.: Neighbourhood components analysis. In: Saul, L.K., Weiss, Y., Bottou, L. (eds.) Advances in Neural Information Processing Systems 17, pp. 513–520. MIT Press, Cambridge (2005)
Shalev-Shwartz, S., Singer, Y., Ng, A.Y.: Online and batch learning of pseudo-metrics. In: Proceedings of the Twenty First International Conference on Machine Learning (ICML 2004), pp. 94–101 (2004)
Shental, N., Hertz, T., Weinshall, D., Pavel, M.: Adjustment learning and relevant component analysis. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2353, pp. 776–790. Springer, Heidelberg (2002)
Mahalanobis, P.C.: On the generalised distance in statistics. Proceedings of the National Institute of Sciences of India 2, 49–55 (1939)
Ling, H., Jacobs, D.W.: Shape Classification Using the Inner-Distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 29, 286–299 (2007)
Bai, X., Yang, X., Latecki, L.J., Liu, W., Tu, Z.: Learning Context Sensitive Shape Similarity by Graph Transduction. IEEE Trans. Pattern Analysis and Machine Intelligence (PAMI) 31 (2009)
Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
Keogh, E., Xi, X., Wei, L., Ratanamahatana, C.A.: The UCR Time Series Classification/Clustering Homepage (2006), http://www.cs.ucr.edu/~eamonn/time_series_data/
Agarwal, G., Ling, H., Jacobs, D., Shirdhonkar, S., Kress, W.J., Russell, R., Belhumeur, P., Dixit, A., Feiner, S., Mahajan, D., Sunkavalli, K., Ramamoorthi, R., White, S.: First steps toward an electronic field guide for plants. Taxon 55, 597–610 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sainin, M.S., Alfred, R. (2010). Nearest Neighbour Distance Matrix Classification. In: Cao, L., Feng, Y., Zhong, J. (eds) Advanced Data Mining and Applications. ADMA 2010. Lecture Notes in Computer Science(), vol 6440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17316-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-17316-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17315-8
Online ISBN: 978-3-642-17316-5
eBook Packages: Computer ScienceComputer Science (R0)