{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T05:15:13Z","timestamp":1783142113945,"version":"3.54.6"},"reference-count":65,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T00:00:00Z","timestamp":1697587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information Science"],"published-print":{"date-parts":[[2026,2]]},"abstract":"<jats:p>\n                    Personalised news recommendation comprises two crucial components: news understanding and user modelling. Previous studies have attempted to model news understanding and user interests using various internal news information and external knowledge graphs (KG). However, they have overlooked the collaborative function of the external KG and the internal information among diverse news and user behaviours, resulting in serious news cold-start problems and poor interpretability of user interests. To address these issues, this article proposes a novel approach called Relation-Aware Approach based on Multi-view News Network for News Recommendation (MNN4Rec). Specifically, MNN4Rec first constructs a Multi-view News Network (MNN), which includes candidate news and user-clicked news, and represents their exclusive multi-view information as heterogeneous nodes. Furthermore, we develop explicit and implicit news relationships and design a special sampling algorithm to search for news co-neighbours. We then use a novel dual-channel graph attention mechanism to obtain the fine-grained news understanding representation. Moreover, we construct explainable user interests by modelling the interaction of user-clicked news through the multi-headed self-attention mechanism in both semantic and relation levels. Finally, we match candidate news understanding with user interests to generate a prediction score for recommendation. Experimental results on Microsoft\u2019s news data set MIND demonstrate that MNN4Rec outperforms existing news-recommendation methods while also mitigating the cold-start problem and enhancing the interpretability of user interests. Our code is available at\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/JiangHaoPG11\/MNN4Rec_code\">https:\/\/github.com\/JiangHaoPG11\/MNN4Rec_code<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1177\/01655515231182072","type":"journal-article","created":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T07:40:38Z","timestamp":1697614838000},"page":"147-171","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["MNN4Rec: A relation-aware approach based on multi-view news network for news recommendation"],"prefix":"10.1177","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4641-464X","authenticated-orcid":false,"given":"Hao","family":"Jiang","sequence":"first","affiliation":[{"name":"School of Information and Communication Engineering, Communication University of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuanzhen","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, Communication University of China, China"},{"name":"State Key Laboratory of Media Convergence and Communication, Communication University of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juanjuan","family":"Cai","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Media Convergence and Communication, Communication University of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingling","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, Communication University of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2023,10,18]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/1754239.1754257"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124315"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-85820-3_1"},{"key":"e_1_3_3_5_2","article-title":"Empirical analysis of predictive algorithms for collaborative filtering","author":"Breese JS","year":"2013","unstructured":"Breese JS, Heckerman D, Kadie \u0106. Empirical analysis of predictive algorithms for collaborative filtering. arXiv 2013.","journal-title":"arXiv"},{"key":"e_1_3_3_6_2","doi-asserted-by":"crossref","unstructured":"Salakhutdinov R Mnih A. Bayesian probabilistic matrix factorization using Markov chain Monte Carlo. In: Proceedings of the international conference on machine learning pp. 880\u2013887. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/1390156.1390267","DOI":"10.1145\/1390156.1390267"},{"key":"e_1_3_3_7_2","first-page":"7","volume-title":"Proceedings of the KDD-cup and workshop","author":"Bell RM","unstructured":"Bell RM, Koren Y. Improved neighborhood-based collaborative filtering. In: Proceedings of the KDD-cup and workshop, San Jose, CA, 12 August 2007, pp. 7\u201314. New York: Citeseer."},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245124"},{"key":"e_1_3_3_9_2","unstructured":"Basu C Hirsh H Cohen W et al. Recommendation as classification: using social and content-based information in recommendation. In: AAAI\/IAAI pp. 714\u2013720. New York: ACM https:\/\/dl.acm.org\/doi\/10.5555\/295240.295795"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021240730564"},{"key":"e_1_3_3_11_2","doi-asserted-by":"crossref","unstructured":"Ge S Wu C Wu F et al. Graph enhanced representation learning for news recommendation. In: WWW 2020 Taipei 20\u201324 April 2020 pp. 2863\u20132869. New York: ACM.","DOI":"10.1145\/3366423.3380050"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102142"},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","unstructured":"Hu L Xu S Li C et al. Graph neural news recommendation with unsupervised preference disentanglement. In: Proceedings of the 58th annual meeting of the Association for Computational Linguistics pp. 4255\u20134264. New York: ACM https:\/\/aclanthology.org\/2020.acl-main.392\/","DOI":"10.18653\/v1\/2020.acl-main.392"},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","unstructured":"Santosh T Saha A Ganguly N. MVL: multi-view learning for news recommendation. In: SIGIR 2020 pp. 1873\u20131876. New York: ACM https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3397271.3401294","DOI":"10.1145\/3397271.3401294"},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","unstructured":"Wang X He X Cao Y et al. KGAT: knowledge graph attention network for recommendation. In: KDD\u201919 pp. 950\u2013958. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330989","DOI":"10.1145\/3292500.3330989"},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","unstructured":"Wang H Zhang F Xie X et al. DKN: deep knowledge-aware network for news recommendation. In: WWW\u201918 pp. 1835\u20131844. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186175","DOI":"10.1145\/3178876.3186175"},{"key":"e_1_3_3_17_2","doi-asserted-by":"crossref","unstructured":"Liu D Lian J Wang S et al. KRED: knowledge-aware document representation for news recommendations. In: RecSys\u201920 pp. 200\u2013209. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/3383313.3412237","DOI":"10.1145\/3383313.3412237"},{"key":"e_1_3_3_18_2","doi-asserted-by":"crossref","unstructured":"Qi T Wu F Wu C et al. Personalized news recommendation with knowledge-aware interactive matching. In: SIGIR\u201921 pp. 61\u201370. New York: ACM https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3404835.3462861","DOI":"10.1145\/3404835.3462861"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.2308\/accr-50221"},{"key":"e_1_3_3_20_2","first-page":"278","volume-title":"International Conference on Web Information Systems and Technologies","author":"Ozg\u00f6bek O","unstructured":"Ozg\u00f6bek O, Gulla JA, Erdur RC. A survey on challenges and methods in news recommendation. In: International Conference on Web Information Systems and Technologies, Barcelona, Spain, 3\u20135 April 2014, pp. 278\u2013285. Portugal: SCITEPRESS."},{"key":"e_1_3_3_21_2","doi-asserted-by":"crossref","unstructured":"Zheng G Zhang F Zheng Z et al. DRN: a deep reinforcement learning framework for news recommendation. In: WWW\u201918 Lyon 23\u201327 April 2018 pp. 167\u2013176. New York: ACM.","DOI":"10.1145\/3178876.3185994"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/1719970.1719976"},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","unstructured":"Wang W Feng F He X et al. Clicks can be cheating: counterfactual recommendation for mitigating clickbait issue. In: SIGIR\u201921 pp. 1288\u20131297. New York: ACM https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3404835.3462962.","DOI":"10.1145\/3404835.3462962"},{"key":"e_1_3_3_24_2","first-page":"5973","article-title":"DAN: deep attention neural network for news recommendation","volume":"33","author":"Zhu Q","year":"2019","unstructured":"Zhu Q, Zhou X, Song Z, et al. DAN: deep attention neural network for news recommendation. Proc AAAI Conf Artif Intell 2019; 33: 5973\u20135980.","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"e_1_3_3_25_2","doi-asserted-by":"crossref","unstructured":"Wu C Wu F An M et al. NPA: neural news recommendation with personalized attention. In: KDD\u201919 pp. 2576\u20132584. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330665","DOI":"10.1145\/3292500.3330665"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","unstructured":"Wu C Wu F An M et al. Neural news recommendation with attentive multi-view learning. In: IJCAI\u201919 pp. 3863\u20133869. New York: ACM https:\/\/dl.acm.org\/doi\/10.5555\/3367471.3367578","DOI":"10.24963\/ijcai.2019\/536"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3028705"},{"key":"e_1_3_3_28_2","doi-asserted-by":"crossref","unstructured":"Das AS Datar M Garg A et al. Google news personalization: scalable online collaborative filtering. In: WWW\u201907 pp. 271\u2013280. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/1242572.1242610","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_3_3_29_2","doi-asserted-by":"crossref","unstructured":"Resnick P Iacovou N Suchak M et al. Grouplens: an open architecture for collaborative filtering of netnews. In: CSCW\u201994 pp. 175\u2013186. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/192844.192905","DOI":"10.1145\/192844.192905"},{"key":"e_1_3_3_30_2","unstructured":"Gershman A Wolfe T Fink E et al. News personalization using support vector machines 2011 https:\/\/www.cs.cmu.edu\/~anatoleg\/gershman-wolfe-fink-carbonell.pdf"},{"key":"e_1_3_3_31_2","doi-asserted-by":"crossref","unstructured":"Goossen F IJntema W Frasincar F et al. News personalization using the CF-IDF semantic recommender. In: WIMS\u201911 pp. 1\u201312. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/1988688.1988701","DOI":"10.1145\/1988688.1988701"},{"key":"e_1_3_3_32_2","doi-asserted-by":"crossref","unstructured":"Capelle M Frasincar F Moerland M et al. Semantics-based news recommendation. In: WIMS\u201912 pp. 1\u20139. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/2254129.2254163","DOI":"10.1145\/2254129.2254163"},{"key":"e_1_3_3_33_2","doi-asserted-by":"crossref","unstructured":"Li L Wang D Li T et al. Scene: a scalable two-stage personalized news recommendation system. In: SIGIR\u201911 pp. 125\u2013134. https:\/\/dl.acm.org\/doi\/10.1145\/2009916.2009937","DOI":"10.1145\/2009916.2009937"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/COGSCI.2015.7426666"},{"key":"e_1_3_3_35_2","doi-asserted-by":"crossref","unstructured":"Tavakolifard M Gulla JA Almeroth KC et al. Tailored news in the palm of your hand: a multi-perspective transparent approach to news recommendation. In: WWW\u201913 pp. 305\u2013308. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/2487788.2487930","DOI":"10.1145\/2487788.2487930"},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","unstructured":"Ilievski I Roy S. Personalized news recommendation based on implicit feedback. In: Proceedings of the 2013 international news recommender systems workshop and challenge pp. 10\u201315. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/2516641.2516644","DOI":"10.1145\/2516641.2516644"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06028-6_5"},{"key":"e_1_3_3_38_2","first-page":"1853","article-title":"Combining content-based and collaborative filters in an online newspaper","volume":"60","author":"Claypool M","year":"1999","unstructured":"Claypool M, Gokhale A, Miranda T, et al. Combining content-based and collaborative filters in an online newspaper. Proc Recomm Syst Work 1999; 60: 1853\u20131870.","journal-title":"Proc Recomm Syst Work"},{"issue":"18","key":"e_1_3_3_39_2","first-page":"6","article-title":"A personalized online news recommendation system","volume":"57","author":"Saranya K","year":"2012","unstructured":"Saranya K, Sadhasivam GS. A personalized online news recommendation system. Int J Comput Appl 2012; 57(18): 6\u201314.","journal-title":"Int J Comput Appl"},{"key":"e_1_3_3_40_2","unstructured":"Wu C Wu F Ge S et al. Neural news recommendation with multi-head self-attention. In: EMNLP pp. 6389\u20136394. New York: ACM https:\/\/aclanthology.org\/D19-1671\/"},{"key":"e_1_3_3_41_2","doi-asserted-by":"crossref","unstructured":"An M Wu F Wu C et al. Neural news recommendation with long- and short-term user representations. In: ACL pp. 336\u2013345. New York: ACM https:\/\/aclanthology.org\/P19-1033\/","DOI":"10.18653\/v1\/P19-1033"},{"key":"e_1_3_3_42_2","doi-asserted-by":"crossref","unstructured":"Wu C Wu F An M et al. Neural news recommendation with topic-aware news representation. In: ACL pp. 1154\u20131159. New York: ACM https:\/\/aclanthology.org\/P19-1110\/","DOI":"10.18653\/v1\/P19-1110"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1038\/538020a"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"e_1_3_3_45_2","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","volume":"26","author":"Bordes A","year":"2013","unstructured":"Bordes A, Usunier N, Garcia-Duran A, et al. Translating embeddings for modeling multi-relational data. Neur Inf Process Syst 2013; 26: 2787\u20132795.","journal-title":"Neur Inf Process Syst"},{"key":"e_1_3_3_46_2","first-page":"687","article-title":"Knowledge graph embedding via dynamic mapping matrix","volume":"1","author":"Ji G","year":"2015","unstructured":"Ji G, He S, Xu L, et al. Knowledge graph embedding via dynamic mapping matrix. Assoc Comput Linguist 2015; 1: 687\u2013696.","journal-title":"Assoc Comput Linguist"},{"key":"e_1_3_3_47_2","first-page":"2181","article-title":"Learning entity and relation embeddings for knowledge graph completion","volume":"29","author":"Lin Y","year":"2015","unstructured":"Lin Y, Liu Z, Sun M, et al. Learning entity and relation embeddings for knowledge graph completion. Proc AAAI Conf Artif Intell 2015; 29: 2181\u20132187.","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02758-9"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098063"},{"key":"e_1_3_3_51_2","doi-asserted-by":"crossref","unstructured":"Wang H Zhang F Wang J et al. Ripplenet: propagating user preferences on the knowledge graph for recommender systems. In: CIKM\u201918 pp. 417\u2013426. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3271739","DOI":"10.1145\/3269206.3271739"},{"key":"e_1_3_3_52_2","doi-asserted-by":"crossref","unstructured":"Wang H Zhang F Zhang M et al. Knowledge-aware graph neural networks with label smoothness regularization for recommender systems. In: KDD\u201919 pp. 968\u2013977. New York: ACM https:\/\/arxiv.org\/abs\/1905.04413","DOI":"10.1145\/3292500.3330836"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.423"},{"key":"e_1_3_3_54_2","first-page":"1624","article-title":"User-as-graph: user modeling with heterogeneous graph pooling for news recommendation","author":"Wu C","unstructured":"Wu C, Wu F, Huang Y, et al. User-as-graph: user modeling with heterogeneous graph pooling for news recommendation. In: IJCAI, 2021, pp. 1624\u20131630. (Online).","journal-title":"IJCAI"},{"key":"e_1_3_3_55_2","first-page":"1","article-title":"News graph: An enhanced knowledge graph for news recommendation","author":"Liu D","unstructured":"Liu D, Bai T, Lian J, et al. News graph: An enhanced knowledge graph for news recommendation. In: CIKM, Beijing, China, 2019, pp. 1\u20137.","journal-title":"CIKM"},{"key":"e_1_3_3_56_2","doi-asserted-by":"crossref","unstructured":"Lee D Oh B Seo S et al. News recommendation with topic-enriched knowledge graphs. In: CIKM\u201920 pp. 695\u2013704. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3411932","DOI":"10.1145\/3340531.3411932"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/2629489"},{"key":"e_1_3_3_58_2","unstructured":"Vaswani A Shazeer N Parmar N et al. Attention is all you need. In: NIPS\u201917 pp. 5998\u20136008. New York: ACM https:\/\/dl.acm.org\/doi\/10.5555\/3295222.3295349"},{"key":"e_1_3_3_59_2","first-page":"4171","volume-title":"Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","author":"Devlin J","unstructured":"Devlin J, Chang MW, Lee K, et al. Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Minneapolis, Minnesota, June 2019, pp. 4171\u20134186. Association for Computational Linguistics."},{"key":"e_1_3_3_60_2","doi-asserted-by":"crossref","unstructured":"He X Deng K Wang X et al. LightGCN: simplifying and powering graph convolution network for recommendation. In: SIGIR\u201920 pp. 639\u2013648. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/3397271.3401063","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_3_61_2","doi-asserted-by":"crossref","unstructured":"Wu F Qiao Y Chen JH et al. Mind: a large-scale dataset for news recommendation. In: Proceedings of the 58th annual meeting of the Association for Computational Linguistics pp. 3597\u20133606. New York: ACM https:\/\/aclanthology.org\/2020.acl-main.331\/","DOI":"10.18653\/v1\/2020.acl-main.331"},{"key":"e_1_3_3_62_2","article-title":"Adam: a method for stochastic optimization","author":"Kingma DP","year":"2014","unstructured":"Kingma DP, Ba J. Adam: a method for stochastic optimization. arXiv 2014.","journal-title":"arXiv"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"e_1_3_3_64_2","doi-asserted-by":"crossref","unstructured":"Guo H Tang R Ye Y et al. DeepFM: a factorization-machine based neural network for CTR prediction. In: Proceedings of the twenty-sixth international joint conference on artificial intelligence 2017 pp. 1725\u20131731. New York: ACM https:\/\/dl.acm.org\/doi\/10.5555\/3172077.3172127","DOI":"10.24963\/ijcai.2017\/239"},{"key":"e_1_3_3_65_2","doi-asserted-by":"crossref","unstructured":"Cheng HT Koc L Harmsen J et al. Wide & deep learning for recommender systems. In: DLRS 2016 pp. 7\u201310. New York: ACM https:\/\/dl.acm.org\/doi\/10.1145\/2988450.2988454","DOI":"10.1145\/2988450.2988454"},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098108"}],"container-title":["Journal of Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/01655515231182072","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/01655515231182072","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/01655515231182072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T23:10:11Z","timestamp":1777504211000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/01655515231182072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,18]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["10.1177\/01655515231182072"],"URL":"https:\/\/doi.org\/10.1177\/01655515231182072","relation":{},"ISSN":["0165-5515","1741-6485"],"issn-type":[{"value":"0165-5515","type":"print"},{"value":"1741-6485","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,18]]}}}