TY - GEN
T1 - A personalized music recommendation system with a time-weighted clustering
AU - Yoon, Taebok
AU - Lee, Seunghoon
AU - Yoon, Kwang Ho
AU - Kim, Dongmoon
AU - Lee, Jee Hyong
PY - 2008
Y1 - 2008
N2 - We propose a music recommendation system which provides personalized services. The system keeps a user's listening list and analyzes it to select pieces of music similar to the user's preference. For analysis, the system extracts properties from the sound wave of music and the time when the user listens to music. Based on the properties, a pieces of music is mapped into a point in the property space and the time is converted into the weight of the point. The more recently the user listens to the music, the more the weight increases. We apply the K-means clustering algorithm to the weighted points. The K-means algorithm is modified so that the number of clusters are dynamically changed. 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 also consider the time when music is released. When recommending, the system selects pieces of music which is close to and released contemporarily with the user's preference. We perform experiments with one hundred pieces of music. In this paper we present and evaluate algorithms to recommend system.
AB - We propose a music recommendation system which provides personalized services. The system keeps a user's listening list and analyzes it to select pieces of music similar to the user's preference. For analysis, the system extracts properties from the sound wave of music and the time when the user listens to music. Based on the properties, a pieces of music is mapped into a point in the property space and the time is converted into the weight of the point. The more recently the user listens to the music, the more the weight increases. We apply the K-means clustering algorithm to the weighted points. The K-means algorithm is modified so that the number of clusters are dynamically changed. 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 also consider the time when music is released. When recommending, the system selects pieces of music which is close to and released contemporarily with the user's preference. We perform experiments with one hundred pieces of music. In this paper we present and evaluate algorithms to recommend system.
KW - Improved K-means algorithm
KW - Music recommendation
KW - Time-weighted clustering
UR - https://www.scopus.com/pages/publications/78650466194
U2 - 10.1109/IS.2008.4670496
DO - 10.1109/IS.2008.4670496
M3 - Conference contribution
AN - SCOPUS:78650466194
SN - 9781424417391
T3 - 2008 4th International IEEE Conference Intelligent Systems, IS 2008
SP - 1048
EP - 1052
BT - 2008 4th International IEEE Conference Intelligent Systems, IS 2008
T2 - 2008 4th International IEEE Conference Intelligent Systems, IS 2008
Y2 - 6 September 2008 through 8 September 2008
ER -