{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:36:24Z","timestamp":1775010984528,"version":"3.50.1"},"publisher-location":"New York, New York, USA","reference-count":41,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["IIS 16-19302"],"award-info":[{"award-number":["IIS 16-19302"]}]},{"name":"Zhejiang Science and Technology Plan Project","award":["2015C01027"],"award-info":[{"award-number":["2015C01027"]}]},{"name":"National Research Foundation Prime Minister's Office Singapore under its CREATE Programme"},{"name":"National Natural Science Foundation of China","award":["61602405"],"award-info":[{"award-number":["61602405"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186073","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"1613-1622","source":"Crossref","is-referenced-by-count":22,"title":["Subgraph-augmented Path Embedding for Semantic User Search on Heterogeneous Social Network"],"prefix":"10.1145","author":[{"given":"Zemin","family":"Liu","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent W.","family":"Zheng","sequence":"additional","affiliation":[{"name":"Advanced Digital Sciences Center, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Zhao","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongxia","family":"Yang","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin Chen-Chuan","family":"Chang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghui","family":"Wu","sequence":"additional","affiliation":[{"name":"Zhejiang University City College, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Ying","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186073-1","doi-asserted-by":"crossref","unstructured":"Lars Backstrom and Jure Leskovec . 2011. Supervised Random Walks: Predicting and Recommending Links in Social Networks WSDM. 635--644.","DOI":"10.1145\/1935826.1935914"},{"key":"key-10.1145\/3178876.3186073-2","doi-asserted-by":"crossref","unstructured":"Yoshua Bengio . 2009. Learning Deep Architectures for AI. Foundations and Trends in Machine Learning Vol. 2, 1 (2009), 1--127.","DOI":"10.1561\/2200000006"},{"key":"key-10.1145\/3178876.3186073-3","doi-asserted-by":"crossref","unstructured":"Austin R. Benson, David F. Gleich, and Jure Leskovec . 2016. Higher-order Organization of Complex Networks. Science Vol. 353, 6295 (2016), 163--166.","DOI":"10.1126\/science.aad9029"},{"key":"key-10.1145\/3178876.3186073-4","unstructured":"Antoine Bordes, Nicolas Usunier, Alberto Garc'ıa-Durán, Jason Weston, and Oksana Yakhnenko . 2013. Translating Embeddings for Modeling Multi-relational Data NIPS. 2787--2795."},{"key":"key-10.1145\/3178876.3186073-5","unstructured":"Hongyun Cai, Vincent W. Zheng, and Kevin Chen-Chuan Chang . 2018. A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications. TKDE (2018)."},{"key":"key-10.1145\/3178876.3186073-6","unstructured":"Shaosheng Cao, Wei Lu, and Qiongkai Xu . 2016. Deep Neural Networks for Learning Graph Representations AAAI. 1145--1152."},{"key":"key-10.1145\/3178876.3186073-7","unstructured":"Hanjun Dai, Bo Dai, and Le Song . 2016. Discriminative Embeddings of Latent Variable Models for Structured Data ICML. 2702--2711."},{"key":"key-10.1145\/3178876.3186073-8","doi-asserted-by":"crossref","unstructured":"Yuxiao Dong, Nitesh V Chawla, and Ananthram Swami . 2017. metapath2vec: Scalable Representation Learning for Heterogeneous Networks KDD. 135--144.","DOI":"10.1145\/3097983.3098036"},{"key":"key-10.1145\/3178876.3186073-9","doi-asserted-by":"crossref","unstructured":"Mohammed Elseidy, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis . 2014. GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph. PVLDB Vol. 7, 7 (2014), 517--528.","DOI":"10.14778\/2732286.2732289"},{"key":"key-10.1145\/3178876.3186073-10","doi-asserted-by":"crossref","unstructured":"Alessandro Epasto, Silvio Lattanzi, and Mauro Sozio . 2015. Efficient Densest Subgraph Computation in Evolving Graphs WWW. 300--310.","DOI":"10.1145\/2736277.2741638"},{"key":"key-10.1145\/3178876.3186073-11","doi-asserted-by":"crossref","unstructured":"Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Kevin Chen-Chuan Chang, and Xiaoli Li . 2016. Semantic proximity search on graphs with metagraph-based learning ICDE. 277--288.","DOI":"10.1109\/ICDE.2016.7498247"},{"key":"key-10.1145\/3178876.3186073-12","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec . 2016. node2vec: Scalable Feature Learning for Networks. In KDD.","DOI":"10.1145\/2939672.2939754"},{"key":"key-10.1145\/3178876.3186073-13","doi-asserted-by":"crossref","unstructured":"Pankaj Gupta, Venu Satuluri, Ajeet Grewal, Siva Gurumurthy, Volodymyr Zhabiuk, Quannan Li, and Jimmy J. Lin . 2014. Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs. PVLDB Vol. 7, 13 (2014), 1379--1380.","DOI":"10.14778\/2733004.2733010"},{"key":"key-10.1145\/3178876.3186073-14","unstructured":"William L. Hamilton, Rex Ying, and Jure Leskovec . 2017. Inductive Representation Learning on Large Graphs. In NIPS."},{"key":"key-10.1145\/3178876.3186073-15","unstructured":"Sepp Hochreiter and Jürgen Schmidhuber . 1997. Long Short-Term Memory. Neural Comput. Vol. 9, 8 (Nov. . 1997), 1735--1780."},{"key":"key-10.1145\/3178876.3186073-16","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom . 2002. SimRank: A Measure of Structural-context Similarity KDD. 538--543.","DOI":"10.1145\/775047.775126"},{"key":"key-10.1145\/3178876.3186073-17","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom . 2003. Scaling Personalized Web Search. In WWW. 271--279.","DOI":"10.1145\/775152.775191"},{"key":"key-10.1145\/3178876.3186073-18","doi-asserted-by":"crossref","unstructured":"Ni Lao and William W. Cohen . 2010. Relational retrieval using a combination of path-constrained random walks. Machine Learning Vol. 81, 1 (2010), 53--67.","DOI":"10.1007\/s10994-010-5205-8"},{"key":"key-10.1145\/3178876.3186073-19","doi-asserted-by":"crossref","unstructured":"Rui Li, Chi Wang, and Kevin Chen-Chuan Chang . 2014. User profiling in an ego network: co-profiling attributes and relationships WWW. 819--830.","DOI":"10.1145\/2566486.2568045"},{"key":"key-10.1145\/3178876.3186073-20","doi-asserted-by":"crossref","unstructured":"Zemin Liu, Vincent W. Zheng, Zhou Zhao, Fanwei Zhu, Kevin Chen-Chuan Chang, Minghui Wu, and Jing Ying . 2017. Semantic Proximity Search on Heterogeneous Graph by Proximity Embedding AAAI.","DOI":"10.1145\/3219819.3219953"},{"key":"key-10.1145\/3178876.3186073-21","doi-asserted-by":"crossref","unstructured":"Zemin Liu, Vincent W. Zheng, Zhou Zhao, Fanwei Zhu, Kevin Chen-Chuan Chang, Minghui Wu, and Jing Ying . 2018. Distance-aware DAG Embedding for Proximity Search on Heterogeneous Graphs AAAI.","DOI":"10.1145\/3219819.3219953"},{"key":"key-10.1145\/3178876.3186073-22","unstructured":"Julian J. McAuley and Jure Leskovec . 2012. Learning to Discover Social Circles in Ego Networks NIPS. 548--556."},{"key":"key-10.1145\/3178876.3186073-23","unstructured":"Feiping Nie, Wei Zhu, and Xuelong Li . 2017. Unsupervised Large Graph Embedding. In AAAI."},{"key":"key-10.1145\/3178876.3186073-24","unstructured":"Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov . 2016. Learning Convolutional Neural Networks for Graphs. In ICML. 2014--2023."},{"key":"key-10.1145\/3178876.3186073-25","doi-asserted-by":"crossref","unstructured":"Giannis Nikolentzos, Polykarpos Meladianos, and Michalis Vazirgiannis . 2017. Matching Node Embeddings for Graph Similarity. In AAAI.","DOI":"10.1609\/aaai.v31i1.10839"},{"key":"key-10.1145\/3178876.3186073-26","doi-asserted-by":"crossref","unstructured":"Mingdong Ou, Peng Cui, Jian Pei, Ziwei Zhang, and Wenwu Zhu . 2016. Asymmetric Transitivity Preserving Graph Embedding KDD. 1105--1114.","DOI":"10.1145\/2939672.2939751"},{"key":"key-10.1145\/3178876.3186073-27","doi-asserted-by":"crossref","unstructured":"Bryan Perozzi, Rami Al-Rfou, and Steven Skiena . 2014. DeepWalk: Online Learning of Social Representations KDD. 701--710.","DOI":"10.1145\/2623330.2623732"},{"key":"key-10.1145\/3178876.3186073-28","doi-asserted-by":"crossref","unstructured":"Leonardo F.R. Ribeiro, Pedro H.P. Saverese, and Daniel R. Figueiredo . 2017. Struc2Vec: Learning Node Representations from Structural Identity KDD. 385--394.","DOI":"10.1145\/3097983.3098061"},{"key":"key-10.1145\/3178876.3186073-29","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 Vol. 12 (2011), 2539--2561."},{"key":"key-10.1145\/3178876.3186073-30","unstructured":"Yizhou Sun, Jiawei Han, Xifeng Yan, Philip S Yu, and Tianyi Wu . 2011. PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks. PVLDB Vol. 4, 11 (2011)."},{"key":"key-10.1145\/3178876.3186073-31","doi-asserted-by":"crossref","unstructured":"Zhao Sun, Hongzhi Wang, Haixun Wang, Bin Shao, and Jianzhong Li . 2012. Efficient Subgraph Matching on Billion Node Graphs. PVLDB Vol. 5, 9 (2012), 788--799.","DOI":"10.14778\/2311906.2311907"},{"key":"key-10.1145\/3178876.3186073-32","doi-asserted-by":"crossref","unstructured":"Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei . 2015. LINE: Large-scale Information Network Embedding. In WWW. 1067--1077.","DOI":"10.1145\/2736277.2741093"},{"key":"key-10.1145\/3178876.3186073-33","unstructured":"Theano Development Team . 2016. Theano: A Python framework for fast computation of mathematical expressions. CoRR Vol. abs\/1605.02688 (may . 2016)."},{"key":"key-10.1145\/3178876.3186073-34","doi-asserted-by":"crossref","unstructured":"Cunchao Tu, Zhengyan Zhang, Zhiyuan Liu, and Maosong Sun . 2017. TransNet: Translation-Based Network Representation Learning for Social Relation Extraction. In IJCAI. 2864--2870.","DOI":"10.24963\/ijcai.2017\/399"},{"key":"key-10.1145\/3178876.3186073-35","doi-asserted-by":"crossref","unstructured":"Rogier J. P. van Berlo, Wynand Winterbach, Marco J. L. de Groot, Andreas Bender, Peter J. T. Verheijen, Marcel J. T. Reinders, and Dick de Ridder . 2013. Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels. IJBRA Vol. 9, 4 (2013), 407--432.","DOI":"10.1504\/IJBRA.2013.054688"},{"key":"key-10.1145\/3178876.3186073-36","unstructured":"Chi Wang, Jiawei Han, Yuntao Jia, Jie Tang, Duo Zhang, Yintao Yu, and Jingyi Guo . 2010. Mining advisor-advisee relationships from research publication networks KDD. ACM, 203--212."},{"key":"key-10.1145\/3178876.3186073-37","doi-asserted-by":"crossref","unstructured":"Chi Wang, Rajat Raina, David Fong, Ding Zhou, Jiawei Han, and Greg Badros . 2011. Learning Relevance from Heterogeneous Social Network and Its Application in Online Targeting. In SIGIR. 655--664.","DOI":"10.1145\/2009916.2010004"},{"key":"key-10.1145\/3178876.3186073-38","doi-asserted-by":"crossref","unstructured":"Daixin Wang, Peng Cui, and Wenwu Zhu . 2016. Structural Deep Network Embedding. In KDD. 1225--1234.","DOI":"10.1145\/2939672.2939753"},{"key":"key-10.1145\/3178876.3186073-39","doi-asserted-by":"crossref","unstructured":"Zhen Wang, Jianwen Zhang, Jianlin Feng, and Zheng Chen . 2014. Knowledge Graph Embedding by Translating on Hyperplanes AAAI. 1112--1119.","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"key-10.1145\/3178876.3186073-40","unstructured":"Kelvin Xu, Jimmy Ba, Ryan Kiros, Kyunghyun Cho, Aaron C. Courville, Ruslan Salakhutdinov, Richard S. Zemel, and Yoshua Bengio . 2015. Show, Attend and Tell: Neural Image Caption Generation with Visual Attention ICML. 2048--2057."},{"key":"key-10.1145\/3178876.3186073-41","doi-asserted-by":"crossref","unstructured":"Muhan Zhang and Yixin Chen . 2017. Weisfeiler-Lehman Neural Machine for Link Prediction KDD. 575--583.","DOI":"10.1145\/3097983.3097996"}],"event":{"name":"the 2018 World Wide Web Conference","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186073","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186073&ftid=1957418&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:27:41Z","timestamp":1751563661000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186073"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186073","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}