The Community for Technology Leaders
Issue No. 03 - March (2014 vol. 26)
ISSN: 1041-4347
pp: 739-751
Nenad Tomasev , Jozef Stefan Institute, Artificial Intelligence Laboratory and Jozef Stefan International Postgraduate School, Ljubljana
Milos Radovanovic , University of Novi Sad, Novi Sad
Dunja Mladenic , Jozef Stefan Institute, Artificial Intelligence Laboratory and Jozef Stefan International Postgraduate School, Ljubljana
Mirjana Ivanovic , University of Novi Sad, Novi Sad
ABSTRACT
High-dimensional data arise naturally in many domains, and have regularly presented a great challenge for traditional data mining techniques, both in terms of effectiveness and efficiency. Clustering becomes difficult due to the increasing sparsity of such data, as well as the increasing difficulty in distinguishing distances between data points. In this paper, we take a novel perspective on the problem of clustering high-dimensional data. Instead of attempting to avoid the curse of dimensionality by observing a lower dimensional feature subspace, we embrace dimensionality by taking advantage of inherently high-dimensional phenomena. More specifically, we show that hubness, i.e., the tendency of high-dimensional data to contain points (hubs) that frequently occur in $(k)$-nearest-neighbor lists of other points, can be successfully exploited in clustering. We validate our hypothesis by demonstrating that hubness is a good measure of point centrality within a high-dimensional data cluster, and by proposing several hubness-based clustering algorithms, showing that major hubs can be used effectively as cluster prototypes or as guides during the search for centroid-based cluster configurations. Experimental results demonstrate good performance of our algorithms in multiple settings, particularly in the presence of large quantities of noise. The proposed methods are tailored mostly for detecting approximately hyperspherical clusters and need to be extended to properly handle clusters of arbitrary shapes.
INDEX TERMS
Correlation, Clustering algorithms, Prototypes, Approximation algorithms, Gaussian distribution, Partitioning algorithms, Educational institutions,hubs, Clustering, curse of dimensionality, nearest neighbors
CITATION
Nenad Tomasev, Milos Radovanovic, Dunja Mladenic, Mirjana Ivanovic, "The Role of Hubness in Clustering High-Dimensional Data", IEEE Transactions on Knowledge & Data Engineering, vol. 26, no. , pp. 739-751, March 2014, doi:10.1109/TKDE.2013.25
FULL ARTICLE
CITATIONS
SHARE
608 ms
(Ver 3.1 (10032016))