{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:05:41Z","timestamp":1768712741887,"version":"3.49.0"},"reference-count":41,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2015,4,10]],"date-time":"2015-04-10T00:00:00Z","timestamp":1428624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61100094"],"award-info":[{"award-number":["61100094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272383"],"award-info":[{"award-number":["61272383"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61300114"],"award-info":[{"award-number":["61300114"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2013M530156"],"award-info":[{"award-number":["2013M530156"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In some online social network services (SNSs), the members are allowed to label their relationships with others, and such relationships can be represented as the links with signed values (positive or negative). The networks containing such relations are named signed social networks (SSNs), and some real-world complex systems can be also modeled with SSNs. Given the information of the observed structure of an SSN, the link prediction aims to estimate the values of the unobserved links. Noticing that most of the previous approaches for link prediction are based on the members\u2019 similarity and the supervised learning method, however, research work on the investigation of the hidden principles that drive the behaviors of social members are rarely conducted. In this paper, the deep belief network (DBN)-based approaches for link prediction are proposed. Including an unsupervised link prediction model, a feature representation method and a DBN-based link prediction method are introduced. The experiments are done on the datasets from three SNSs (social networking services) in different domains, and the results show that our methods can predict the values of the links with high performance and have a good generalization ability across these datasets.<\/jats:p>","DOI":"10.3390\/e17042140","type":"journal-article","created":{"date-parts":[[2015,4,10]],"date-time":"2015-04-10T17:06:18Z","timestamp":1428685578000},"page":"2140-2169","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Deep Belief Network-Based Approaches for Link Prediction in Signed Social Networks"],"prefix":"10.3390","volume":"17","author":[{"given":"Feng","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology, No.92 West Da Zhi Street, Harbin, 150001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingquan","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology, No.92 West Da Zhi Street, Harbin, 150001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9081-1410","authenticated-orcid":false,"given":"Chengjie","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology, No.92 West Da Zhi Street, Harbin, 150001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology, No.92 West Da Zhi Street, Harbin, 150001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology, No.92 West Da Zhi Street, Harbin, 150001, China"},{"name":"Harbin Institute of Technology Shenzhen Graduate School, HIT, HIT Campus of University Town of Shenzhen, Shenzhen, 518055, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2015,4,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/TKDE.2007.1061","article-title":"Community mining from signed social networks","volume":"19","author":"Yang","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1117454.1117456","article-title":"Link mining: A survey","volume":"7","author":"Getoor","year":"2005","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: A survey","volume":"390","author":"Zhou","year":"2011","journal-title":"Physica A"},{"key":"ref_4","unstructured":"Taskar, B., Wong, M.-F., Abbeel, P., and Koller, D. Available online: http:\/\/ai.stanford.edu\/~koller\/Papers\/Taskar+al:NIPS03b.pdf."},{"key":"ref_5","unstructured":"Popescul, A., and Ungar, L.H. (2003, January 11). Statistical relational learning for link prediction, Acapulco, Mexico."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., and Kleinberg, J. (2010, January 26\u201330). Predicting positive and negative links in online social networks, Raleigh, NC, USA.","DOI":"10.1145\/1772690.1772756"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Liu, F., Liu, B., Wang, X., Liu, M., and Wang, B. (2012, January 14\u201317). Features for link prediction in social networks: A comprehensive study, Seoul, Korea.","DOI":"10.1109\/ICSMC.2012.6377983"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.socnet.2008.08.001","article-title":"Partitioning signed social networks","volume":"31","author":"Doreian","year":"2009","journal-title":"Soc. Netw."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., and Kleinberg, J. (2010, January 10\u201315). Signed networks in social media, Atlanta, GA, USA.","DOI":"10.1145\/1753326.1753532"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"20953","DOI":"10.1073\/pnas.1109521108","article-title":"Computing global structural balance in large-scale signed social networks","volume":"108","author":"Facchetti","year":"2011","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Davis, J.A. (1967). Clustering and structural balance in graphs. Hum. Relat.","DOI":"10.1177\/001872676702000206"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.tics.2007.09.004","article-title":"Learning multiple layers of representation","volume":"11","author":"Hinton","year":"2007","journal-title":"Trends Cogn. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000006","article-title":"Learning deep architectures for AI","volume":"2","author":"Bengio","year":"2009","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"ref_14","unstructured":"Hinton, G.E., Krizhevsky, A., and Wang, S.D. (2011). Artificial Neural Networks and Machine Learning\u2013ICANN 2011, Springer."},{"key":"ref_15","unstructured":"Krizhevsky, A., and Hinton, G.E. Available online: www.cs.toronto.edu\/~fritz\/absps\/esann-deep-final.pdf."},{"key":"ref_16","first-page":"1235","article-title":"Energy-based models for sparse overcomplete representations","volume":"4","author":"Teh","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref_17","unstructured":"Hinton, G.E. Available online: www.cs.toronto.edu\/~hinton\/absps\/guideTR.pdf."},{"key":"ref_18","unstructured":"Liu, F., Liu, B., Sun, C., Liu, M., and Wang, X. (2013). Neural Information Processing, Springer."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Kleinberg","year":"2007","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"ref_20","unstructured":"Al Hasan, M., Chaoji, V., Salem, S., and Zaki, M. (2006, January 22). Link prediction using supervised learning, Bethesda, MD, USA."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Guha, R., Kumar, R., Raghavan, P., and Tomkins, A. (2004). Propagation of trust and distrust, ACM.","DOI":"10.1145\/988672.988727"},{"key":"ref_22","unstructured":"Massa, P., and Avesani, P. (2005, January 9\u201313). Controversial users demand local trust metrics: An experimental study on epinions. com community, Pittsburgh, PA, USA."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Burke, M., and Kraut, R. (2008, January 8\u201312). Mopping up: modeling wikipedia promotion decisions, San Diego, CA, USA.","DOI":"10.1145\/1460563.1460571"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Kunegis, J., Lommatzsch, A., and Bauckhage, C. (2009, January 20\u201324). The slashdot zoo: Mining a social network with negative edges, Madrid, Spain.","DOI":"10.1145\/1526709.1526809"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Brzozowski, M.J., Hogg, T., and Szabo, G. (2008, January 5\u201310). Friends and foes: ideological social networking, Florence, Italy.","DOI":"10.1145\/1357054.1357183"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s11280-013-0228-2","article-title":"Transitive node similarity: Predicting and recommending links in signed social networks","volume":"17","author":"Symeonidis","year":"2014","journal-title":"World Wide Web."},{"key":"ref_27","unstructured":"Bengio, Y., and Courville, A. (2013). Handbook on Neural Information Processing., Springer."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1126\/science.1127647","article-title":"Reducing the dimensionality of data with neural networks","volume":"313","author":"Hinton","year":"2006","journal-title":"Science"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1162\/neco.2006.18.7.1527","article-title":"A fast learning algorithm for deep belief nets","volume":"18","author":"Hinton","year":"2006","journal-title":"Neural Comput."},{"key":"ref_30","first-page":"153","article-title":"Greedy layer-wise training of deep networks","volume":"19","author":"Bengio","year":"2007","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref_31","first-page":"1137","article-title":"A Neural Probabilistic Language Model","volume":"3","author":"Bengio","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/j.ijar.2008.11.006","article-title":"Semantic hashing","volume":"50","author":"Salakhutdinov","year":"2009","journal-title":"Int. J. Approx. Reason."},{"key":"ref_33","unstructured":"Wang, B., Wang, X., Sun, C., Liu, B., and Sun, L. (2010, January 11\u201316). Modeling semantic relevance for question-answer pairs in web social communities, Uppsala University, Uppsala, Sweden."},{"key":"ref_34","first-page":"21","article-title":"Deep learning approaches to semantic relevance modeling for Chinese question-answer pairs","volume":"10","author":"Wang","year":"2011","journal-title":"ACM Trans. Asian. Lang. Inf. Process. (TALIP)"},{"key":"ref_35","unstructured":"Huang, E.H., Socher, R., Manning, C.D., and Ng, A.Y. (2012, January 8\u201314). Improving word representations via global context and multiple word prototypes, Jeju, Korea."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1771","DOI":"10.1162\/089976602760128018","article-title":"Training products of experts by minimizing contrastive divergence","volume":"14","author":"Hinton","year":"2002","journal-title":"Neural Comput."},{"key":"ref_37","first-page":"17","article-title":"On contrastive divergence learning","volume":"2005","author":"Hinton","year":"2005","journal-title":"Artif. Intell. Stat."},{"key":"ref_38","unstructured":"Available online: http:\/\/www.esrl.noaa.gov\/psd\/people\/jeffrey.s.whitaker\/."},{"key":"ref_39","first-page":"743","article-title":"PyBrain","volume":"11","author":"Schaul","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Nowak, S., Lukashevich, H., Dunker, P., and R\u00fcger, S. (2010, January 29\u201331). Performance measures for multi-label evaluation: a case study in the area of image classification, Philadelphia, PA, USA.","DOI":"10.1145\/1743384.1743398"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","article-title":"An introduction to ROC analysis","volume":"27","author":"Fawcett","year":"2006","journal-title":"Pattern Recognit. Lett."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/4\/2140\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:44:35Z","timestamp":1760215475000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/4\/2140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,10]]},"references-count":41,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,4]]}},"alternative-id":["e17042140"],"URL":"https:\/\/doi.org\/10.3390\/e17042140","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,10]]}}}