A music recommendation system with a dynamic k-means clustering algorithm
Authors:
- Dongmoon KimDKDongmoon Kim
- Kun-Su KimKKKun-Su Kim
- Kyo-Hyun ParkKPKyo-Hyun Park
- Jee-Hyong LeeJLJee-Hyong Lee
- Keon Myung LeeKLKeon Myung Lee
- 1 December 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 399-403
Abstract
A large number of people download music files easily from Web sites. But rare music sites provide personalized services. So, we suggest a method for personalized services. We extract the properties of music from music's sound wave. We use STFT (shortest time fourier form) to analyze music's property. And we infer users' preferences from users' music list. To analyze users' preferences we propose a dynamic K-means clustering algorithm. The dynamic K-means clustering algorithm clusters the pieces in the music list dynamically adapting the number of clusters. We recommend pieces of music based on the clusters. The previous recommendation systems analyze a user's preference by simply averaging the properties of music in the user's list. So those cannot recommend correctly if a user prefers several genres of music. By using our K-means clustering algorithm, we can recommend pieces of music which are close to user's preference even though he likes several genres. We perform experiments with one hundred pieces of music. In this paper we present and evaluate algorithms to recommend music.Keywords
This publication has 3 references indexed in Scilit:
- Content-based music audio recommendation2005
- Musical genre classification of audio signalsIEEE Transactions on Speech and Audio Processing, 2002
- A music recommendation system based on music data grouping and user interests2001