{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:39:16Z","timestamp":1772163556446,"version":"3.50.1"},"reference-count":26,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"content-version":"vor","delay-in-days":63,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772124"],"award-info":[{"award-number":["61772124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Heterogeneous information networks can naturally simulate complex objects, and they can enrich recommendation systems according to the connections between different types of objects. At present, a large number of recommendation algorithms based on heterogeneous information networks have been proposed. However, the existing algorithms cannot extract and combine the structural features in heterogeneous information networks. Therefore, this paper proposes an efficient recommendation algorithm based on heterogeneous information network, which uses the characteristics of graph convolution neural network to automatically learn node information to extract heterogeneous information and avoid errors caused by the manual search for metapaths. Furthermore, by fully considering the scoring relationship between nodes, a calculation strategy combining heterogeneous information and a scoring information fusion strategy is proposed to solve the scoring between nodes, which makes the prediction scoring more accurate. Finally, by updating the nodes, the training scale is reduced, and the calculation efficiency is improved. The study conducted a large number of experiments on three real data sets with millions of edges. The results of the experiments show that compared with PMF, SemRec, and other algorithms, the proposed algorithm improves the recommendation accuracy MAE by approximately 3% and the RMSE by approximately 8% and reduces the time consumption significantly.<\/jats:p>","DOI":"10.1155\/2021\/6689323","type":"journal-article","created":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T19:20:07Z","timestamp":1614972007000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An Efficient Recommendation Algorithm Based on Heterogeneous Information Network"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6798-9293","authenticated-orcid":false,"given":"Ying","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanning","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1161\/CIRCULATIONAHA.106.174477"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5205-8"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2013.2297920"},{"key":"e_1_2_10_4_2","doi-asserted-by":"crossref","unstructured":"FengW.andWangJ. Incorporating heterogeneous information for personalized tag recommendation in social tagging systems Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2012 London UK ACM 1276\u20131284.","DOI":"10.1145\/2339530.2339729"},{"key":"e_1_2_10_5_2","doi-asserted-by":"crossref","unstructured":"YuX. RenX. SunY.et al. Recommendation in heterogeneous information networks with implicit user feedback Proceedings of the 7th ACM Conference on Recommender Systems 2013 New York NY USA ACM 347\u2013350.","DOI":"10.1145\/2507157.2507230"},{"key":"e_1_2_10_6_2","unstructured":"YuX. RenX. GuQ.et al. Collaborative filtering with entity similarity regularization in heterogeneous information networks Proceedings of the IJCAI HINA 2013 Beijing China."},{"key":"e_1_2_10_7_2","doi-asserted-by":"crossref","unstructured":"YuX. RenX. SunY.et al. Personalized entity recommendation: a heterogeneous information network approach Proceedings of the 7th ACM International Conference on Web Search and Data Mining 2014 New York NY USA ACM 283\u2013292.","DOI":"10.1145\/2556195.2556259"},{"key":"e_1_2_10_8_2","doi-asserted-by":"crossref","unstructured":"LuoC. PangW. WangZ.et al. Hete-CF: social-based collaborative filtering recommendation using heterogeneous relations Proceedings of the IEEE International Conference on Data Mining 2014 Shenzhen China IEEE 917\u2013922.","DOI":"10.1109\/ICDM.2014.64"},{"key":"e_1_2_10_9_2","doi-asserted-by":"crossref","unstructured":"ShiC. ZhangZ. LuoP.et al. Semantic path based personalized recommendation on weighted heterogeneous information networks Proceedings of the 24th ACM International on Conference on Information and Knowledge Management 2015 Melbourne Australia ACM 453\u2013462.","DOI":"10.1145\/2806416.2806528"},{"key":"e_1_2_10_10_2","unstructured":"KipfT. N.andWellingM. Semi-supervised classification with graph convolutional networks 2016 https:\/\/arxiv.org\/abs\/1609.02907."},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2879658"},{"key":"e_1_2_10_12_2","doi-asserted-by":"crossref","unstructured":"LumbantoruanR. ZhouX. RenY. andChenL. I-CARS: an interactive context-aware recommender system Proceedings of the 2019 IEEE International Conference on Data Mining (ICDM) 2019 Beijing China 1240\u20131245.","DOI":"10.1109\/ICDM.2019.00154"},{"key":"e_1_2_10_13_2","doi-asserted-by":"crossref","unstructured":"ZhangL. ZhouR. JiangH. WangH. andZhangY. Item group recommendation: a method based on game theory Proceedings of the 26th International Conference on World Wide Web Companion 2017 Perth Australia 1405\u20131411.","DOI":"10.1145\/3041021.3051149"},{"key":"e_1_2_10_14_2","doi-asserted-by":"crossref","unstructured":"KorenY. Factorization meets the neighborhood: a multifaceted collaborative filtering model Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2008 Las Vegas NV USA ACM 426\u2013434.","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_2_10_15_2","first-page":"134","volume-title":"Singular Value Decomposition and Least Squares Solutions","author":"Golub G. H.","year":"1971"},{"key":"e_1_2_10_16_2","unstructured":"PaterekA. Improving regularized singular value decomposition for collaborative filtering in Proceedings of the KDD Cup and Workshop 2007 2007 San Jose CA USA 5\u20138."},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/tac.1980.1102314"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/bf00332918"},{"key":"e_1_2_10_19_2","unstructured":"SalakhutdinovR. R.andMnihA. Probabilistic matrix factorization Proceedings of the 2007 Conference Advances in Neural Information Processing Systems 2007 Cambridge UK 1256\u20131264."},{"key":"e_1_2_10_20_2","doi-asserted-by":"crossref","unstructured":"MaH. ZhouD. LiuC.et al. Recommender systems with social regularization Proceedings of the Fourth ACM International Conference on Web Search and Data Mining 2011 Hong Kong ACM 287\u2013296.","DOI":"10.1145\/1935826.1935877"},{"key":"e_1_2_10_21_2","unstructured":"LippertC. WeberS. H. HuangY.et al. Relation prediction in multi-relational domains using matrix factorization Proceedings of the NIPS 2008 Workshop: Structured Input-Structured Output 2008 Vancouver Canada."},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0553-6"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-016-0031-0"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2833443"},{"key":"e_1_2_10_25_2","unstructured":"HamiltonW. YingZ. andLeskovecJ. Inductive representation learning on large graphs 2017 https:\/\/arxiv.org\/abs\/1706.02216."},{"key":"e_1_2_10_26_2","unstructured":"ChenJ. MaT. andXiaoC. FastGCN: fast learning with graph convolutional networks via importance sampling 2018 https:\/\/arxiv.org\/abs\/1801.10247."}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6689323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6689323.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6689323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:29:53Z","timestamp":1723242593000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6689323"}},"subtitle":[],"editor":[{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6689323"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6689323","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-12-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6689323"}}