{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:17:58Z","timestamp":1753885078941,"version":"3.41.2"},"reference-count":31,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T00:00:00Z","timestamp":1626739200000},"content-version":"vor","delay-in-days":200,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100020084","name":"Guangzhou Science and Technology Bureau","doi-asserted-by":"crossref","award":["202007040006"],"award-info":[{"award-number":["202007040006"]}],"id":[{"id":"10.13039\/501100020084","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>In the field of information science, how to help users quickly and accurately find the information they need from a tremendous amount of short texts has become an urgent problem. The recommendation model is an important way to find such information. However, existing recommendation models have some limitations in case of short text recommendation. To address these issues, this paper proposes a recommendation model based on semantic features and a knowledge graph. More specifically, we first select DBpedia as a knowledge graph to extend short text features of items and get the semantic features of the items based on the extended text. And then, we calculate the item vector and further obtain the semantic similarity degrees of the users. Finally, based on the semantic features of the items and the semantic similarity of the users, we apply the collaborative filtering technology to calculate prediction rating. A series of experiments are conducted, demonstrating the effectiveness of our model in the evaluation metrics of mean absolute error (MAE) and root mean square error (RMSE) compared with those of some recommendation algorithms. The optimal MAE for the model proposed in this paper is 0.6723, and RMSE is 0.8442. The promising results show that the recommendation effect of the model on the movie field is significantly better than those of these existing algorithms.<\/jats:p>","DOI":"10.1155\/2021\/2382892","type":"journal-article","created":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T23:20:08Z","timestamp":1626823208000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recommendation Model Based on Semantic Features and a Knowledge Graph"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5863-006X","authenticated-orcid":false,"given":"Yudong","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3272-3951","authenticated-orcid":false,"given":"Wen","family":"Chen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245124"},{"key":"e_1_2_10_2_2","doi-asserted-by":"crossref","unstructured":"SandvigJ. MobasherB. andBurkeR. Robustness of collaborative recommendation based on association rule mining Proceedings of the 2007 ACM conference on Recommender systems - RecSys \u203207 2007 Minneapolis MN US 105\u2013112 https:\/\/doi.org\/10.1145\/1297231.1297249 2-s2.0-42149111681.","DOI":"10.1145\/1297231.1297249"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2012.07.021"},{"key":"e_1_2_10_5_2","first-page":"77","article-title":"Collaborative filtering recommendation integrating user-centric natural nearest neighbor","volume":"54","author":"Wang Y.","year":"2018","journal-title":"Computer Engineering and Applications"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.2478\/cait-2013-0043"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2012.02.004"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.02.002"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2163711"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.11.013"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0583-9"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113724"},{"key":"e_1_2_10_13_2","unstructured":"GeorgievK.andNakovP. A non-IID framework for collaborative filtering with restricted Boltzmann machines International conference on machine learning 2013 Atlanta Georgia USA 1148\u20131156."},{"key":"e_1_2_10_14_2","doi-asserted-by":"crossref","unstructured":"WangX.andWangY. Improving content-based and hybrid music recommendation using deep learning Proceedings of the 22nd ACM international conference on Multimedia 2014 San Francisco California USA 627\u2013636 https:\/\/doi.org\/10.1145\/2647868.2654940 2-s2.0-84913528232.","DOI":"10.1145\/2647868.2654940"},{"key":"e_1_2_10_15_2","first-page":"155","article-title":"Content-based personalized recommendation on popular micro-topic","volume":"2","author":"An Y.","year":"2014","journal-title":"Journal of Intelligence"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20161-5_34"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.01.092"},{"volume-title":"Feature Expansion Method for Short Text Classification","year":"2013","author":"Guo Y.","key":"e_1_2_10_18_2"},{"key":"e_1_2_10_19_2","first-page":"31","article-title":"Short-text classification based on HowNet and domain keyword set extension","volume":"31","author":"Xiangdong L.","year":"2015","journal-title":"New Technology of Library and Information Service"},{"key":"e_1_2_10_20_2","first-page":"142","article-title":"Short text classification based on domain word ontology","volume":"36","author":"Ning Y.","year":"2009","journal-title":"Computer Science"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2020-1905"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2009.07.002"},{"volume-title":"Research on Short Text Classification Based on Knowledge Graph and Deep Learning","year":"2020","author":"Li C.","key":"e_1_2_10_23_2"},{"key":"e_1_2_10_24_2","doi-asserted-by":"crossref","unstructured":"MendesP. N. JakobM. Garc\u00eda-SilvaA. andBizerC. DBpedia spotlight: shedding light on the web of documents Proceedings the 7th International Conference on Semantic Systems I-SEMANTICS 2011 2011 Graz Austria 1\u20138.","DOI":"10.1145\/2063518.2063519"},{"key":"e_1_2_10_25_2","first-page":"1044","article-title":"Named entity recognition optimization on DBpedia spotlight","volume":"11","author":"Fu Y.","year":"2017","journal-title":"Journal of Frontiers of Computer Science and Technology"},{"key":"e_1_2_10_26_2","unstructured":"HanX.andSunL. A generative entity-mention model for linking entities with knowledge base Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies-Volume 1 2011 Portland Oregon 945\u2013954."},{"key":"e_1_2_10_27_2","doi-asserted-by":"crossref","unstructured":"FlisarJ.andPodgorelecV. Document enrichment using DBPedia ontology for short text classification Proceedings of the 8th International Conference on Web Intelligence Mining and Semantics 2018 Novi Sad Serbia 1\u20139.","DOI":"10.1145\/3227609.3227649"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-261"},{"key":"e_1_2_10_29_2","unstructured":"MikolovT. ChenK. CorradoG. andDeanJ. Efficient estimation of word representations in vector space 2013 https:\/\/arxiv.org\/abs\/1301.3781."},{"key":"e_1_2_10_30_2","first-page":"214","article-title":"Document vector representation based on Word2Vec","volume":"43","author":"Tang M.","year":"2016","journal-title":"Computer Science"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-019-00981-y"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/2382892.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/2382892.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/2382892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:33:56Z","timestamp":1723030436000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/2382892"}},"subtitle":[],"editor":[{"given":"Zhihan","family":"Lv","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/2382892"],"URL":"https:\/\/doi.org\/10.1155\/2021\/2382892","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"2382892"}}