A new cross-domain recommendation method with cluster effect

doi:10.7523/j.ucas.2023.040

Abstract

Abstract: In recent years, the recommender system has been widely used in online platforms, which can extract useful information from giant volumes of data and recommend suitable items to the user according to user preferences. In this article, we put forward a crossdomain recommendation method based on the rating data of the different projects from similar users, introducing project cluster effect in the target domain of the study, the use of this specific group of singular value decomposition with the method of extracting information associated with a project with similar characteristics. This method could effectively solve the problem of data sparsity. Due to the sparsity of the target domain, most items in the test set of the target domain have few scores, and their information is challenging to obtain from the training set. A strictly related problem is the one of collaborative filtering in recommender systems, where an algorithm tries to extrapolate missing information about the items from the rating activity of the users in order to provide a specific ad-hoc ranking for each user also on the items that have not been rated (on this see discuss how to aggregate the information from multilayer networks, while showing the importance of centrality measures for this issue). MovieLens data analysis indicated that, compared with the existing recommendation methods and cross-domain recommendation methods, the proposed new method of cross-domain recommendation with cluster effect has a significant improvement in the prediction accuracy.

Key words: cross-domain recommendation, singular value decomposition algorithm, cluster effect, data sparsity

CLC Number:

O212.1

ZHAI Haoran, ZHANG Sanguo. A new cross-domain recommendation method with cluster effect[J]. Journal of University of Chinese Academy of Sciences, 2025, 42(2): 153-158.

References

[1] Mazumder R, Hastie T, Tibshirani R. Spectral regularization algorithms for learning large incomplete matrices[J]. The Journal of Machine Learning Research, 2010, 11: 2287-2322.
[2] Bell R M, Koren Y. Scalable collaborative filtering with jointly derived neighborhood interpolation weights[C]//Seventh IEEE International Conference on Data Mining (ICDM 2007). October 28-31, 2007, Omaha, NE, USA. IEEE, 2008: 43-52. DOI: 10.1109/ICDM.2007.90.
[3] Salakhutdinov R, Mnih A, Hinton G. Restricted Boltzmann machines for collaborative filtering[C]//Proceedings of the 24th international conference on Machine learning. June 20-24, 2007, Corvalis, Oregon, USA. New York: ACM, 2007: 791-798. DOI: 10.1145/1273496.1273596.
[4] Blanco-Fernandez Y, Pazos-arias J J, Gil-Solla A, et al. Providing entertainment by content-based filtering and semantic reasoning in intelligent recommender systems[J]. IEEE Transactions on Consumer Electronics, 2008, 54(2): 727-735. DOI: 10.1109/TCE.2008.4560154.
[5] Lops P, de Gemmis M, Semeraro G. Content-based recommender systems: State of the art and trends[M]// Recommender Systems Handbook. Boston, MA: Springer, 2011: 73-105.10.1007/978-0-387-85820-3_3.
[6] Adomavicius G, Tuzhilin A. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions[J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(6): 734-749. DOI: 10.1109/TKDE.2005.99.
[7] Park S T, Pennock D, Madani O, et al. Naïve filterbots for robust cold-start recommendations[C]//Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. August 20-23, 2006, Philadelphia, PA, USA. New York: ACM, 2006: 699-705. DOI: 10.1145/1150402.1150490.
[8] Zhu Y Z, Shen X T, Ye C Q. Personalized prediction and sparsity pursuit in latent factor models[J]. Journal of the American Statistical Association, 2016, 111(513): 241-252. DOI: 10.1080/01621459.2014.999158.
[9] Zhao L L, Pan S J, Xiang E W, et al. Active transfer learning for cross-system recommendation[C]//Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence. July 14-18, 2013, Bellevue, Washington. New York: ACM, 2013: 1205-1211. DOI: 10.5555/2891460.2891628.
[10] Li B, Yang Q, Xue X Y. Can movies and books collaborate?: cross-domain collaborative filtering for sparsity reduction[C]//Proceedings of the 21st International Joint Conference on Artificial Intelligence. July 11-17, 2009, Pasadena, California,.
[11] Ren S T, Gao S, Liao J X, et al. Improving cross-domain recommendation through probabilistic cluster-level latent factor model[C]//Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. January 25-30, 2015, Austin, Texas. New York: ACM, 2015: 4200-4201. DOI: 10.5555/2888116.2888327.
[12] Bi X, Qu A N, Wang J H, et al. A group-specific recommender system[J]. Journal of the American Statistical Association, 2017, 112(519): 1344-1353. DOI: 10.1080/01621459.2016.1219261.
[13] Wang J H. Consistent selection of the number of clusters via crossvalidation[J]. Biometrika, 2010, 97(4): 893-904. DOI: 10.1093/biomet/asq061.
[14] Miller B N, Albert I, Lam S K, et al. MovieLens unplugged: experiences with an occasionally connected recommender system[C]//Proceedings of the 8th international conference on Intelligent user interfaces. January 12-15, 2003, Miami, Florida, USA. New York: ACM, 2003: 263-266. DOI: 10.1145/604045.604094.

[1]	ZHANG Xiaoling, REN Mingyang, ZHANG Sanguo. Robust individualized subgroup analysis [J]. Journal of University of Chinese Academy of Sciences, 2024, 41(2): 151-164.
[2]	ZHANG Jiarui, WU Yaohua. Variable selection method for high-dimensional survival error-in-variable data [J]. Journal of University of Chinese Academy of Sciences, 2023, 40(1): 12-20.
[3]	LIU Yan, LI Shiming, ZHANG Sanguo. Signed-rank-based test for high dimensional mean vector [J]. Journal of University of Chinese Academy of Sciences, 2022, 39(5): 586-592.
[4]	DONG Yulin, GUO Xiao. Breakdown point of penalized logistic regression [J]. , 2020, 37(5): 582-592.
[5]	CHEN Feifei, SUN Zhihua, YE Xue. Statistic inference of additive hazards model when censoring indicators are missing at random [J]. , 2016, 33(4): 443-453.
[6]	CHAO Ting, LI Qizhai, LIU Zhuojun, SUN Cai, SUN Yungang. Diagnosis of threat degree of IP addresses based on the generalized and regularized Mahalanobis distances [J]. , 2015, 32(1): 18-24.
[7]	HUANG Chuan-Ming, ZHANG Xiao-Xu, ZHANG San-Guo. Change point analysis with generalized Lambda distribution based on information criterion [J]. Journal of University of Chinese Academy of Sciences, 2013, 30(6): 728-736.
[8]	QIU Li-Sha, WEI Lai-Sheng. Simultaneous empirical Bayes estimation for mean and error variance in normal distribution [J]. , 2013, 30(4): 454-461.
[9]	LI Xiang, WEI Lai-Sheng. Empirical Bayes estimation for scale parameter on type-Ⅱ censored samples in exponential distribution [J]. , 2011, 28(2): 147-154.
[10]	WANG Peng-Yuan, WEI Lai-Sheng. Small sample properties of a kind of linear estimation in linear regression model [J]. , 2009, 26(3): 296-302.
[11]	Hu Hui-Min, YANG Rong, XU Xing-Zhong. The Generalized p-value of the One-way Layout Analysis of Variance Model [J]. , 2007, 24(4): 408-418.
[12]	LI Hai-Ming. Rice Varietal Improvement and Rice Production in China [J]. , 2007, 24(1): 1-8.
[13]	WEI Li，KONG Sheng-Chun, WEI Lai-Sheng. The Convergence Rates for Empirical Bayes Test of the Parameter in Scale Exponential Family [J]. , 2007, 24(1): 9-17.
[14]	WANG Li-Chun, WEI Lai-Sheng. Empirical Bayes Estimation of Variance Components in Two-Way Classification Random Effects Model [J]. , 2005, 22(5): 545-553.
[15]	WU Huizhen, ZHANG Sanguo. Robust semi-supervised learning model based on model averaging and γ-divergence [J]. Journal of University of Chinese Academy of Sciences, 0, (): 0-.