Metric concentration search procedure using reduced matrix of pairwise distances

This paper presents a new fast clustering algorithm RhoNet, based on the metric concenration location procedure. To locate the metric concentration, the algorithm uses a reduced matrix of pairwise ranks distances. The key feature of the proposed algorithm is that it doesn’t need the exhaustive matrix of pairwise distances. This feature reduces computational complexity. It is designed to solve the protein secondary structure recognition problem. The computational experiment collects tests and to hold performance analysis and analysis of dependency for the algorithm quality and structure parameters. The algorithm is compared with k-modes and tested on different metrics and data sets.

[1]  Martin Ester,et al.  Density‐based clustering , 2019, WIREs Data Mining Knowl. Discov..

[2]  Zhang Wei,et al.  A grid clustering algorithm based on reference and density , 2005 .

[3]  Peter N. Yianilos,et al.  Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[4]  Joshua Zhexue Huang,et al.  A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining , 1997, DMKD.

[5]  Weidong Zhao,et al.  A New Clustering Algorithm for Categorical Attributes , 2004, ICEB.

[6]  Vincent Kanade,et al.  Clustering Algorithms , 2021, Wireless RF Energy Transfer in the Massive IoT Era.

[7]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[8]  Qi Li,et al.  Fast k-means algorithm clustering , 2011, ArXiv.

[9]  Shiwei Tang,et al.  A New Fast Clustering Algorithm Based on Reference and Density , 2003, WAIM.

[10]  Sudipto Guha,et al.  ROCK: a robust clustering algorithm for categorical attributes , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).