{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:31:49Z","timestamp":1768109509961,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T00:00:00Z","timestamp":1622764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T00:00:00Z","timestamp":1622764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11280-021-00900-8","type":"journal-article","created":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T14:02:55Z","timestamp":1622815375000},"page":"609-629","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Powerful graph of graphs neural network for structured entity analysis"],"prefix":"10.1007","volume":"25","author":[{"given":"Hanchen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Defu","family":"Lian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanqi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,4]]},"reference":[{"key":"900_CR1","doi-asserted-by":"crossref","unstructured":"Borgwardt, K.M., Ong, C.S., Sch\u00f6nauer, S., Vishwanathan, S.V.N., Smola, A.J., Kriegel, H.: Protein function prediction via graph kernels. In: Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 25-29 June 2005, pp 47\u201356, Detroit, MI USA (2005)","DOI":"10.1093\/bioinformatics\/bti1007"},{"issue":"4","key":"900_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01305232","volume":"12","author":"JY Cai","year":"1992","unstructured":"Cai, J.Y., F\u00fcrer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12(4), 389\u2013410 (1992)","journal-title":"Combinatorica"},{"key":"900_CR3","doi-asserted-by":"crossref","unstructured":"Chu, X., Lin, Y., Wang, Y., Wang, L., Wang, J., Gao, J.: Mlrda: a multi-task semi-supervised learning framework for drug-drug interaction prediction. In: IJCAI (2019)","DOI":"10.24963\/ijcai.2019\/628"},{"key":"900_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03518-5","volume-title":"Networks of Networks: the Last Frontier of Complexity, vol. 340","author":"G D\u2019Agostino","year":"2014","unstructured":"D\u2019Agostino, G., Scala, A.: Networks of Networks: the Last Frontier of Complexity, vol. 340. Springer, New York (2014)"},{"issue":"2","key":"900_CR5","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1021\/jm00106a046","volume":"34","author":"AK Debnath","year":"1991","unstructured":"Debnath, A.K., Lopez de Compadre, R.L., Debnath, G., Shusterman, A.J., Hansch, C.: Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity. J. Med. Chem. 34(2), 786\u2013797 (1991)","journal-title":"J. Med. Chem."},{"key":"900_CR6","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv:1810.04805 (2018)"},{"issue":"4","key":"900_CR7","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/S0022-2836(03)00628-4","volume":"330","author":"PD Dobson","year":"2003","unstructured":"Dobson, P.D., Doig, A.J.: Distinguishing enzyme structures from non-enzymes without alignments. J. Mol. Biol. 330(4), 771\u2013783 (2003)","journal-title":"J. Mol. Biol."},{"issue":"5","key":"900_CR8","doi-asserted-by":"publisher","first-page":"052804","DOI":"10.1103\/PhysRevE.87.052804","volume":"87","author":"G Dong","year":"2013","unstructured":"Dong, G., Gao, J., Du, R., Tian, L., Stanley, H.E., Havlin, S.: Robustness of network of networks under targeted attack. Phys. Rev. E 87(5), 052804 (2013)","journal-title":"Phys. Rev. E"},{"key":"900_CR9","unstructured":"Errica, F., Podda, M., Bacciu, D., Micheli, A.: A fair comparison of graph neural networks for graph classification. arXiv:1912.09893 (2019)"},{"key":"900_CR10","unstructured":"Fey, M., Lenssen, J.E., Morris, C., Masci, J., Kriege, N.M.: Deep graph matching consensus. In: International Conference on Learning Representations (2019)"},{"key":"900_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/9781139028868","volume-title":"Descriptive complexity, canonisation, and definable graph structure theory, vol. 47","author":"M Grohe","year":"2017","unstructured":"Grohe, M.: Descriptive complexity, canonisation, and definable graph structure theory, vol. 47. Cambridge University Press, Cambridge (2017)"},{"key":"900_CR12","doi-asserted-by":"crossref","unstructured":"Grohe, M., Otto, M.: Pebble games and linear equations. J. Symb. Log. pp. 797\u2013844 (2015)","DOI":"10.1017\/jsl.2015.28"},{"key":"900_CR13","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NIPS, pp 1024\u20131034 (2017)"},{"key":"900_CR14","doi-asserted-by":"crossref","unstructured":"Hao, Y., Cao, X., Fang, Y., Xie, X., Wang, S.: Inductive link prediction for nodes having only attribute information. arXiv:2007.08053 (2020)","DOI":"10.24963\/ijcai.2020\/168"},{"key":"900_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-020-3378-0","volume":"21","author":"S Harada","year":"2020","unstructured":"Harada, S., Akita, H., Tsubaki, M., Baba, Y., Takigawa, I., Yamanishi, Y., Kashima, H.: Dual graph convolutional neural network for predicting chemical networks. BMC Bioinformatics 21, 1\u201313 (2020)","journal-title":"BMC Bioinformatics"},{"key":"900_CR16","unstructured":"Kersting, K., Kriege, N.M., Morris, C., Mutzel, P., Neumann, M.: Benchmark data sets for graph kernels. http:\/\/graphkernels.cs.tu-dortmund.de (2016)"},{"key":"900_CR17","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR, p 2017 (2017)"},{"key":"900_CR18","doi-asserted-by":"crossref","unstructured":"Kwon, S., Yoon, S.: Deepcci: End-to-end deep learning for chemical-chemical interaction prediction. In: Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, pp 203\u2013212 (2017)","DOI":"10.1145\/3107411.3107451"},{"key":"900_CR19","first-page":"1","volume":"1","author":"G Landrum","year":"2013","unstructured":"Landrum, G.: Rdkit documentation. Release 1, 1\u201379 (2013)","journal-title":"Release"},{"key":"900_CR20","unstructured":"Lee, J., Lee, I., Kang, J.: Self-attention graph pooling. arXiv:1904.08082 (2019)"},{"key":"900_CR21","doi-asserted-by":"crossref","unstructured":"Lee, J.B., Rossi, R., Kong, X.: Graph classification using structural attention. In: SIGKDD, pp 1666\u20131674. ACM (2018)","DOI":"10.1145\/3219819.3219980"},{"key":"900_CR22","unstructured":"Li, J., Rong, Y., Cheng, H., Meng, H., Huang, W., Huang, J.: Semi-supervised graph classification: A hierarchical graph perspective. In: Liu, L., White, R.W., Mantrach, A., Silvestri, F., McAuley, J.J., Baeza-Yates, R., Zia, L. (eds.) The World Wide Web Conference, WWW 2019, May 13-17, 2019, pp 972\u2013982. ACM, San Francisco, CA, USA (2019)"},{"key":"900_CR23","unstructured":"Li, Y., Gu, C., Dullien, T., Vinyals, O., Kohli, P.: Graph matching networks for learning the similarity of graph structured objects. arXiv:1904.12787 (2019)"},{"key":"900_CR24","doi-asserted-by":"crossref","unstructured":"Lian, D., Liu, Q., Chen, E.: Personalized ranking with importance sampling. In: WWW, vol. 2020, pp 1093\u20131103 (2020)","DOI":"10.1145\/3366423.3380187"},{"key":"900_CR25","doi-asserted-by":"publisher","unstructured":"Lian, D., Wang, H., Liu, Z., Lian, J., Chen, E., Xie, X.: Lightrec: A memory and search-efficient recommender system. In: WWW, vol. 2020, pp 695\u2013705 (2020). https:\/\/doi.org\/10.1145\/3366423.3380151","DOI":"10.1145\/3366423.3380151"},{"key":"900_CR26","unstructured":"Liao, R., Li, Y., Song, Y., Wang, S., Hamilton, W., Duvenaud, D.K., Urtasun, R., Zemel, R.: Efficient graph generation with graph recurrent attention networks. In: Advances in Neural Information Processing Systems, pp 4255\u20134265 (2019)"},{"key":"900_CR27","doi-asserted-by":"crossref","unstructured":"Liu, Z., Chen, C., Li, L., Zhou, J., Li, X., Song, L., Qi, Y.: Geniepath: Graph neural networks with adaptive receptive paths. In: AAAI, vol. 33, pp 4424\u20134431 (2019)","DOI":"10.1609\/aaai.v33i01.33014424"},{"key":"900_CR28","unstructured":"Maron, H., Ben-Hamu, H., Serviansky, H., Lipman, Y.: Provably powerful graph networks. In: Wallach, H.M., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E.B., Garnett R. (eds.) Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14 December 2019, pp 2153\u20132164, Vancouver, BC, Canada (2019)"},{"key":"900_CR29","doi-asserted-by":"crossref","unstructured":"Menche, J., Sharma, A., Kitsak, M., Ghiassian, S.D., Vidal, M., Loscalzo, J., Barab\u00e1si, A. L.: Uncovering disease-disease relationships through the incomplete interactome. Science 347(6224) (2015)","DOI":"10.1126\/science.1257601"},{"key":"900_CR30","unstructured":"Meng, L., Zhang, J.: Isonn: Isomorphic neural network for graph representation learning and classification. arXiv:1907.09495 (2019)"},{"key":"900_CR31","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, pp 3111\u20133119 (2013)"},{"key":"900_CR32","unstructured":"Nguyen, T.D., Phung, D, et al: Unsupervised universal self-attention network for graph classification (2019)"},{"key":"900_CR33","doi-asserted-by":"crossref","unstructured":"Ni, J., Tong, H., Fan, W., Zhang, X.: Inside the atoms: ranking on a network of networks. In: SIGKDD, pp 1356\u20131365 (2014)","DOI":"10.1145\/2623330.2623643"},{"key":"900_CR34","doi-asserted-by":"crossref","unstructured":"Rome, E., Langeslag, P., Usov, A.: Federated modelling and simulation for critical infrastructure protection. In: Networks of Networks: The Last Frontier of Complexity, pp 225\u2013253. Springer (2014)","DOI":"10.1007\/978-3-319-03518-5_11"},{"issue":"18","key":"900_CR35","doi-asserted-by":"publisher","first-page":"E4304","DOI":"10.1073\/pnas.1803294115","volume":"115","author":"JY Ryu","year":"2018","unstructured":"Ryu, J.Y., Kim, H.U., Lee, S.Y.: Deep learning improves prediction of drug\u2013drug and drug\u2013food interactions. Proc. Natl. Acad. Sci. 115(18), E4304\u2013E4311 (2018)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"900_CR36","doi-asserted-by":"crossref","unstructured":"Schlichtkrull, M., Kipf, T.N., Bloem, P., Van Den Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: European Semantic Web Conference, pp 593\u2013607. Springer (2018)","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"900_CR37","doi-asserted-by":"crossref","unstructured":"Shi, H., Fan, H., Kwok, J.T.: Effective decoding in graph auto-encoder using triadic closure. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp 906\u2013913 (2020)","DOI":"10.1609\/aaai.v34i01.5437"},{"key":"900_CR38","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv:1710.10903 (2017)"},{"key":"900_CR39","doi-asserted-by":"crossref","unstructured":"Wang, H., Lian, D., Zhang, Y., Qin, L., He, X., Lin, Y., Lin, X.: Binarized graph neural network. World Wide Web, pp. 1\u201324 (2021)","DOI":"10.1007\/s11280-021-00878-3"},{"key":"900_CR40","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"},{"issue":"2","key":"900_CR41","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1021\/ci00062a008","volume":"29","author":"D Weininger","year":"1989","unstructured":"Weininger, D., Weininger, A., Weininger, J.L.: Smiles. 2. algorithm for generation of unique smiles notation. J. Chem. Inf. Comput. Sci. 29(2), 97\u2013101 (1989)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"900_CR42","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks?. In: 7th International Conference on Learning Representations, ICLR 2019, May 6-9, 2019. OpenReview.net, New Orleans, LA, USA (2019)"},{"key":"900_CR43","doi-asserted-by":"crossref","unstructured":"Xu, N., Wang, P., Chen, L., Tao, J., Zhao, J.: Mr-gnn: Multi-resolution and dual graph neural network for predicting structured entity interactions. arXiv:1905.09558 (2019)","DOI":"10.24963\/ijcai.2019\/551"},{"key":"900_CR44","unstructured":"Yang, C., Zhuang, P., Shi, W., Luu, A., Li, P.: Conditional structure generation through graph variational generative adversarial nets. In: Advances in Neural Information Processing Systems, pp 1340\u20131351 (2019)"},{"key":"900_CR45","unstructured":"You, J., Liu, B., Ying, Z., Pande, V., Leskovec, J.: Graph convolutional policy network for goal-directed molecular graph generation. In: Advances in neural information processing systems, pp 6410\u20136421 (2018)"},{"key":"900_CR46","unstructured":"Zhang, M., Chen, Y.: Link prediction based on graph neural networks. In: NIPS, pp 5165\u20135175 (2018)"},{"key":"900_CR47","doi-asserted-by":"crossref","unstructured":"Zhang, M., Cui, Z., Neumann, M., Chen, Y.: An end-to-end deep learning architecture for graph classification. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"900_CR48","unstructured":"Zhang, Z., Bu, J., Ester, M., Zhang, J., Yao, C., Yu, Z., Wang, C.: Hierarchical graph pooling with structure learning. arXiv:1911.05954(2019)"},{"issue":"13","key":"900_CR49","doi-asserted-by":"publisher","first-page":"i457","DOI":"10.1093\/bioinformatics\/bty294","volume":"34","author":"M Zitnik","year":"2018","unstructured":"Zitnik, M., Agrawal, M., Leskovec, J.: Modeling polypharmacy side effects with graph convolutional networks. Bioinformatics 34(13), i457\u2013i466 (2018)","journal-title":"Bioinformatics"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00900-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00900-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00900-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T22:17:17Z","timestamp":1672352237000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00900-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,4]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["900"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00900-8","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,4]]},"assertion":[{"value":"26 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}