{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:13:01Z","timestamp":1753884781593,"version":"3.41.2"},"reference-count":38,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T00:00:00Z","timestamp":1550102400000},"content-version":"vor","delay-in-days":44,"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":["61672284"],"award-info":[{"award-number":["61672284"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20171418"],"award-info":[{"award-number":["BK20171418"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2016M591841"],"award-info":[{"award-number":["2016M591841"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010242","name":"Jiangsu Planned Projects for Postdoctoral Research Funds","doi-asserted-by":"publisher","award":["1601225C"],"award-info":[{"award-number":["1601225C"]}],"id":[{"id":"10.13039\/501100010242","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011665","name":"Deanship of Scientific Research, King Saud University","doi-asserted-by":"publisher","award":["RGP-VPP-264"],"award-info":[{"award-number":["RGP-VPP-264"]}],"id":[{"id":"10.13039\/501100011665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>Sign prediction problem aims to predict the signs of links for signed networks. Currently it has been widely used in a variety of applications. Due to the insufficiency of labeled data, transfer learning has been adopted to leverage the auxiliary data to improve the prediction of signs in target domain. Existing works suffer from two limitations. First, they cannot work if there is no target label available. Second, their generalization performance is not guaranteed due to that fact that the solution of their objective functions is not global optimal solution. To solve these problems, we propose a novel sign prediction on unlabeled social networks using branch and bound optimized transfer learning (SP_BBTL) sign prediction model. The main idea of SP_BBTL is to use target feature vectors to reconstruct source domain feature vectors based on relationship projection, which is a complicated optimal problem and is solved by proposed optimization based on branch and bound that can obtain global optimal solution. With this design, the target domain label information is not required for classifier. Finally, the experimental results on the large scale social signed networks validate the superiority of the proposed model.<\/jats:p>","DOI":"10.1155\/2019\/4906903","type":"journal-article","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T23:32:19Z","timestamp":1550187139000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Sign Prediction on Unlabeled Social Networks Using Branch and Bound Optimized Transfer Learning"],"prefix":"10.1155","volume":"2019","author":[{"given":"Weiwei","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Jiali","family":"Pang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7879-7625","authenticated-orcid":false,"given":"Donghai","family":"Guan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2307-8201","authenticated-orcid":false,"given":"Yuan","family":"Tian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0318-7627","authenticated-orcid":false,"given":"Abdullah","family":"Al-Dhelaan","sequence":"additional","affiliation":[]},{"given":"Mohammed","family":"Al-Dhelaan","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"crossref","unstructured":"G\u00fcndo\u01e7anE.andKayaB. A recommendation method based on link prediction in drug-disease bipartite network Proceedings of the 2nd International Conference on Advanced Information and Communication Technologies AICT 2017 July 2017 Ukraine 125\u2013128 2-s2.0-85030855757.","DOI":"10.1109\/AIACT.2017.8020081"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.05.027"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2016.2634322"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2377154"},{"key":"e_1_2_9_5_2","doi-asserted-by":"crossref","unstructured":"YunfangC. TongliW. andWeiZ. Social link prediction based on the users\u2019 information transfer Asia-Pacific Web Conference 2016 64\u201376 https:\/\/doi.org\/10.1007\/978-3-319-45835-9_6.","DOI":"10.1007\/978-3-319-45835-9_6"},{"key":"e_1_2_9_6_2","article-title":"Link prediction analysis of internet public opinion transfer from the individual perspective","author":"Chen Y.","year":"2016","journal-title":"New Technology of Library Information Service"},{"key":"e_1_2_9_7_2","first-page":"2261","article-title":"Toward deeper understanding of neural networks: The power of initialization and a dual view on expressivity","author":"Daniely A.","year":"2016","journal-title":"Advances In Neural Information Processing Systems"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.3233\/JAD-150988"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2015.11.062"},{"key":"e_1_2_9_10_2","unstructured":"ShiZ. SivaP. andXiangT. Transfer learning by ranking for weakly supervised object annotation 2017 https:\/\/arxiv.org\/abs\/1705.00873."},{"key":"e_1_2_9_11_2","first-page":"524","article-title":"Multi-task learning as multi-objective optimization","author":"Sener O.","year":"2018","journal-title":"in in Neural Information Processing Systems"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2347059"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-013-0693-1"},{"key":"e_1_2_9_14_2","doi-asserted-by":"crossref","unstructured":"YeJ. ChengH. ZhuZ. andChenM. Predicting positive and negative links in signed social networks by transfer learning Proceedings of the 22nd International Conference on World Wide Web May 2013 ACM 1477\u20131488.","DOI":"10.1145\/2488388.2488517"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/7954289"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.21654"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.21634"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3108257"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2746230"},{"key":"e_1_2_9_20_2","unstructured":"LongM. ZhuH. WangJ. andJordanM. I. Deep transfer learning with joint adaptation networks 2016 https:\/\/arxiv.org\/abs\/1605.06636."},{"key":"e_1_2_9_21_2","doi-asserted-by":"crossref","unstructured":"PathakD. AgrawalP. EfrosA. A. andDarrellT. uriosity-driven exploration by self-supervised prediction International Conference on Machine Learning (ICML) 2017 488\u2013489.","DOI":"10.1109\/CVPRW.2017.70"},{"key":"e_1_2_9_22_2","doi-asserted-by":"crossref","unstructured":"KuznietsovY. St\u00fccklerJ. andLeibeB. Semi-supervised deep learning for monocular depth map prediction Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition 2017 6647\u20136655.","DOI":"10.1109\/CVPR.2017.238"},{"key":"e_1_2_9_23_2","doi-asserted-by":"crossref","unstructured":"KunegisJ.andLommatzschA. Learning spectral graph transformations for link prediction Proceedings of the 26th International Conference On Machine Learning ICML 2009 June 2009 Canada 561\u2013568 2-s2.0-71149113555.","DOI":"10.1145\/1553374.1553447"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/117\/38002"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2009.191"},{"key":"e_1_2_9_28_2","doi-asserted-by":"crossref","unstructured":"WangR. UtiyamaM. LiuL. ChenK. andSumitaE. Instance weighting for neural machine translation domain adaptation Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing September 2017 Copenhagen Denmark 1482\u20131488 https:\/\/doi.org\/10.18653\/v1\/D17-1155.","DOI":"10.18653\/v1\/D17-1155"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42706-5_4"},{"key":"e_1_2_9_30_2","doi-asserted-by":"crossref","unstructured":"PengP. XiangT. WangY. PontilM. GongS. HuangT. andTianY. Unsupervised cross-dataset transfer learning for person re-identification Proceedings of the 2016 IEEE Conference on Computer Vision and Pattern Recognition CVPR 2016 July 2016 USA 1306\u20131315 2-s2.0-84986320228.","DOI":"10.1109\/CVPR.2016.146"},{"key":"e_1_2_9_31_2","doi-asserted-by":"crossref","unstructured":"TanB. SongY. ZhongE. andYangQ. Transitive transfer learning Proceedings of the 21st ACM SIGKDD Conference on Knowledge Discovery and Data Mining KDD 2015 August 2015 Australia 1155\u20131164 2-s2.0-84954109618.","DOI":"10.1145\/2783258.2783295"},{"key":"e_1_2_9_32_2","unstructured":"GaninY.andLempitskyV. Unsupervised domain adaptation by backpropagation 2014 https:\/\/arxiv.org\/abs\/1409.7495."},{"key":"e_1_2_9_33_2","doi-asserted-by":"crossref","unstructured":"LeskovecJ. HuttenlocherD. andKleinbergJ. Predicting positive and negative links in online social networks Proceedings of the 19th International World Wide Web Conference (WWW \u203210) April 2010 641\u2013650 https:\/\/doi.org\/10.1145\/1772690.1772756 2-s2.0-77954580498.","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_2_9_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2016.01.005"},{"key":"e_1_2_9_35_2","doi-asserted-by":"crossref","unstructured":"KumarS. SpezzanoF. SubrahmanianV. S. andFaloutsosC. Edge weight prediction in weighted signed networks Proceedings of the 16th IEEE International Conference on Data Mining ICDM 2016 December 2016 Spain 221\u2013230 2-s2.0-85014512081.","DOI":"10.1109\/ICDM.2016.0033"},{"key":"e_1_2_9_36_2","doi-asserted-by":"crossref","unstructured":"RichardsonM. AgrawalR. andDomingosP. Trust management for the semantic web International Semantic Web Conference 2003 351\u2013368.","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"e_1_2_9_37_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_2_9_38_2","article-title":"Negative sign prediction for signed social networks","author":"Yuan W.","year":"2017","journal-title":"Future Generation Computer Systems"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/4906903.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/4906903.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2019\/4906903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:56:19Z","timestamp":1723031779000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2019\/4906903"}},"subtitle":[],"editor":[{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1155\/2019\/4906903"],"URL":"https:\/\/doi.org\/10.1155\/2019\/4906903","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"2018-11-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-01-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-02-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"4906903"}}