Nonlinear dimensionality reduction for clustering
Επιτομή
We introduce an approach to divisive hierarchical clustering that is capable of identifying clusters in nonlinear manifolds. This approach uses the isometric mapping (Isomap) to recursively embed (subsets of) the data in one dimension, and then performs a binary partition designed to avoid the splitting of clusters. We provide a theoretical analysis of the conditions under which contiguous and high-density clusters in the original space are guaranteed to be separable in the one-dimensional embedding. To the best of our knowledge there is little prior work that studies this problem. Extensive experiments on simulated and real data sets show that hierarchical divisive clustering algorithms derived from this approach are effective. © 2020
Collections
Related items
Showing items related by title, author, creator and subject.
-
A Scalable Short-Text Clustering Algorithm Using Apache Spark
Akritidis L., Alamaniotis M., Fevgas A., Bozanis P. (2021)Short text clustering deals with the problem of grouping together semantically similar documents with small lengths. Nowadays, huge amounts of text data is being generated by numerous applications such as microblogs, ... -
Online clustering of distributed streaming data using belief propagation techniques
Halkidi, M.; Koutsopoulos, I. (2011)Extraction of patterns out of streaming data that are generated from geographically dispersed devices is a major challenge in data mining. The sequential, distributed fashion in which data become available to the decision ... -
Distributed clustering in vehicular networks
Maglaras, L. A.; Katsaros, D. (2012)Clustering in vanets is of crucial importance in order to cope with the dynamic features of the vehicular topologies. Algorithms that give good results in Manets fail to create stable clusters since vehicular nodes are ...