{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T19:10:13Z","timestamp":1749928213527,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819681693","type":"print"},{"value":"9789819681709","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-8170-9_11","type":"book-chapter","created":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T18:50:11Z","timestamp":1749927011000},"page":"137-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["EquityNet: Unveiling Corporate Equity Relationships in\u00a0Business Conglomerates Using Graph Neural Networks and GDV Features"],"prefix":"10.1007","author":[{"given":"B.","family":"Li","sequence":"first","affiliation":[]},{"given":"Bingce","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Lifeng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Weiping","family":"Li","sequence":"additional","affiliation":[]},{"given":"Tong","family":"Mo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"11_CR1","unstructured":"Brockschmidt, M.: GNN-film: graph neural networks with feature-wise linear modulation. In: ICLR 2020 (2020)"},{"key":"11_CR2","unstructured":"Busbridge, D., Sherburn, D., Cavallo, P., Hammerla, N.Y.: Relational graph attention networks. In: ICLR 2019 (2019)"},{"key":"11_CR3","unstructured":"Chamberlain, B.P., et al.: Graph neural networks for link prediction with subgraph sketching. arXiv arXiv:2302.05432 (2023)"},{"key":"11_CR4","unstructured":"Chen, M., Zhang, Y., Kou, X., Li, Y., Zhang, Y.: r-Gat: relational graph attention network for multi-relational graphs. ArXiv (2021)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.neunet.2022.07.014","volume":"154","author":"G Dai","year":"2022","unstructured":"Dai, G., Wang, X., Zou, X., Liu, C., Cen, S.: Multi-relational graph attention network for knowledge graph completion. Neural Netw. 154, 234\u2013245 (2022)","journal-title":"Neural Netw."},{"key":"11_CR6","unstructured":"Gangemi, A., et al.: Modeling relational data with graph convolutional networks. Semanticscholar (2017)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Gao, H., Wang, Z., Ji, S.: Large-scale learnable graph convolutional networks. In: Proceedings of KDD, pp. 1416\u20131424. ACM (2018)","DOI":"10.1145\/3219819.3219947"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Grassia, M., Mangioni, G.: wsGAT: weighted and signed graph attention networks for link prediction. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds.) Complex Networks and Their Applications X, Studies in Computational Intelligence, vol.\u00a01072, p.\u00a0X. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-93409-5_31","DOI":"10.1007\/978-3-030-93409-5_31"},{"key":"11_CR9","unstructured":"Hamilton, W.L., Ying, R., Leskovec, J.: Inductive representation learning on large graphs. In: NIPS, pp. 1024\u20131034 (2017)"},{"key":"11_CR10","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kose, O.D., Shen, Y.: FairGAT: fairness-aware graph attention networks. Comput. Res. Repository 18(7) (2024)","DOI":"10.1145\/3645096"},{"key":"11_CR12","unstructured":"Liu, X., Chen, J., Wen, Q.: A survey on graph classification and link prediction based on GNN. arXiv arXiv:2303.07293 (2023)"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Jia, M., Van Alboom, M., Goubert, L., Bracke, P., Gabrys, B., Musial, K.: Encoding edge type information in graphlets. PLoS One 17(8), e0273609 (2022). https:\/\/doi.org\/10.1371\/journal.pone.0273609","DOI":"10.1371\/journal.pone.0273609"},{"key":"11_CR14","first-page":"257","volume":"6","author":"T Milenkov\u2019c","year":"2008","unstructured":"Milenkov\u2019c, T., Pr\u017eulj, N.: Uncovering biological network function via graphlet degree signatures. Cancer Inform. 6, 257\u2013273 (2008)","journal-title":"Cancer Inform."},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2009","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Netw. 20(1), 61\u201380 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"140306","DOI":"10.1098\/rsos.140306","volume":"1","author":"O Singh","year":"2014","unstructured":"Singh, O., Sawariya, K., Aparoy, P.: Graphlet signature-based scoring method to estimate protein-ligand binding affinity. Roy. Soc. Open Sci. 1(4), 140306 (2014)","journal-title":"Roy. Soc. Open Sci."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48221-6","volume-title":"Algorithms in Bioinformatics","year":"2015","unstructured":"Pop, M., Touzet, H. (eds.): WABI 2015. LNCS, vol. 9289. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48221-6"},{"key":"11_CR18","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. CoRR arXiv:1803.07293 (2018)"},{"key":"11_CR19","unstructured":"Wang, P., et al.: A fast sampling method of exploring graphlet degrees of large directed and undirected graphs. arXiv preprint arXiv:1604.08691 (2016)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Wang, X., et al.: Heterogeneous graph attention network. CoRR arXiv:1903.07293 (2019)","DOI":"10.1145\/3308558.3313562"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Yu, P.S.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Networks Learn. Syst. 32(1), 4\u201324 (2021)","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"11_CR22","unstructured":"Yao, S., Pi, D., Chen, J., Liu, Y., Wu, Z.: Semi-supervised training for knowledge base graph self-attention networks on link prediction. Comput. Res. Repository arXiv:2209.01350 (2022)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8170-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T18:50:15Z","timestamp":1749927015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8170-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819681693","9789819681709"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8170-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"15 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}