×

Personalized recommendation via network-based inference with time. (English) Zbl 07526318

Summary: Wide attention has been given to the bipartite network-based recommendation method because of its higher accuracy, better diversity and lower computational cost than the global rank method and the standard collaborative filtering method. However, prior studies on bipartite network treated equally the ratings obtained at different time windows, which clear mismatches with the practical situation because the items collected recently should maintain more significance than those collected long ago. Besides, time impact has not yet been systematically studied as an essential context with the consideration of user preference drift in bipartite network. This paper proposes a personalized recommendation method named network-based inference with time (NBIt). We process time information firstly by mapping the ratings in short-time windows to long-time windows. Then, a suitable time attenuation function is selected to ensure a real reflection of user preference. And then, we set the initial resource and attractive power of network. Finally, the recommendation process is elaborated. To avoid the risk of optimized bias and over-fitting, we employ the triple division technique to optimize the long time window parameter and the attraction power parameter. Experimental results from two benchmark datasets of different scales show that the proposed NBIt algorithm surpasses the other five representative and advanced bipartite network recommendation methods in both accuracy and personalization. Furthermore, the proposed NBIt method can be used as a framework in which other network-based recommendation algorithms along with their variants are run with accuracy and diversity likely to be improved.

MSC:

82-XX Statistical mechanics, structure of matter

Software:

Eigentaste
Full Text: DOI

References:

[1] Maes, P., Agents that reduce work and information overload, Commun. ACM, 37, 30-40 (1994)
[2] Goldberg, D.; Nichols, D.; Oki, B. M., Using collaborative filtering to weave an information tapestry, Commun. ACM, 35, 61-70 (1992)
[3] Herlocker, J.; Konstan, J. A.; Terveen, L. G., Evaluating collaborative filtering recommender systems, ACM Trans. Inf. Syst., 22, 5-53 (2004)
[4] Pazzani, M. J.; Billsus, D., Content-based recommendation systems, Lecture Notes in Comput. Sci., 4321, 325 (2007)
[5] Burke, R., Hybrid recommender systems: Survey and experiments, User Model, User-Adap. Interact., 12, 331-370 (2002) · Zbl 1030.68607
[6] Adomavicius, G.; Tuzhilin, A., Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions, IEEE Trans. Knowl. Data Eng., 17, 734-749 (2005)
[7] Goldberg, K.; Roeder, T.; Gupta, D., Eigentaste: A constant time collaborative filtering algorithm, Inf. Retr., 4, 133-151 (2001) · Zbl 0989.68052
[8] Hofmann, T., Latent semantic models for collaborative filtering, ACM Trans. Inf. Syst., 22, 89-115 (2004)
[9] Blei, D. M.; Ng, A. Y.; Jordan, M. I., Latent Dirichlet allocation, J. Mach. Learn. Res., 3, 993-1022 (2003) · Zbl 1112.68379
[10] Cai, D.; He, X.; Han, J., Graph regularized nonnegative matrix factorization for data representation, IEEE Trans. Pattern Anal. Mach. Intell., 33, 8, 1548-1560 (2011)
[11] Zhao, Z.; Lu, H.; Cai, D., User preference learning for online social recommendation, IEEE Trans. Knowl. Data Eng., 28, 9, 2522-2534 (2016)
[12] Yan, S.; Lin, K.; Zheng, X., An approach for building efficient and accurate social recommender systems using individual relationship networks, IEEE Trans. Knowl. Data Eng., 29, 2086-2099 (2017)
[13] Boccaletti, S.; Latora, V.; Moreno, Y., Complex networks: Structure and dynamics, Phys. Rep., 424, 175-308 (2006) · Zbl 1371.82002
[14] Shi, C.; Li, Y.; Zhang, J., A survey of heterogeneous information network analysis, IEEE Trans. Knowl. Data Eng., 29, 17-37 (2017)
[15] Javari, A.; Gharibshah, J.; Jalili, M., Recommender systems based on collaborative filtering and resource allocation, Soc. Netw. Anal. Min., 4, 234 (2014)
[16] Zhang, Y.-C.; Medo, M.; Ren, J., Recommendation model based on opinion diffusion, Europhys. Lett., 80, 68003 (2007)
[17] Zhang, Y.-C.; Blattner, M.; Yu, Y.-K., Heat conduction process on community networks as a recommendation model, Phys. Rev. Lett., 99, Article 154301 pp. (2007)
[18] Fouss, F.; Pirotte, A.; Renders, J., Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation, IEEE Trans. Knowl. Data Eng., 19, 355-369 (2007)
[19] Zhou, T.; Kuscsik, Z.; Liu, J.-G., Solving the apparent diversity-accuracy dilemma of recommender systems, Proc. Natl. Acad. Sci., 107, 4511-4515 (2010)
[20] Zhou, T.; Ren, J.; Medo, M., Bipartite network projection and personal recommendation, Phys. Rev. E, 76, Article 046115 pp. (2007)
[21] Lü, L.; Liu, W., Information filtering via preferential diffusion, Phys. Rev. E, 83, Article 066119 pp. (2011)
[22] Chen, G.; Gao, T.; Zhu, X., Personalized recommendation based on preferential bidirectional mass diffusion, Phys. A, 469, 397-404 (2017)
[23] Ma, W.; Feng, X.; Wang, S., Personalized recommendation based on heat bidirectional transfer, Phys. A, 444, 713-721 (2016)
[24] Liu, J.-G.; Guo, Q.; Zhang, Y.-C., Information filtering via weighted heat conduction algorithm, Phys. A, 390, 2414-2420 (2011)
[25] Guo, Q.; Leng, R.; Shi, K., Heat conduction information filtering via local information of bipartite networks, Eur. Phys. J. B, 85, 1-8 (2012)
[26] Li, W. J.; Dong, Q.; Shi, Y. B., Effect of recent popularity on heat-conduction based recommendation models, Phys. A, 474, 334-343 (2017)
[27] Zeng, A.; Vidmer, A.; Medo, M., Information filtering by similarity-preferential diffusion processes, Europhys. Lett., 105, 58002 (2014)
[28] Kompan, M., Personalized hybrid recommendation for group of users, Inf. Process. Manage., 52, 459-477 (2016)
[29] Zhou, T.; Jiang, L.-L.; Su, R.-Q., Effect of initial configuration on network-based recommendation, Europhys. Lett., 81, 58004 (2008)
[30] Liu, J.; Shang, M.; Chen, D., Personal recommendation based on weighted bipartite networks, (2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, Vol. 5 (2009), IEEE), 134-137
[31] Liu, R.-R.; Liu, J.-G.; Jia, C.-X., Personal recommendation via unequal resource allocation on bipartite networks, Phys. A, 389, 3282-3289 (2010)
[32] Qiu, T.; Han, T.-Y.; Zhong, L.-X.; Chen, G., Redundant correlation effect on personalized recommendation, Comput. Phys. Comm., 185, 489-494 (2014) · Zbl 1348.35114
[33] Xia, J.; Wu, F.; Xiong, Z., Modeling recommender systems via weighted bipartite network, Concurrency, Comput.: Pract. Exper., 29, Article e3895 pp. (2017)
[34] Liu, J.; Deng, G., Link prediction in a user-object network based on time-weighted resource allocation, Phys. A, 388, 3643-3650 (2009)
[35] Xiang, L.; Yuan, Q.; Zhao, S., Temporal recommendation on graphs via long-and short-term preference fusion, (Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2010), ACM), 723-732
[36] Xiong, L.; Chen, X.; Huang, T. K., Temporal collaborative filtering with bayesian probabilistic tensor factorization, Proc. SIAM Data Min., 2010, 211-222 (2010)
[37] Chen, B.-L.; Li, F.-F.; Zhang, Y.-J., Information filtering in evolving online networks, Phys. Lett. A, 382, 265-271 (2018)
[38] Guo, Q.; Song, W.-J.; Hou, L., Effect of the time window on the heat-conduction information filtering model, Phys. A, 401, 15-21 (2014)
[39] Song, W.-J.; Guo, Q.; Liu, J.-G., Improved hybrid information filtering based on limited time window, Phys. A, 416, 192-197 (2014)
[40] Yu, F.; Zeng, A.; Gillard, S., Network-based recommendation algorithms: A review, Phys. A, 452, 192-208 (2016)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.