Novel Auxiliary Techniques in Clustering

Clustering is grouping of patterns according to similarity or distance in different perspectives. Various data representations, similarity measurements and organization manners are led to several classes of clustering methods. In this paper a new combinatorial method is proposed that iteratively uses another clustering method such as Rival Penalized Competitive Learning (RPCL) or K-Means as the core of clustering system. Moreover, some novel auxiliary techniques are suggested to increase the clustering performance. The proposed method has been compared with well known clustering methods such as K-Means, its improvement, ISODATA and DSRPCL2. The new combinatorial technique can detect the drawbacks of core clustering method and improve its efficiency. Our method is applied on some standard multi-class datasets. After clustering, labels of grouped samples in each cluster are compared with their real class labels to show the accuracy of clustering.

[1]  Narendra Ahuja,et al.  Advances in Image Understanding: A Festschrift for Azriel Rosenfeld , 1996 .

[2]  Ricardo Baeza-Yates,et al.  Information Retrieval: Data Structures and Algorithms , 1992 .

[3]  M. Narasimha Murty,et al.  A computationally efficient technique for data-clustering , 1980, Pattern Recognit..

[4]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[5]  Jinwen Ma,et al.  A cost-function approach to rival penalized competitive learning (RPCL) , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[6]  G Salton,et al.  Developments in Automatic Text Retrieval , 1991, Science.

[7]  Lindsay I. Smith,et al.  A tutorial on Principal Components Analysis , 2002 .

[8]  Luisa Micó,et al.  A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements , 1994, Pattern Recognit. Lett..

[9]  Zdenĕk Půlpán [Cluster analysis and its application]. , 2002, Acta medica (Hradec Kralove). Supplementum.

[10]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

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

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

[13]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[14]  Geoffrey H. Ball,et al.  ISODATA, A NOVEL METHOD OF DATA ANALYSIS AND PATTERN CLASSIFICATION , 1965 .

[15]  Khaled S. Al-Sultan,et al.  Computational experience on four algorithms for the hard clustering problem , 1996, Pattern Recognit. Lett..

[16]  Vijay V. Raghavan,et al.  An empirical study of the performance of heuristic methods for clustering , 1994 .