Recently, the increased competition in song recognition has led to the necessity to identify songs within very huge databases compared to previous years. Therefore, information retrieval technique requires a more efficient and scalable data storage framework. In this work, we propose an approach exploiting K-means clustering and describe strategies for improving accuracy and speed. In collaboration with an audio expert company providing us with 2.4 billion fingerprints data, we evaluated the performance of the proposed clustering and recognition algorithm.
MongoDB Clustering using K-means for Real-Time Song Recognition
BIN SAHBUDIN, MURTADHA ARIF;Scarpa, Marco;Serrano, Salvatore
2019-01-01
Abstract
Recently, the increased competition in song recognition has led to the necessity to identify songs within very huge databases compared to previous years. Therefore, information retrieval technique requires a more efficient and scalable data storage framework. In this work, we propose an approach exploiting K-means clustering and describe strategies for improving accuracy and speed. In collaboration with an audio expert company providing us with 2.4 billion fingerprints data, we evaluated the performance of the proposed clustering and recognition algorithm.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.