Peningkatan Kualitas K-Means Clustering Data Audio Musik Menggunakan Transformasi TableDC


Authors

  • Muhammad Aksa Hermawan Universitas Negeri Semarang, Semarang, Indonesia
  • Florentina Yuni Arini Universitas Negeri Semarang, Semarang, Indonesia

DOI:

https://doi.org/10.47065/bulletincsr.v6i3.1043

Keywords:

Autoencoder; Deep Clustering; K-Means; Music Information Retrieval; TableDC

Abstract

Clustering audio music data with high features typically suffers from performance degradation due to the curse of high dimensionality. A dataset with 518 classical K-Means features typically struggles to model nonlinear relationships between data. The purpose of this study is to analyze the implementation of the TableDC latent space transformation technique in the preprocessing stage before K-Means on the FMA Small dataset. This case study contains 8,000 songs with 518 audio features and is divided into eight music genres. The performance of K-Means on the original data is compared with that of K-Means on the latent space extracted by TableDC. The analysis is performed using several metrics such as the Silhouette Score, Davies-Bouldin Index, Calinski-Harabasz Index, Adjusted Rand Index, inertia or WCSS, and the number of iterations. The experimental results indicate a percentage improvement offered by the method. The Silhouette Score increased by 53 percent from the initial value of 0.0249 to 0.0382. Similarly, the ARI value increased from the initial value of 0.0876 to 0.0893. However, these absolute values remain very low, indicating that the formed cluster structures are still weak and substantially overlapping. In this case, the latent representation contributed to increasing the convergence efficiency from 63 to 47 iterations. The WCSS value also decreased from 3,433,413 to 20,628. However, unlike the two previous indicators, the linear-based DBI and CHI actually obtained better results compared to the initial model, which demonstrates the model's weakness in the context of conventional evaluation. Overall, the TableDC transformation has been shown to improve computational efficiency, but its performance has not fully resolved the issue of overlapping class separation.

Downloads

Download data is not yet available.

References

S. Mukhopadhyay, A. Kumar, D. Parashar, and M. Singh, “Enhanced Music Recommendation Systems: A Comparative Study of Content-Based Filtering and K-Means Clustering Approaches,” Revue d’Intelligence Artificielle, vol. 38, no. 1, pp. 365–376, Feb. 2024, doi: 10.18280/ria.380138.

A. Hamid, S. Abdullah, G. Adi Pradana, and D. Gita Purnama, “K-Means Analysis for Music Segmentation in Playlist Recommendation,” vol. 02, 2025, Accessed: Apr. 06, 2026. [Online]. Available: https://doi.org/10.62201/0cp3r511

R. C. de Araujo, V. M. S. Santos, J. F. L. de Oliveira, and A. M. A. Maciel, “A Hybrid Music Recommendation System Based on K-Means Clustering and Multilayer Perceptron,” in International Conference on Enterprise Information Systems, ICEIS - Proceedings, Science and Technology Publications, Lda, 2025, pp. 335–342. doi: 10.5220/0013436700003929.

F. Y. Arini et al., “Optimizing K-Means Using Greylag Goose Optimization Algorithm for Household Energy Consumption Pattern Segmentation,” ILKOM Jurnal Ilmiah, vol. 17, no. 3, pp. 302–311, 2025, doi: 10.33096/ilkom.v17i3.2851.302-311.

B. Hakim, F. Joanda Kaunang, C. Susanto, J. Salim, and R. Indradjaja, “Implementasi Machine Learning Dalam Pengelompokan Musik Menggunakan Algoritma K-Means Clustering,” 2025. Accessed: Apr. 09, 2026. [Online]. Available: http://jom.fti.budiluhur.ac.id/index.php/IDEALIS/index|

N. Aliya, A. Aini, R. Cinta Endynda, and H. Al Rosyid, “Jurnal Sains dan Teknolog Penerapan Algoritma K-Means untuk Klasterisasi Lagu Terpopuler 2025 Versi Spotify,” Jurnal Sains Dan Teknologi, vol. 02, no. 3, p. 147, 2026, doi: 10.62379/jsit.v2i3.939.

J. Ha Rim, Y. Joo Hun, and H. Jeong Joo Hun Yoo, “Opera Clustering: K-means on librettos datasets,” Journal of Internet Computing and Services, no. 2, pp. 45–52, 2022, doi: 10.7472/jksii.2022.23.2.45.

M. Defferrard, K. Benzi, P. Vandergheynst, and X. Bresson, “FMA: A Dataset For Music Analysis,” Sep. 2017, [Online]. Available: http://arxiv.org/abs/1612.01840

A. Bhaskara and M. Wijewardena, “Distributed Clustering via LSH Based Data Partitioning,” 2018. Accessed: Apr. 06, 2026. [Online]. Available: https://proceedings.mlr.press/v80/bhaskara18a/bhaskara18a.pdf

J. Hedström, S. Mair, and J. Wilzén, “Reducing Carbon Emissions in k-Means Clustering Using Representative Subsets Reducering av koldioxid-utsläpp från k-means med representa-tiva delmängder,” 2025. Accessed: Apr. 09, 2026. [Online]. Available: https://www.diva-portal.org/smash/get/diva2:1975538/FULLTEXT01.pdf

K. Zaman, M. Sah, C. Direkoglu, and M. Unoki, “A Survey of Audio Classification Using Deep Learning,” IEEE Access, vol. 11, pp. 106620–106649, 2023, doi: 10.1109/ACCESS.2023.3318015.

J. Wang et al., “Milvus: A Purpose-Built Vector Data Management System,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, Association for Computing Machinery, 2021, pp. 2614–2627. doi: 10.1145/3448016.3457550.

Z. Cai, L. Fu, and W. Li, “Research and analysis of music development based on k-means and PCA algorithm,” in Journal of Physics: Conference Series, IOP Publishing Ltd, Dec. 2021. doi: 10.1088/1742-6596/2083/3/032044.

L. Qiu, S. Li, and Y. Sung, “3D-DCDAE: Unsupervised music latent representations learning method based on a deep 3d convolutional denoising autoencoder for music genre classification,” Mathematics, vol. 9, no. 18, Sep. 2021, doi: 10.3390/math9182274.

Z. Zhang and J. Chang, “Clustering-based Categorization of Music Users through Unsupervised Learning,” Economics & Management Information, Jun. 2018, doi: 10.58195/emi.2022.1006.

R. Kidanue, “Cornerstone: A Collection of Scholarly Cornerstone: A Collection of Scholarly and Creative Works for Minnesota and Creative Works for Minnesota Machine Learning-Driven Music Genre Recognition Machine Learning-Driven Music Genre Recognition,” 2025. [Online]. Available: https://cornerstone.lib.mnsu.edu/undergrad-theses-capstones-all.https://cornerstone.lib.mnsu.edu/undergrad-theses-capstones-all/8/

M. Ronen, S. E. Finder, and O. Freifeld, “DeepDPM: Deep Clustering With an Unknown Number of Clusters,” 2022. Accessed: Apr. 09, 2026. [Online]. Available: https://openaccess.thecvf.com/content/CVPR2022/papers/Ronen_DeepDPM_Deep_Clustering_With_an_Unknown_Number_of_Clusters_CVPR_2022_paper.pdf

H. T. Rauf, A. Freitas, and N. W. Paton, “TableDC: Deep Clustering for Tabular Data,” Proceedings of the ACM on Management of Data, vol. 3, no. 3, pp. 1–28, Jun. 2025, doi: 10.1145/3725366.

S. B. Rabbani, I. V. Medri, and M. D. Samad, “Deep clustering of tabular data by weighted Gaussian distribution learning,” Neurocomputing, vol. 623, Mar. 2025, doi: 10.1016/j.neucom.2025.129359.

H. T. Rauf, “Deep Learning Architectures for Complex Data Fusion and Integration a Thesis Submitted to The University of Manchester for The Degree of Doctor of Philosophy in The Faculty of Science and Engineering 2026,” 2026. Accessed: Apr. 06, 2026. [Online]. Available: https://pure.manchester.ac.uk/ws/portalfiles/portal/1782068998/FULL_TEXT.PDF

S. Chaudhuri and B. Raj, “Unsupervised Structure Discovery for Semantic Analysis of Audio,” 2012. Accessed: Apr. 06, 2026. [Online]. Available: https://proceedings.neurips.cc/paper_files/paper/2012/file/c6e19e830859f2cb9f7c8f8cacb8d2a6-Paper.pdf

N. Masuyama, Y. Toda, Y. Nojima, and H. Ishibuchi, “An Adaptive Resonance Theory-based Topological Clustering Algorithm with a Self-Adjusting Vigilance Parameter,” Dec. 2025, [Online]. Available: http://arxiv.org/abs/2511.17983

N. Masuyama, T. Takebayashi, Y. Nojima, C. K. Loo, H. Ishibuchi, and S. Wermter, “A parameter-free adaptive resonance theory-based topological clustering algorithm capable of continual learning,” Neural Comput. Appl., vol. 38, no. 7, p. 217, Apr. 2026, doi: 10.1007/s00521-026-11907-5.

P. Li and Z. Fan, “Application of improved K-means algorithm in the cultivation of creative music talents under the needs of sustainable development and transformation,” International Journal of Web Engineering and Technology, vol. 19, no. 1, pp. 4–19, 2024, doi: 10.1504/ijwet.2024.10063583.


Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Peningkatan Kualitas K-Means Clustering Data Audio Musik Menggunakan Transformasi TableDC

Dimensions Badge

ARTICLE HISTORY

Published: 2026-04-30

Abstract View: 17 times
PDF Download: 9 times

How to Cite

Hermawan, M. A., & Arini, F. Y. (2026). Peningkatan Kualitas K-Means Clustering Data Audio Musik Menggunakan Transformasi TableDC. Bulletin of Computer Science Research, 6(3), 908-919. https://doi.org/10.47065/bulletincsr.v6i3.1043

Issue

Section

Articles