Data Points Clustering via Gumbel Softmax

Deepak Bhaskar Acharya, Huaming Zhang

Abstract: Finding useful patterns in the dataset has been a fascinating topic, and one of the most researched problems in this area is identifying the cluster groups within the dataset. This research paper introduces a “new data clustering method” called Data Points Clustering via Gumbel Softmax (DPCGS) and demonstrates that it is suitable for clustering the data points datasets. We evaluate DPCGS efficiency and clustering quality through several experiments. Experiments show that statistically relevant clustering structures can be identified with our method, depending on the dataset. We also present a performance comparison table where we use datasets such as Wine, Wheat seeds, Iris, Wisconsin breast cancer and compare the DPCGS results with different benchmarking and recently proposed clustering algorithms such as Birch, K-Means, Affinity propagation, Agglomerative clustering, and Mini-batch K-Means and Nested mini-batch K-Means. Our method DPCGS performs better than most of the previously and recently proposed clustering algorithms.

External IDs:dblp:journals/sncs/AcharyaZ21