Music Recommendation with Collaborative Filtering for Mobile Services

Article Preview

Abstract:

As the development of the mobile communication and the computational capability of the mobile terminals, more users use their mobile devices to play music. In this work, an online music recommendation system is designed for mobile services, which consists of two modules: offline processing and online recommendation. The offline module labels all the music into different categories, by which the music items libraries corresponding to the tags are constructed and the rating matrixs are consequently built. The online module integrates the context information, by which the matched rating matrix is retrieved. By using the collaborative filtering model with matrix completion algorithm, the music recommendations that suit the user and the situation are offered. The proposed recommendation system improves the precision of the recommendation by integration the context information of the users, and augments the online computational capability because the matrix scale is reduced by constructing the rating matrices for the music in the different tag libraries. A large number of experiments demonstrate that the proposed system is designed to be robust and effective to the music recommendation and efficient to the online recommendation for the mobile services.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

510-515

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] J. H. Su, H. H. Yeh, P. S. Yu and V. S. Tseng: Music recommendation using content and context information mining. Intelligent Systems, IEEE, Vol. 25. 1 (2010), pp.16-26.

DOI: 10.1109/mis.2010.23

Google Scholar

[2] M. Böhmer, G. Bauer and A. Krüger: Exploring the design space of context-aware recommender systems that suggest mobile applications. In 2nd Workshop on Context-Aware Recommender Systems (2010).

Google Scholar

[3] W. Woerndl, J. Huebner, R. Bader and D. Gallego-Vico: A model for proactivity in mobile, context-aware recommender systems. Proceedings of the fifth ACM conference on Recommender systems. ACM, 2011, pp.273-276.

DOI: 10.1145/2043932.2043981

Google Scholar

[4] B. Sarwar, G. Karypis, J. Konstan and J. Riedl: Item-based collaborative filtering recommendation algorithms. Proceedings of the 10th international conference on World Wide Web. ACM, 2001, pp.285-295.

DOI: 10.1145/371920.372071

Google Scholar

[5] Y. Koren, R. Bell and C. Volinsky: Matrix factorization techniques for recommender systems. Computer, Vol. 42. 8(2009), pp.30-37.

DOI: 10.1109/mc.2009.263

Google Scholar

[6] E. J. Candès and B. Recht: Exact matrix completion via convex optimization. Foundation of Computational Mathematics, Vol. 9. 6 (2009), pp.717-772.

DOI: 10.1007/s10208-009-9045-5

Google Scholar

[7] B. Recht, M. Fazel and P. A. Parrilo: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM review, Vol. 52. 3, (2010) , pp.471-501.

DOI: 10.1137/070697835

Google Scholar

[8] E. J. Candès, X. Li, Y. Ma and J. Wright: Robust principal component analysis?. Journal of the ACM (JACM), Vol. 58. 3(2011), p.11.

Google Scholar

[9] J. F. Cai, E. J. Candès and Z. Shen: A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, Vol. 20. 4 (2010), p.1956-(1982).

DOI: 10.1137/080738970

Google Scholar

[10] S. Ma, D. Goldfarb and L. Chen: Fixed point and Bregman iterative methods for matrix rank minimization. Mathematical Programming, Vol. 128. 1-2 (2011), pp.321-353.

DOI: 10.1007/s10107-009-0306-5

Google Scholar