Grouping data into meaningful clusters is an important task of both artificial intelligence and data mining. An important group of clustering algorithms are density based ones that require calculation of a neighborhood of a given data point. The bottleneck for such algorithms are high dimensional data. In this paper, we propose a new TI-k-Neighborhood-Index algorithm that calculates k-neighborhoods for all points in a given data set by means the triangle inequality. We prove experimentally that the NBC (Neighborhood Based Clustering) clustering algorithm supported by our index outperforms NBC supported by such known spatial indices as VA-file and R-tree both in the case of low and high dimensional data. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kryszkiewicz, M., & Lasek, P. (2010). A neighborhood-based clustering by means of the triangle inequality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6283 LNCS, pp. 284–291). https://doi.org/10.1007/978-3-642-15381-5_35
Mendeley helps you to discover research relevant for your work.