{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T06:14:11Z","timestamp":1682403251326},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:00:00Z","timestamp":1566604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:00:00Z","timestamp":1566604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s41109-019-0174-8","type":"journal-article","created":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T10:02:31Z","timestamp":1566640951000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sequence-to-sequence modeling for graph representation learning"],"prefix":"10.1007","volume":"4","author":[{"given":"Aynaz","family":"Taheri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Gimpel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanya","family":"Berger-Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"key":"174_CR1","doi-asserted-by":"crossref","unstructured":"Adhikari, B, Zhang Y, Ramakrishnan N, Prakash BA (2017) Distributed representations of subgraphs In: DaMNet.","DOI":"10.1109\/ICDMW.2017.20"},{"key":"174_CR2","doi-asserted-by":"crossref","unstructured":"Akoglu, L, McGlohon M, Faloutsos C (2010) Oddball: Spotting anomalies in weighted graphs In: PAKDD.","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"174_CR3","unstructured":"Bengio, S, Vinyals O, Jaitly N, Shazeer N (2015) Scheduled sampling for sequence prediction with recurrent neural networks In: NIPS."},{"key":"174_CR4","unstructured":"Berlingerio, M, Koutra D, Eliassi-Rad T, Faloutsos C (2012) NetSimile: a scalable approach to size-independent network similarity. arXiv."},{"key":"174_CR5","unstructured":"Borgwardt, KM, Kriegel H-P (2005) Shortest-path kernels on graphs In: ICDM."},{"key":"174_CR6","doi-asserted-by":"crossref","unstructured":"Borgwardt, K, Ong C, Sch\u00f6nauer S, Vishwanathan S, Smola A, Kriegel H (2005) Protein function prediction via graph kernels. Bioinformatics 21.","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"174_CR7","unstructured":"Bruna, J, Zaremba W, Szlam A, LeCun Y (2013) Spectral networks and locally connected networks on graphs. CoRR."},{"key":"174_CR8","unstructured":"Bunke, H (2000) Graph matching: Theoretical foundations, algorithms, and applications In: Vision Interface."},{"key":"174_CR9","doi-asserted-by":"crossref","unstructured":"Chang, C-C, Lin C-J (2011) Libsvm: a library for support vector machines. ACM TIST 2.","DOI":"10.1145\/1961189.1961199"},{"key":"174_CR10","unstructured":"Chen, J, Xu X, Wu Y, Zheng H (2018) Gc-lstm: Graph convolution embedded lstm for dynamic link prediction. arXiv preprint arXiv:1812.04206."},{"key":"174_CR11","doi-asserted-by":"crossref","unstructured":"Debnath, A, Lopez de Compadre R, Debnath G, Shusterman A, Hansch C (1991) Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. J Med Chem.","DOI":"10.1021\/jm00106a046"},{"key":"174_CR12","unstructured":"Defferrard, M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. arXiv."},{"key":"174_CR13","unstructured":"Duchi, J, Hazan E, Singer Y (2011) Adaptive subgradient methods for online learning and stochastic optimization. JMLR."},{"key":"174_CR14","unstructured":"Duvenaud, D, Maclaurin D, Iparraguirre J, Bombarell R, Hirzel T, Aspuru-Guzik A, Adams RP (2015) Convolutional networks on graphs for learning molecular fingerprints In: NIPS."},{"key":"174_CR15","doi-asserted-by":"crossref","unstructured":"Floyd, RW (1962) Algorithm 97: shortest path. Commun ACM.","DOI":"10.1145\/367766.368168"},{"key":"174_CR16","unstructured":"Garc\u00eda-Dur\u00e1n, A, Niepert M (2017) Learning graph representations with embedding propagation In: NIPS."},{"key":"174_CR17","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, T, Flach P, Wrobel S (2003) On graph kernels: Hardness results and efficient alternatives In: COLT.","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"174_CR18","unstructured":"Gilmer, J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. CoRR."},{"key":"174_CR19","doi-asserted-by":"crossref","unstructured":"Grover, A, Leskovec J (2016) node2vec: Scalable feature learning for networks In: KDD.","DOI":"10.1145\/2939672.2939754"},{"key":"174_CR20","unstructured":"Haussler, D (1999) Convolution kernels on discrete structures. Technical report."},{"key":"174_CR21","unstructured":"Henaff, M, Bruna J, LeCun Y (2015) Deep convolutional networks on graph-structured data. arXiv."},{"key":"174_CR22","unstructured":"Hinton, GE, Zemel RS (1993) Autoencoders, minimum description length, and helmholtz free energy In: NIPS."},{"key":"174_CR23","doi-asserted-by":"crossref","unstructured":"Hochreiter, S, Schmidhuber J (1997) Long short-term memory. Neural Comput.","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"174_CR24","unstructured":"Kipf, TN, Welling M (2017) Semi-supervised classification with graph convolutional networks In: ICLR."},{"key":"174_CR25","unstructured":"Kriege, NM, Giscard P-L, Wilson R (2016) On valid optimal assignment kernels and applications to graph classification In: NIPS."},{"key":"174_CR26","doi-asserted-by":"crossref","unstructured":"Kurant, M, Markopoulou A, Thiran P (2011) Towards unbiased bfs sampling. IEEE J Sel Areas Commun.","DOI":"10.1109\/JSAC.2011.111005"},{"key":"174_CR27","unstructured":"Lee, JB, Rossi RA, Kim S, Ahmed NK, Koh E (2018a) Attention models in graphs: A survey. arXiv preprint arXiv:1807.07984."},{"key":"174_CR28","doi-asserted-by":"crossref","unstructured":"Lee, JB, Rossi R, Kong X (2018b) Graph classification using structural attention In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 1666\u20131674.. ACM.","DOI":"10.1145\/3219819.3219980"},{"key":"174_CR29","doi-asserted-by":"crossref","unstructured":"Li, J, Luong M, Jurafsky D (2015a) A hierarchical neural autoencoder for paragraphs and documents In: ACL.","DOI":"10.3115\/v1\/P15-1107"},{"key":"174_CR30","doi-asserted-by":"crossref","unstructured":"Li, G, Semerci M, Yener B, Zaki MJ (2011) Graph classification via topological and label attributes In: MLG.","DOI":"10.1002\/sam.11153"},{"key":"174_CR31","unstructured":"Li, Y, Tarlow D, Brockschmidt M, Zemel R (2015b) Gated graph sequence neural networks. arXiv."},{"key":"174_CR32","unstructured":"Maaten, Lvd, Hinton G (2008) Visualizing data using t-SNE. JMLR."},{"key":"174_CR33","doi-asserted-by":"crossref","unstructured":"Macindoe, O, Richards W (2010) Graph comparison using fine structure analysis In: SocialCom.","DOI":"10.1109\/SocialCom.2010.35"},{"key":"174_CR34","doi-asserted-by":"crossref","unstructured":"Morris, C, Kersting K, Mutzel P (2017) Glocalized weisfeiler-lehman graph kernels: Global-local feature maps of graphs In: ICDM.","DOI":"10.1109\/ICDM.2017.42"},{"key":"174_CR35","unstructured":"Narayanan, A, Chandramohan M, Chen L, Liu Y, Saminathan S (2016) subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs. MLG."},{"key":"174_CR36","unstructured":"Narayanan, A, Chandramohan M, Venkatesan R, Chen L, Liu Y, Jaiswal S (2017) graph2vec: Learning distributed representations of graphs In: MLG."},{"key":"174_CR37","doi-asserted-by":"crossref","unstructured":"Newman, ME (2003) The structure and function of complex networks. SIAM Rev.","DOI":"10.1137\/S003614450342480"},{"key":"174_CR38","unstructured":"Niepert, M, Ahmed M, Kutzkov K (2016) Learning convolutional neural networks for graphs In: ICML."},{"key":"174_CR39","doi-asserted-by":"crossref","unstructured":"Nikolentzos, G, Meladianos P, Vazirgiannis M (2017) Matching node embeddings for graph similarity In: AAAI.","DOI":"10.1609\/aaai.v31i1.10839"},{"key":"174_CR40","doi-asserted-by":"crossref","unstructured":"Perozzi, B, Al-Rfou R, Skiena S (2014) DeepWalk: Online learning of social representations In: KDD.","DOI":"10.1145\/2623330.2623732"},{"key":"174_CR41","doi-asserted-by":"crossref","unstructured":"Riesen, K, Jiang X, Bunke H (2010) Exact and inexact graph matching: Methodology and applications In: Managing and Mining Graph Data.","DOI":"10.1007\/978-1-4419-6045-0_7"},{"key":"174_CR42","doi-asserted-by":"crossref","unstructured":"Rossi, RA, Zhou R, Ahmed N (2018) Deep inductive graph representation learning. IEEE Trans Knowl Data Eng.","DOI":"10.1145\/3184558.3191524"},{"key":"174_CR43","doi-asserted-by":"crossref","unstructured":"Scarselli, F, Gori M, Tsoi C, Hagenbuchner M, Monfardini G (2009) The graph neural network model. IEEE Trans Neural Netw 20.","DOI":"10.1109\/TNN.2008.2005605"},{"key":"174_CR44","unstructured":"Shervashidze, N, Schweitzer P, Leeuwen EJv, Mehlhorn K, Borgwardt KM (2011) Weisfeiler-Lehman graph kernels. JMLR."},{"key":"174_CR45","unstructured":"Shervashidze, N, Vishwanathan S, Petri T, Mehlhorn K, Borgwardt KM (2009) Efficient graphlet kernels for large graph comparison In: AISTATS."},{"key":"174_CR46","unstructured":"Sutskever, I, Vinyals O, Le QV (2014) Sequence to sequence learning with neural networks In: NIPS."},{"key":"174_CR47","doi-asserted-by":"crossref","unstructured":"Tang, J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) Line: Large-scale information network embedding In: WWW.","DOI":"10.1145\/2736277.2741093"},{"key":"174_CR48","unstructured":"Toivonen, H, Srinivasan A, King R, Kramer S, Helma C (2003) Statistical evaluation of the predictive toxicology challenge. Bioinformatics 19."},{"key":"174_CR49","unstructured":"Tsitsulin, A, Mottin D, Karras P, Bronstein A, M\u00fcller E (2018) Sgr: Self-supervised spectral graph representation learning. arXiv preprint arXiv:1811.06237."},{"key":"174_CR50","unstructured":"Trivedi, R, Dai H, Wang Y, Song L (2017) Know-evolve: Deep temporal reasoning for dynamic knowledge graphs In: ICML."},{"key":"174_CR51","doi-asserted-by":"crossref","unstructured":"Van Wijk, BC, Stam CJ, Daffertshofer A (2010) Comparing brain networks of different size and connectivity density using graph theory. PLoS ONE 5.","DOI":"10.1371\/journal.pone.0013701"},{"key":"174_CR52","unstructured":"Veli\u010dkovi\u0107, P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2018) Graph attention networks In: ICLR."},{"key":"174_CR53","unstructured":"Vishwanathan, S, Schraudolph N, Kondor R, Borgwardt K (2010) Graph kernels. JMLR."},{"key":"174_CR54","doi-asserted-by":"crossref","unstructured":"Wale, N, Watson IA, Karypis G (2008) Comparison of descriptor spaces for chemical compound retrieval and classification. KAIS 14.","DOI":"10.1007\/s10115-007-0103-5"},{"key":"174_CR55","unstructured":"Weisfeiler, B, Lehman A (1968) A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia."},{"key":"174_CR56","unstructured":"Yan, X, Han J (2002) gspan: Graph-based substructure pattern mining In: ICDM."},{"key":"174_CR57","doi-asserted-by":"crossref","unstructured":"Yanardag, P, Vishwanathan S (2015) Deep graph kernels In: KDD.","DOI":"10.1145\/2783258.2783417"},{"key":"174_CR58","unstructured":"Ying, Z, You J, Morris C, Ren X, Hamilton W, Leskovec J (2018) Hierarchical graph representation learning with differentiable pooling In: Advances in Neural Information Processing Systems, 4805\u20134815."},{"key":"174_CR59","doi-asserted-by":"crossref","unstructured":"Zhang, M, Cui Z, Neumann M, Chen Y (2018) An end-to-end deep learning architecture for graph classification In: AAAI.","DOI":"10.1609\/aaai.v32i1.11782"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0174-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41109-019-0174-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0174-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T09:24:33Z","timestamp":1664184273000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-019-0174-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,24]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["174"],"URL":"https:\/\/doi.org\/10.1007\/s41109-019-0174-8","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,24]]},"assertion":[{"value":"15 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"68"}}