Abstract
In this paper, we present a new algorithm based on the nearest neighbours method, for discovering groups and identifying interesting distributions in the underlying data in the labelled databases. We introduces the theory of nearest neighbours sets in order to base the algorithm S-NN (Similar Nearest Neighbours). Traditional clustering algorithms are very sensitive to the user-defined parameters and an expert knowledge is required to choose the values. Frequently, these algorithms are fragile in the presence of outliers and any adjust well to spherical shapes. Experiments have shown that S-NN is accurate discovering arbitrary shapes and density clusters, since it takes into account the internal features of each cluster, and it does not depend on a user- supplied static model. S-NN achieve this by collecting the nearest neighbours with the same label until the enemy is found (it has not the same label). The determinism and the results offered to the researcher turn it into a valuable tool for the representation of the inherent knowledge to the labelled databases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aha, D. W. A (1990). Study of Instance-Based Algorithms for Supervised Learning Tasks: Mathematical, Empirical, and psychological Evaluations. Ph. D. Dissertation. UCI.
Codrington, C. W. y Brodley, C. E. (1997). On the Qualitative Behavior of Impurity-Based Splitting Rules I: The Minima-Free Property. Technical Report, Purdue University.
Cover, T. M. y Hart, P. E. (1967). Nearest Neighbor Pattern Classification. NN-Pattern Classification Techniques. IEEE.
Chang, C. L. (1974). Finding Prototypes for Nearest Neighbor Classifiers. IEEE Transactions on Computers.
Hart, P. E. (1968). The condensed nearest neighbor rule. IEEE Transactions on Information Theory, IT-14.
Hellman, M. E. (1970). The Nearest Neighbor Classification Rule with a Reject Option. NN-Pattern Classification Techniques. IEEE.
Jarvis, R. A. y Patrick, E. A. (1973). Clustering using a Similarity Measure Based on Shared Near Neighbors. IEEE Transactions on Computers.
Joussellin, A. y Dubuisson, B. (1987). A Link Between k-Nearest Neighbor Rules and Knowledge Based Systems by Sequence Analysis. Pattern Recognition Letters.
Patrick, E. A. y Fischer, F. P. (1970). A Generalized k-Nearest Neighbor Rule. NN-Pattern Classification Techniques. IEEE.
Ritter, G. L., Woodruff, H. B., Lowry, S. R. y Isenhour, T. L. (1975). An algorithm for a Selective Nearest Neighbor Decision Rule. IEEE Transactions on Information Theory, 21.
Tomek, I. (1976). An Experiment with the Edited Nearest-Neighbor Rule. IEEE Transactions on Systems, Man, an Cybernetics SMC-6.
Wilson, D. (1972). Asymptotic Properties of Nearest Neighbor Rules using Edited Data. IEEE Transactions on Systems, Man and Cybernetics 2.
D. Fisher. (1995). Optimization and Simplification of Hierarchical Clusters. Proceedings of the International Conference on Knowledge Discovery and Data Mining.
S. Guha, (1998). CURE: An Efficient Clustering Algorithm for Large Databases. Proceedings of the 1998 ACM SIGMOD Conference.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aguilar, J.S., Ruiz, R., Riquelme, J.C., Giráldez, R. (2001). SNN: A Supervised Clustering Algorithm. In: Monostori, L., Váncza, J., Ali, M. (eds) Engineering of Intelligent Systems. IEA/AIE 2001. Lecture Notes in Computer Science(), vol 2070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45517-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-45517-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42219-8
Online ISBN: 978-3-540-45517-2
eBook Packages: Springer Book Archive