Clustering Algorithm
Clustering algorithms aim to group similar data points together, revealing underlying structure and patterns within datasets. Current research emphasizes improving scalability and efficiency for large datasets, exploring novel approaches like those based on graph neural networks, cellular automata, and dimensionality reduction techniques such as UMAP, often combined with established methods like k-means and DBSCAN. These advancements are crucial for diverse applications, ranging from image analysis and text processing to high-energy physics and urban planning, enabling more effective data exploration and knowledge discovery.
Papers
Towards Practical Explainability with Cluster Descriptors
Xiaoyuan Liu, Ilya Tyagin, Hayato Ushijima-Mwesigwa, Indradeep Ghosh, Ilya Safro
Agglomerative Hierarchical Clustering with Dynamic Time Warping for Household Load Curve Clustering
Fadi AlMahamid, Katarina Grolinger
An enhanced method of initial cluster center selection for K-means algorithm
Zillur Rahman, Md. Sabir Hossain, Mohammad Hasan, Ahmed Imteaj