{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:13:54Z","timestamp":1725851634175},"reference-count":21,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T00:00:00Z","timestamp":1490054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Natural Science Foundation of Hubei Province, China","award":["2016CKB714"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"In order to alleviate the pressure of information overload and enhance consumer satisfaction, personalization recommendation has become increasingly popular in recent years. As a result, various approaches for recommendation have been proposed in the past few years. However, traditional recommendation methods are still troubled with typical issues such as cold start, sparsity, and low accuracy. To address these problems, this paper proposed an improved recommendation method based on trust relationships in social networks to improve the performance of recommendations. In particular, we define trust relationship afresh and consider several representative factors in the formalization of trust relationships. To verify the proposed approach comprehensively, this paper conducted experiments in three ways. The experimental results show that our proposed approach leads to a substantial increase in prediction accuracy and is very helpful in dealing with cold start and sparsity.<\/jats:p>","DOI":"10.3390\/fi9010009","type":"journal-article","created":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T16:22:22Z","timestamp":1490113342000},"page":"9","source":"Crossref","is-referenced-by-count":11,"title":["Improved Recommendations Based on Trust Relationships in Social Networks"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-5760-7792","authenticated-orcid":false,"given":"Hao","family":"Tian","sequence":"first","affiliation":[{"name":"School of Information Engineering, Hubei University of Economics, No. 8, Yangqiaohu Ave., Jiangxia Dist., Wuhan 430205, China"}]},{"given":"Peifeng","family":"Liang","sequence":"additional","affiliation":[{"name":"Graduate School of Information, Production and Systems, Waseda University, Hibikino 2\u20137, Wakamatsu-ku, Kitakyushu 808-0135, Japan"}]}],"member":"1968","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10458-007-9021-x","article-title":"A model of a trust-based recommendation system on a social network","volume":"16","author":"Walter","year":"2008","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"ref_2","first-page":"17","article-title":"Improved Recommendation System Using Friend Relationship in SNS","volume":"XIX","author":"Liao","year":"2015","journal-title":"Trans. Comput. Collect. Intell."},{"key":"ref_3","first-page":"368","article-title":"Selecting and trust computing for transaction nodes in online social networks","volume":"36","author":"Wang","year":"2013","journal-title":"Jisuanji Xuebao (Chin. J. Comput.)"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"8075","DOI":"10.1016\/j.eswa.2014.07.012","article-title":"Social network-based service recommendation with trust enhancement","volume":"41","author":"Deng","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/TDSC.2012.74","article-title":"Sort: A self-organizing trust model for peer-to-peer systems","volume":"10","author":"Can","year":"2013","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.ins.2016.09.024","article-title":"Improving top-K recommendation with truster and trustee relationship in user trust network","volume":"374","author":"Park","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"15297","DOI":"10.1007\/s11042-014-2384-5","article-title":"Recommendation system for sharing economy based on multidimensional trust model","volume":"75","author":"Kim","year":"2016","journal-title":"Multimed. Tools Appl."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ozsoy, M.G., and Polat, F. (2013, January 25\u201328). Trust based recommendation systems. Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, Niagara Falls, ON, Canada.","DOI":"10.1145\/2492517.2500276"},{"key":"ref_9","unstructured":"Mohsen, J., and Ester, M. (, January June). Trustwalker: A random walk model for combining trust-based and item-based recommendation. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Jamali, M., and Ester, M. (2009, January 22\u201325). Using a trust network to improve top-N recommendation. Proceedings of the Third ACM Conference on Recommender Systems, New York, NY, USA.","DOI":"10.1145\/1639714.1639745"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/978-3-642-35377-2_42","article-title":"Social network analysis applied to recommendation systems: Alleviating the cold-user problem","volume":"7656","author":"Castillejo","year":"2012","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2013.08.034","article-title":"Personalized news recommendation via implicit social experts","volume":"254","author":"Lin","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Krauss, C., and Arbanowski, S. (2014, January 14\u201317). Social preference ontologies for enriching user and item data in recommendation systems. Proceedings of the 14th IEEE International Conference on Data Mining, Shenzhen, China.","DOI":"10.1109\/ICDMW.2014.76"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.eswa.2015.09.012","article-title":"Robustness analysis of arbitrarily distributed data-based recommendation methods","volume":"44","author":"Yilmazel","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"279","DOI":"10.4304\/jmm.7.4.279-288","article-title":"DRTEMBB: Dynamic Recommendation Trust Evaluation Model Based on Bidding","volume":"7","author":"Wang","year":"2012","journal-title":"J. Multimed."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1002\/int.20495","article-title":"A hybrid trust-enhanced collaborative filtering recommendation approach for personalized government-to-business e-services","volume":"26","author":"Shambour","year":"2011","journal-title":"Int. J. Intell. Syst."},{"key":"ref_17","unstructured":"Alejandro, B., and Parapar, J. (2012, January 9\u201313). Using graph partitioning techniques for neighbor selection in user-based collaborative filtering. Proceedings of the Sixth ACM Conference on Recommender Systems, Dublin, Ireland."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1109\/TSC.2014.2320262","article-title":"Reputation measurement and malicious feedback rating prevention in web service recommendation systems","volume":"8","author":"Wang","year":"2015","journal-title":"IEEE Trans. Serv. Comput."},{"key":"ref_19","unstructured":"Tian, H. (2014). Research on User-Centered Web Service Discovery and Its Application in Financial Services, Wuhan University."},{"key":"ref_20","first-page":"28","article-title":"Research on Web service discovery based on user community relations","volume":"36","author":"Tian","year":"2015","journal-title":"J. Commun."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Massa, P., and Avesani, P. (2007, January 19\u201320). Trust-aware recommender systems. Proceedings of the First ACM Conference on Recommender Systems, Minneapolis, MN, USA.","DOI":"10.1145\/1297231.1297235"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/9\/1\/9\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T06:27:09Z","timestamp":1717741629000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/9\/1\/9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,21]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,3]]}},"alternative-id":["fi9010009"],"URL":"https:\/\/doi.org\/10.3390\/fi9010009","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,21]]}}}