{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T16:27:46Z","timestamp":1784046466907,"version":"3.55.0"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"9","license":[{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Institute of Information & Communications Technology Planning & Evaluation (IITP) and Korea government","award":["RS-2020-II201373, No. 2022-0-00352, and No. RS-2022-00155586"],"award-info":[{"award-number":["RS-2020-II201373, No. 2022-0-00352, and No. RS-2022-00155586"]}]},{"name":"Institute of Information & communications Technology Planning & Evaluation","award":["RS-2020-II201336"],"award-info":[{"award-number":["RS-2020-II201336"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,11,30]]},"abstract":"<jats:p>\n            The problem of representing nodes in a signed network as low-dimensional vectors, known as signed network embedding (SNE), has garnered considerable attention in recent years. While several SNE methods based on\n            <jats:italic>graph convolutional networks<\/jats:italic>\n            (GCNs) have been proposed for this problem, we point out that they significantly rely on the assumption that the decades-old\n            <jats:italic>balance theory<\/jats:italic>\n            always holds in the real-world. To address this limitation, we propose a novel GCN-based SNE approach, named as TrustSGCN, which corrects for incorrect embedding propagation in GCN by utilizing the trustworthiness on edge signs for high-order relationships inferred by the balance theory. The proposed approach consists of three modules: (M1) generation of each node\u2019s extended ego-network; (M2) measurement of trustworthiness on edge signs; and (M3) trustworthiness-aware propagation of embeddings. Specifically, TrustSGCN leverages topological information to measure trustworthiness on edge sign for high-order relationships inferred by balance theory. It then considers structural properties inherent to an input network, such as the ratio of triads, to correct for incorrect embedding propagation. Furthermore, TrustSGCN learns the node embeddings by leveraging two well-known social theories, i.e., balance and status, to jointly preserve the edge sign and direction between nodes connected by existing edges in the embedding space. The experiments on six real-world signed network datasets demonstrate that TrustSGCN consistently outperforms six state-of-the-art GCN-based SNE methods. The code is available at\n            <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"url\" xlink:href=\"https:\/\/github.com\/kmj0792\/TrustSGCN\">https:\/\/github.com\/kmj0792\/TrustSGCN<\/jats:ext-link>\n            .\n          <\/jats:p>","DOI":"10.1145\/3685279","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T18:28:41Z","timestamp":1722968921000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Trustworthiness-Driven Graph Convolutional Networks for Signed Network Embedding"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1993-8931","authenticated-orcid":false,"given":"Min-Jeong","family":"Kim","sequence":"first","affiliation":[{"name":"Hanyang University, Seoul, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8769-0678","authenticated-orcid":false,"given":"Yeon-Chang","family":"Lee","sequence":"additional","affiliation":[{"name":"Ulsan National Institute of Science and Technology (UNIST), Ulsan, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5892-2265","authenticated-orcid":false,"given":"David Y.","family":"Kang","sequence":"additional","affiliation":[{"name":"Chungbuk National University, Cheongju, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6345-9084","authenticated-orcid":false,"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,10,14]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.3390\/app112411879"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10548-8"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651529"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-023-10662-6"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2023.3327810"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339726"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357977"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1037\/h0046049"},{"key":"e_1_3_3_10_2","unstructured":"Jie Chen Tengfei Ma and Cao Xiao. 2018. FastGCN: Fast learning with graph convolutional networks via importance sampling. arXiv:1801.10247."},{"key":"e_1_3_3_11_2","first-page":"773","volume-title":"Proceedings of the International Conference on Information and Knowledge Management (CIKM \u201918)","author":"Chen Yiqi","year":"2018","unstructured":"Yiqi Chen, Tieyun Qian, Huan Liu, and Ke Sun. 2018. \u201cBridge\u201d: Enhanced signed directed network embedding. In Proceedings of the International Conference on Information and Knowledge Management (CIKM \u201918), 773\u2013782."},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/CIC.2018.00-42"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00113"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.21307\/joss-2019-012"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.04.019"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313715"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25919"},{"key":"e_1_3_3_18_2","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the Advances in Neural Information Processing Systems 30 (2017), 1025\u20131035.","journal-title":"Proceedings of the Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1080\/00223980.1946.9917275"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3345312"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30493-5_53"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i1.16093"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498454"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02363-w"},{"key":"e_1_3_3_26_2","first-page":"349","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE \u201916)","author":"Hwang Won-Seok","year":"2016","unstructured":"Won-Seok Hwang, Juan Parc, Sang-Wook Kim, Jongwuk Lee, and Dongwon Lee. 2016. \u201dTold you i didn\u2019t like it\u201d: Exploiting uninteresting items for effective collaborative filtering. In Proceedings of the IEEE International Conference on Data Engineering (ICDE \u201916), 349\u2013360."},{"key":"e_1_3_3_27_2","first-page":"451","article-title":"Mining frequent subgraphs in multigraphs","author":"Ingalalli Vijay","year":"2018","unstructured":"Vijay Ingalalli, Dino Ienco, and Pascal Poncelet. 2018. Mining frequent subgraphs in multigraphs. Information Sciences 451\u2013452 (2018), 50\u201366.","journal-title":"Information Sciences"},{"key":"e_1_3_3_28_2","first-page":"11","article-title":"A framework for accurate community detection on signed networks using adversarial learning","volume":"35","author":"Kang David Y.","year":"2022","unstructured":"David Y. Kang, Woncheol Lee, Yeon-Chang Lee, Kyungsik Han, and Sang-Wook Kim. 2022. A framework for accurate community detection on signed networks using adversarial learning. IEEE Transactions on Knowledge and Data Engineering 35, 11 (2022), 10937\u201310951.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00137"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186117"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3592075"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28704"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599401"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3616855.3635817"},{"key":"e_1_3_3_35_2","volume-title":"International Conference on Learning Representations (ICLR \u201917)","author":"Kipf Thomas N.","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations (ICLR \u201917)."},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583300"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462923"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401079"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11707"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00127"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3345251"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.11096"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5911"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531917"},{"key":"e_1_3_3_48_2","first-page":"2014","volume-title":"Proceedings of the International Conference on Machine Learning (ICML \u201916)","volume":"48","author":"Niepert Mathias","year":"2016","unstructured":"Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov. 2016. Learning convolutional neural networks for graphs. In Proceedings of the International Conference on Machine Learning (ICML \u201916), Vol. 48, 2014\u20132023."},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651549"},{"key":"e_1_3_3_50_2","volume-title":"Proceedings of the International Conference on Machine Learning (ICML \u201920)","author":"Rossi Emanuele","year":"2020","unstructured":"Emanuele Rossi, Ben Chamberlain, Fabrizio Frasca, Davide Eynard, Federico Monti, and Michael Bronstein. 2020. Temporal graph networks for deep learning on dynamic graphs. In Proceedings of the International Conference on Machine Learning (ICML \u201920)."},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615032"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482478"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570407"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2882971"},{"issue":"3","key":"e_1_3_3_55_2","first-page":"42:1","article-title":"A survey of signed network mining in social media","volume":"49","author":"Tang Jiliang","year":"2016","unstructured":"Jiliang Tang, Yi Chang, Charu C. Aggarwal, and Huan Liu. 2016. A survey of signed network mining in social media. ACM Computing Surveys 49, 3 (2016), 42:1\u201342:37.","journal-title":"ACM Computing Surveys"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.3115\/1610075.1610122"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3079628.3079685"},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159666"},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.37"},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.37"},{"key":"e_1_3_3_61_2","volume-title":"Proceedings of the International Conference on Learning Representations (ICLR \u201921)","author":"Wang Yanbang","year":"2021","unstructured":"Yanbang Wang, Yen-Yu Chang, Yunyu Liu, Jure Leskovec, and Pan Li. 2021. Inductive representation learning in temporal networks via causal anonymous walks. In Proceedings of the International Conference on Learning Representations (ICLR \u201921)."},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512171"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498470"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57529-2_15"},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103570"},{"issue":"4","key":"e_1_3_3_66_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3639408","article-title":"Bayesian graph local extrema convolution with long-tail strategy for misinformation detection","volume":"18","author":"Zhang Guixian","year":"2024","unstructured":"Guixian Zhang, Shichao Zhang, and Guan Yuan. 2024. Bayesian graph local extrema convolution with long-tail strategy for misinformation detection. ACM Transactions on Knowledge Discovery from Data 18, 4 (2024), 1\u201321.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_3_67_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2024.3369017"},{"issue":"3","key":"e_1_3_3_68_2","first-page":"2711","article-title":"KNN classification with one-step computation","volume":"35","author":"Zhang Shichao","year":"2021","unstructured":"Shichao Zhang and Jiaye Li. 2021. KNN classification with one-step computation. IEEE Transactions on Knowledge and Data Engineering 35, 3 (2021), 2711\u20132723.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"7","key":"e_1_3_3_69_2","first-page":"7382","article-title":"Reachable distance function for KNN classification","volume":"35","author":"Zhang Shichao","year":"2022","unstructured":"Shichao Zhang, Jiaye Li, and Yangding Li. 2022. Reachable distance function for KNN classification. IEEE Transactions on Knowledge and Data Engineering 35, 7 (2022), 7382\u20137396.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_3_70_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.06.082"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3685279","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3685279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:18Z","timestamp":1750291578000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3685279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,14]]},"references-count":69,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,11,30]]}},"alternative-id":["10.1145\/3685279"],"URL":"https:\/\/doi.org\/10.1145\/3685279","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,14]]},"assertion":[{"value":"2024-01-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}