{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:06:14Z","timestamp":1760709974121,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330918","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"1418-1428","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Scalable Global Alignment Graph Kernel Using Random Features"],"prefix":"10.1145","author":[{"given":"Lingfei","family":"Wu","sequence":"first","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian En-Hsu","family":"Yen","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Xu","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Zhao","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Peng","sequence":"additional","affiliation":[{"name":"University of Delaware, Newark, DE, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinglong","family":"Xia","sequence":"additional","affiliation":[{"name":"Huawei, San Jose, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charu","family":"Aggarwal","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313668"},{"key":"e_1_3_2_1_2_1","unstructured":"James Atwood Siddharth Pal Don Towsley and Ananthram Swami. 2016. Sparse Diffusion-Convolutional Neural Networks. In NIPS.   James Atwood Siddharth Pal Don Towsley and Ananthram Swami. 2016. Sparse Diffusion-Convolutional Neural Networks. In NIPS."},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"On the equivalence between kernel quadrature rules and random feature expansions","volume":"18","author":"Bach Francis","year":"2017","unstructured":"Francis Bach . 2017 . On the equivalence between kernel quadrature rules and random feature expansions . Journal of Machine Learning Research 18 , 21 (2017), 1 -- 38 . Francis Bach. 2017. On the equivalence between kernel quadrature rules and random feature expansions. Journal of Machine Learning Research 18, 21 (2017), 1--38.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/362919.362945"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Pin-Yu Chen and Lingfei Wu. 2017. Revisiting spectral graph clustering with generative community models. In ICDM. 51--60.  Pin-Yu Chen and Lingfei Wu. 2017. Revisiting spectral graph clustering with generative community models. In ICDM. 51--60.","DOI":"10.1109\/ICDM.2017.14"},{"key":"e_1_3_2_1_7_1","first-page":"1871","article-title":"LIBLINEAR: A library for large linear classification","author":"Fan Rong-En","year":"2008","unstructured":"Rong-En Fan , Kai-Wei Chang , Cho-Jui Hsieh , Xiang-Rui Wang , and Chih-Jen Lin . 2008 . LIBLINEAR: A library for large linear classification . Journal of machine learning research 9 , Aug (2008), 1871 -- 1874 . Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, Xiang-Rui Wang, and Chih-Jen Lin. 2008. LIBLINEAR: A library for large linear classification. Journal of machine learning research 9, Aug (2008), 1871--1874.","journal-title":"Journal of machine learning research 9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964929"},{"volume-title":"Learning Theory and Kernel Machines","author":"Gartner Thomas","key":"e_1_3_2_1_9_1","unstructured":"Thomas Gartner , Peter Flach , and Stefan Wrobel . 2003. On graph kernels: Hard- ness results and efficient alternatives . In Learning Theory and Kernel Machines . Springer , 129--143. Thomas Gartner, Peter Flach, and Stefan Wrobel. 2003. On graph kernels: Hard- ness results and efficient alternatives. In Learning Theory and Kernel Machines. Springer, 129--143."},{"key":"e_1_3_2_1_11_1","first-page":"1","article-title":"The distribution of a product from several sources to numerous localities","volume":"20","author":"Hitchcock Frank L","year":"1941","unstructured":"Frank L Hitchcock . 1941 . The distribution of a product from several sources to numerous localities . Studies in Applied Mathematics 20 , 1 -- 4 (1941), 224--230. Frank L Hitchcock. 1941. The distribution of a product from several sources to numerous localities. Studies in Applied Mathematics 20, 1--4 (1941), 224--230.","journal-title":"Studies in Applied Mathematics"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014072"},{"key":"e_1_3_2_1_13_1","unstructured":"Catalin Ionescu Alin Popa and Cristian Sminchisescu. 2017. Large-scale data- dependent kernel approximation. In Artificial Intelligence and Statistics. 19--27.  Catalin Ionescu Alin Popa and Cristian Sminchisescu. 2017. Large-scale data- dependent kernel approximation. In Artificial Intelligence and Statistics. 19--27."},{"key":"e_1_3_2_1_14_1","unstructured":"Fredrik Johansson Vinay Jethava Devdatt Dubhashi and Chiranjib Bhat- tacharyya. 2014. Global graph kernels using geometric embeddings. In ICML.   Fredrik Johansson Vinay Jethava Devdatt Dubhashi and Chiranjib Bhat- tacharyya. 2014. Global graph kernels using geometric embeddings. In ICML."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783341"},{"key":"e_1_3_2_1_16_1","unstructured":"Risi Kondor and Horace Pan. 2016. The multiscale laplacian graph kernel. In NIPS. 2990--2998.   Risi Kondor and Horace Pan. 2016. The multiscale laplacian graph kernel. In NIPS. 2990--2998."},{"key":"e_1_3_2_1_17_1","volume-title":"NIPS. 1623--1631. {18} Matt Kusner, Yu Sun, Nicholas Kolkin, and Kilian Weinberger.","author":"Kriege Nils M","year":"2015","unstructured":"Nils M Kriege , Pierre-Louis Giscard , and Richard Wilson . 2016. On valid optimal assignment kernels and applications to graph classification . In NIPS. 1623--1631. {18} Matt Kusner, Yu Sun, Nicholas Kolkin, and Kilian Weinberger. 2015 . From word embeddings to document distances. In ICML. 957--966. Nils M Kriege, Pierre-Louis Giscard, and Richard Wilson. 2016. On valid optimal assignment kernels and applications to graph classification. In NIPS. 1623--1631. {18} Matt Kusner, Yu Sun, Nicholas Kolkin, and Kilian Weinberger. 2015. From word embeddings to document distances. In ICML. 957--966."},{"key":"e_1_3_2_1_18_1","volume-title":"ICML","volume":"85","author":"Le Quoc","year":"2013","unstructured":"Quoc Le , Tama's Sarlo's , and Alex Smola . 2013 . Fastfood-approximating kernel expansions in loglinear time . In ICML , Vol. 85 . Quoc Le, Tama's Sarlo's, and Alex Smola. 2013. Fastfood-approximating kernel expansions in loglinear time. In ICML, Vol. 85."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jneumeth.2012.10.012"},{"key":"e_1_3_2_1_21_1","unstructured":"Mathias Niepert Mohamed Ahmed and Konstantin Kutzkov. 2016. Learning convolutional neural networks for graphs. In ICML. 2014--2023.   Mathias Niepert Mohamed Ahmed and Konstantin Kutzkov. 2016. Learning convolutional neural networks for graphs. In ICML. 2014--2023."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Giannis Nikolentzos Polykarpos Meladianos and Michalis Vazirgiannis. 2017. Matching Node Embeddings for Graph Similarity.. In AAAI. 2429--2435.   Giannis Nikolentzos Polykarpos Meladianos and Michalis Vazirgiannis. 2017. Matching Node Embeddings for Graph Similarity.. In AAAI. 2429--2435.","DOI":"10.1609\/aaai.v31i1.10839"},{"key":"e_1_3_2_1_23_1","unstructured":"Ali Rahimi and Benjamin Recht. 2008. Random features for large-scale kernel machines. In NIPS. 1177--1184.   Ali Rahimi and Benjamin Recht. 2008. Random features for large-scale kernel machines. In NIPS. 1177--1184."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2005.07.009"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"e_1_3_2_1_26_1","unstructured":"Alessandro Rudi and Lorenzo Rosasco. 2017. Generalization properties of learning with random features. In NIPS. 3218--3228.   Alessandro Rudi and Lorenzo Rosasco. 2017. Generalization properties of learning with random features. In NIPS. 3218--3228."},{"key":"e_1_3_2_1_27_1","unstructured":"Nino Shervashidze and Karsten M Borgwardt. 2009. Fast subtree kernels on graphs. In NIPS. 1660--1668.   Nino Shervashidze and Karsten M Borgwardt. 2009. Fast subtree kernels on graphs. In NIPS. 1660--1668."},{"key":"e_1_3_2_1_28_1","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","author":"Shervashidze Nino","year":"2011","unstructured":"Nino Shervashidze , Pascal Schweitzer , Erik Jan van Leeuwen , Kurt Mehlhorn , and Karsten M Borgwardt . 2011 . Weisfeiler-lehman graph kernels . Journal of Machine Learning Research 12 , Sep (2011), 2539 -- 2561 . Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, and Karsten M Borgwardt. 2011. Weisfeiler-lehman graph kernels. Journal of Machine Learning Research 12, Sep (2011), 2539--2561.","journal-title":"Journal of Machine Learning Research 12"},{"key":"e_1_3_2_1_29_1","unstructured":"NinoShervashidze SVNVishwanathan TobiasPetri KurtMehlhorn andKarsten Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In AIStats. 488--495.  NinoShervashidze SVNVishwanathan TobiasPetri KurtMehlhorn andKarsten Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In AIStats. 488--495."},{"key":"e_1_3_2_1_30_1","unstructured":"Aman Sinha and John C Duchi. 2016. Learning kernels with random features. In NIPS. 1298--1306.   Aman Sinha and John C Duchi. 2016. Learning kernels with random features. In NIPS. 1298--1306."},{"key":"e_1_3_2_1_31_1","volume-title":"Continuous-flow graph transportation distances. arXiv:1603.06927","author":"Solomon Justin","year":"2016","unstructured":"Justin Solomon , Raif Rustamov , Leonidas Guibas , and Adrian Butscher . 2016. Continuous-flow graph transportation distances. arXiv:1603.06927 ( 2016 ). Justin Solomon, Raif Rustamov, Leonidas Guibas, and Adrian Butscher. 2016. Continuous-flow graph transportation distances. arXiv:1603.06927 (2016)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1731022.1731031"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1859891"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/MALWARE.2009.5403018"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.393"},{"key":"e_1_3_2_1_37_1","volume-title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model. arXiv:1712.03563","author":"Wu Bo","year":"2017","unstructured":"Bo Wu , Yang Liu , Bo Lang , and Lei Huang . 2017 . DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model. arXiv:1712.03563 (2017). Bo Wu, Yang Liu, Bo Lang, and Lei Huang. 2017. DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model. arXiv:1712.03563 (2017)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220090"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1082214"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939794"},{"key":"e_1_3_2_1_41_1","volume-title":"Fangli Xu, Pradeep Ravikuma, and Michael Wit- brock.","author":"Wu Lingfei","year":"2018","unstructured":"Lingfei Wu , Ian En-Hsu Yen , Fangli Xu, Pradeep Ravikuma, and Michael Wit- brock. 2018 . D2KE: From Distance to Kernel and Embedding . arXiv preprint arXiv:1802.04956 (2018). Lingfei Wu, Ian En-Hsu Yen, Fangli Xu, Pradeep Ravikuma, and Michael Wit- brock. 2018. D2KE: From Distance to Kernel and Embedding. arXiv preprint arXiv:1802.04956 (2018)."},{"key":"e_1_3_2_1_42_1","volume-title":"Random Warping Series: A Random Features Method for Time-Series Embedding. In International Conference on Artificial Intelligence and Statistics. 793--802","author":"Wu Lingfei","year":"2018","unstructured":"Lingfei Wu , Ian En-Hsu Yen , Jinfeng Yi , Fangli Xu , Qi Lei , and Michael Witbrock . 2018 . Random Warping Series: A Random Features Method for Time-Series Embedding. In International Conference on Artificial Intelligence and Statistics. 793--802 . Lingfei Wu, Ian En-Hsu Yen, Jinfeng Yi, Fangli Xu, Qi Lei, and Michael Witbrock. 2018. Random Warping Series: A Random Features Method for Time-Series Embedding. In International Conference on Artificial Intelligence and Statistics. 793--802."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_1_44_1","unstructured":"Pinar Yanardag and SVN Vishwanathan. 2015. A structural smoothing framework for robust graph comparison. In NIPS. 2134--2142.   Pinar Yanardag and SVN Vishwanathan. 2015. A structural smoothing framework for robust graph comparison. In NIPS. 2134--2142."},{"key":"e_1_3_2_1_45_1","unstructured":"Zhen Zhang Mianzhi Wang Yijian Xiang Yan Huang and Arye Nehorai. 2018. RetGK: Graph Kernels based on Return Probabilities of Random Walks. In NIPS. 3968--3978.   Zhen Zhang Mianzhi Wang Yijian Xiang Yan Huang and Arye Nehorai. 2018. RetGK: Graph Kernels based on Return Probabilities of Random Walks. In NIPS. 3968--3978."}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330918","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:03Z","timestamp":1750206363000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330918"}},"subtitle":["From Node Embedding to Graph Embedding"],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":44,"alternative-id":["10.1145\/3292500.3330918","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330918","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}