{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T13:26:33Z","timestamp":1750339593766,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001773","name":"University of New South Wales","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001773","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>As a fundamental data structure, graphs are ubiquitous in various applications. Among all types of graphs, signed bipartite graphs contain complex structures with positive and negative links as well as bipartite settings, on which conventional graph analysis algorithms are no longer applicable. Previous works mainly focus on unipartite signed graphs or unsigned bipartite graphs separately. Several models are proposed for applications on the signed bipartite graphs by utilizing the heuristic structural information. However, these methods have limited capability to fully capture the information hidden in such graphs. In this paper, we propose the first graph neural network on signed bipartite graphs, namely Polarity-based Graph Convolutional Network (PbGCN), for sign prediction task with the help of balance theory. We introduce the novel polarity attribute to signed bipartite graphs, based on which we construct one-mode projection graphs to allow the GNNs to aggregate information between the same type nodes. Extensive experiments on five datasets demonstrate the effectiveness of our proposed techniques.<\/jats:p>","DOI":"10.1007\/s11280-022-01015-4","type":"journal-article","created":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T16:02:31Z","timestamp":1645027351000},"page":"471-487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Polarity-based graph neural network for sign prediction in signed bipartite graphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Xianhang","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3158-9586","authenticated-orcid":false,"given":"Hanchen","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianke","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,16]]},"reference":[{"key":"1015_CR1","doi-asserted-by":"crossref","unstructured":"Akoglu, L.: Quantifying political polarity based on bipartite opinion networks. In: Proceedings of the International AAAI Conference on Web and Social Media (2014)","DOI":"10.1609\/icwsm.v8i1.14524"},{"issue":"4","key":"1015_CR2","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/comnet\/cnx001","volume":"5","author":"SG Aksoy","year":"2017","unstructured":"Aksoy, S.G., Kolda, T.G., Pinar, A.: Measuring and modeling bipartite graphs with community structure. Journal of Complex Networks 5(4), 581\u2013603 (2017)","journal-title":"Journal of Complex Networks"},{"key":"1015_CR3","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Sarkar, K., Gokalp, S., Sen, A., Davulcu, H.: Partitioning signed bipartite graphs for classification of individuals and organizations. In: SBP, pp. 196\u2013204. Springer (2012)","DOI":"10.1007\/978-3-642-29047-3_24"},{"key":"1015_CR4","doi-asserted-by":"crossref","unstructured":"Chen, C., Wu, Y., Sun, R., Wang, X.: Maximum signed $$\\theta$$-clique identification in large signed graphs. TKDE (2021)","DOI":"10.1109\/TKDE.2021.3098423"},{"key":"1015_CR5","doi-asserted-by":"crossref","unstructured":"Chen, C., Zhu, Q., Wu, Y., Sun, R., Wang, X., Liu, X.: Efficient critical relationships identification in bipartite networks. World Wide Web (2021)","DOI":"10.1007\/s11280-021-00914-2"},{"key":"1015_CR6","doi-asserted-by":"crossref","unstructured":"Derr, T., Johnson, C., Chang, Y., Tang, J.: Balance in signed bipartite networks. In: CIKM, pp. 1221\u20131230. ACM (2019)","DOI":"10.1145\/3357384.3358009"},{"key":"1015_CR7","doi-asserted-by":"crossref","unstructured":"Derr, T., Ma, Y., Tang, J.: Signed graph convolutional networks. In: ICDM, pp. 929\u2013934. IEEE (2018)","DOI":"10.1109\/ICDM.2018.00113"},{"key":"1015_CR8","doi-asserted-by":"crossref","unstructured":"Derr, T., Tang, J.: Congressional vote analysis using signed networks. In: ICDM workshop, pp. 1501\u20131502. IEEE (2018)","DOI":"10.1109\/ICDMW.2018.00218"},{"key":"1015_CR9","doi-asserted-by":"crossref","unstructured":"Gao, J., Lyu, T., Xiong, F., Wang, J., Ke, W., Li, Z.: Mgnn: A multimodal graph neural network for predicting the survival of cancer patients. In: SIGIR, pp. 1697\u20131700 (2020)","DOI":"10.1145\/3397271.3401214"},{"key":"1015_CR10","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: SIGKDD, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"1015_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.physa.2018.05.048","volume":"507","author":"K Gu","year":"2018","unstructured":"Gu, K., Fan, Y., Zeng, A., Zhou, J., Di, Z.: Analysis on large-scale rating systems based on the signed network. Physica A: Statistical Mechanics and its Applications 507, 99\u2013109 (2018)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"1015_CR12","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NIPS, pp. 1024\u20131034 (2017)"},{"key":"1015_CR13","unstructured":"Hu, J., Zheng, W.X.: Bipartite consensus for multi-agent systems on directed signed networks. In: 52nd IEEE Conference on Decision and Control, pp. 3451\u20133456. IEEE (2013)"},{"key":"1015_CR14","doi-asserted-by":"crossref","unstructured":"Javari, A., Derr, T., Esmailian, P., Tang, J., Chang, K.C.C.: Rose: Role-based signed network embedding. In: WWW, pp. 2782\u20132788 (2020)","DOI":"10.1145\/3366423.3380038"},{"key":"1015_CR15","doi-asserted-by":"crossref","unstructured":"Kim, J., Park, H., Lee, J.E., Kang, U.: Side: representation learning in signed directed networks. In: WWW, pp. 509\u2013518 (2018)","DOI":"10.1145\/3178876.3186117"},{"key":"1015_CR16","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR 2017 (2017)"},{"key":"1015_CR17","doi-asserted-by":"crossref","unstructured":"Lee, Y.C., Son, J., Kim, T., Park, D., Kim, S.W.: Exploiting uninteresting items for effective graph-based one-class collaborative filtering. The Journal of Supercomputing, 1\u201320 (2021)","DOI":"10.1007\/s11227-020-03573-8"},{"key":"1015_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: WWW, pp. 641\u2013650 (2010)","DOI":"10.1145\/1772690.1772756"},{"key":"1015_CR19","doi-asserted-by":"crossref","unstructured":"Li, C., Jia, K., Shen, D., Shi, C.J.R., Yang, H.: Hierarchical representation learning for bipartite graphs. In: IJCAI, pp. 2873\u20132879 (2019)","DOI":"10.24963\/ijcai.2019\/398"},{"key":"1015_CR20","doi-asserted-by":"crossref","unstructured":"Li, Y., Tian, Y., Zhang, J., Chang, Y.: Learning signed network embedding via graph attention. In: AAAI, pp. 4772\u20134779 (2020)","DOI":"10.1609\/aaai.v34i04.5911"},{"key":"1015_CR21","doi-asserted-by":"crossref","unstructured":"Li, Z., Shen, X., Jiao, Y., Pan, X., Zou, P., Meng, X., Yao, C., Bu, J.: Hierarchical bipartite graph neural networks: Towards large-scale e-commerce applications. In: ICDE, pp. 1677\u20131688. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00149"},{"issue":"5","key":"1015_CR22","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/MIC.2014.82","volume":"18","author":"A Papaoikonomou","year":"2014","unstructured":"Papaoikonomou, A., Kardara, M., Tserpes, K., Varvarigou, D.: Edge sign prediction in social networks via frequent subgraph discovery. IEEE Internet Computing 18(5), 36\u201343 (2014)","journal-title":"IEEE Internet Computing"},{"key":"1015_CR23","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: Online learning of social representations. In: SIGKDD, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"1015_CR24","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.physa.2016.04.025","volume":"458","author":"B Shams","year":"2016","unstructured":"Shams, B., Haratizadeh, S.: Sibrank: Signed bipartite network analysis for neighbor-based collaborative ranking. Physica A: Statistical Mechanics and its Applications 458, 364\u2013377 (2016)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"1015_CR25","doi-asserted-by":"crossref","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, Y., Wang, X.: Stable community detection in signed social networks. TKDE (2020)","DOI":"10.1109\/TKDE.2020.3047224"},{"key":"1015_CR26","doi-asserted-by":"crossref","unstructured":"Sun, R., Zhu, Q., Chen, C., Wang, X., Zhang, Y., Wang, X.: Discovering cliques in signed networks based on balance theory. In: DASFAA, pp. 666\u2013674 (2020)","DOI":"10.1007\/978-3-030-59416-9_43"},{"key":"1015_CR27","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv:1710.10903 (2017)"},{"key":"1015_CR28","doi-asserted-by":"crossref","unstructured":"Wang, H., Lian, D., Liu, W., Wen, D., Chen, C., Wang, X.: Powerful graph of graphs neural network for structured entity analysis. World Wide Web, 1\u201321 (2021)","DOI":"10.1007\/s11280-021-00900-8"},{"issue":"3","key":"1015_CR29","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s11280-021-00878-3","volume":"24","author":"H Wang","year":"2021","unstructured":"Wang, H., Lian, D., Zhang, Y., Qin, L., He, X., Lin, Y., Lin, X.: Binarized graph neural network. World Wide Web 24(3), 825\u2013848 (2021)","journal-title":"World Wide Web"},{"key":"1015_CR30","doi-asserted-by":"crossref","unstructured":"Wang, H., Lian, D., Zhang, Y., Qin, L., Lin, X.: Gognn: Graph of graphs neural network for predicting structured entity interactions. arXiv:2005.05537 (2020)","DOI":"10.24963\/ijcai.2020\/183"},{"key":"1015_CR31","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. PVLDB (2019)","DOI":"10.14778\/3339490.3339497"},{"issue":"3","key":"1015_CR32","first-page":"599","volume":"29","author":"X Wang","year":"2017","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geo-social networks. TKDE 29(3), 599\u2013612 (2017)","journal-title":"TKDE"},{"issue":"2","key":"1015_CR33","first-page":"243","volume":"29","author":"X Wang","year":"2017","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X., Chen, C.: Bring order into the samples: A novel scalable method for influence maximization. TKDE 29(2), 243\u2013256 (2017)","journal-title":"TKDE"},{"key":"1015_CR34","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhou, M., Arnold, C.: Toward heterogeneous information fusion: bipartite graph convolutional networks for in silico drug repurposing. Bioinformatics 36(Supplement_1), i525\u2013i533 (2020)","DOI":"10.1093\/bioinformatics\/btaa437"},{"issue":"1","key":"1015_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-019-3325-0","volume":"21","author":"F Yang","year":"2020","unstructured":"Yang, F., Fan, K., Song, D., Lin, H.: Graph-based prediction of protein-protein interactions with attributed signed graph embedding. BMC bioinformatics 21(1), 1\u201316 (2020)","journal-title":"BMC bioinformatics"},{"key":"1015_CR36","doi-asserted-by":"crossref","unstructured":"Yang, P., Wang, H., Zhang, Y., Qin, L., Zhang, W., Lin, X.: T3s: Effective representation learning for trajectory similarity computation. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 2183\u20132188. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00221"},{"key":"1015_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, T., Jiang, H., Bao, Z., Zhang, Y.: Characterization and edge sign prediction in signed networks. Journal of Industrial and Intelligent Information 1(1), 19\u201324\u00a0(2013)","DOI":"10.12720\/jiii.1.1.19-24"},{"key":"1015_CR38","doi-asserted-by":"crossref","unstructured":"Zhou, T., Ren, J., Medo, M., Zhang, Y.C.: Bipartite network projection and personal recommendation. Physical Review E 76(4), 046115 (2007)","DOI":"10.1103\/PhysRevE.76.046115"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-022-01015-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-022-01015-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-022-01015-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T04:05:42Z","timestamp":1674792342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-022-01015-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,16]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1015"],"URL":"https:\/\/doi.org\/10.1007\/s11280-022-01015-4","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2022,2,16]]},"assertion":[{"value":"5 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no confilicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}