{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:09:06Z","timestamp":1740103746047,"version":"3.37.3"},"reference-count":19,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T00:00:00Z","timestamp":1578787200000},"content-version":"unspecified","delay-in-days":0,"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":["71471106"],"award-info":[{"award-number":["71471106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,1,12]]},"abstract":"The sentiments among social individuals are complexity and diversity, and the relationships between them include being friendly and hostile. The positive (\u201cfriendly\u201d ,\u201clike\u201d or \u201ctrust\u201d) or negative (\u201chostile\u201d, \u201cdislike\u201d or \u201cdistrust\u201d) sentiments in the relations can be modeled as signed connections or links. The missing relations or sentiments between individuals are always worthy of speculation. The sign predication on links has been significant applications in a variety of online settings, such as online recommendation system and abnormal user detections. A novel sign prediction method called the S<\/mml:mi>P<\/mml:mi>R<\/mml:mi><\/mml:mrow><\/mml:math> model is measured by the values of the two indexes, one is similarity; the other is preference-reputation (PR). The similarity of a pair nodes is defined by the statistical properties of local structures. The definition of similarity agrees with the theory of social balance because existing connections reflect the tendency of the new links emergence between individuals. And PR value is to measure the positive or negative tendency of edges without sign. The experiments on real big social data proved the feasibility and efficiency of the S<\/mml:mi>P<\/mml:mi>R<\/mml:mi><\/mml:mrow><\/mml:math> model: Comparing with some popular predication methods, the S<\/mml:mi>P<\/mml:mi>R<\/mml:mi><\/mml:mrow><\/mml:math> model in this issue shows lower complexity and higher accuracy. Experimental results also prove that the S<\/mml:mi>P<\/mml:mi>R<\/mml:mi><\/mml:mrow><\/mml:math> model provide insight and foresight of the mechanism driving the sign formation of links.<\/jats:p>","DOI":"10.1155\/2020\/4353567","type":"journal-article","created":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T18:30:20Z","timestamp":1578853820000},"page":"1-11","source":"Crossref","is-referenced-by-count":2,"title":["Sign Prediction on Social Networks Based Nodal Features"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8220-4968","authenticated-orcid":true,"given":"Xiaoyu","family":"Zhu","sequence":"first","affiliation":[{"name":"Business School, Shandong Normal University, Jinan, Shandong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1703-3330","authenticated-orcid":true,"given":"Yinghong","family":"Ma","sequence":"additional","affiliation":[{"name":"Business School, Shandong Normal University, Jinan, Shandong, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1177\/0894439313511934"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/s10796-017-9760-4"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/2934681"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2015.08.005"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.08.037"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2009.12.004"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.04.061"},{"key":"15","first-page":"1177","volume":"15","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0228-2"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.08.135"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-015-0288-7"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-014-0172-x"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-016-0401-6"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1145\/2668107"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.12.069"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/4353567.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/4353567.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/4353567.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T18:30:22Z","timestamp":1578853822000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/4353567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,12]]},"references-count":19,"alternative-id":["4353567","4353567"],"URL":"https:\/\/doi.org\/10.1155\/2020\/4353567","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,1,12]]}}}