{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:16Z","timestamp":1750220656116,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["DGE-1829071, IIS-2031187"],"award-info":[{"award-number":["DGE-1829071, IIS-2031187"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412040","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T05:31:03Z","timestamp":1603085463000},"page":"575-584","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["MARU"],"prefix":"10.1145","author":[{"given":"Jyun-Yu","family":"Jiang","sequence":"first","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyu","family":"Li","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chelsea J.-T.","family":"Ju","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"David Arthur and Sergei Vassilvitskii. 2007. k-means: The advantages of careful seeding. In SODA. 1027--1035.  David Arthur and Sergei Vassilvitskii. 2007. k-means: The advantages of careful seeding. In SODA. 1027--1035."},{"key":"e_1_3_2_2_2_1","volume-title":"A comprehensive survey of graph embedding: problems, techniques and applications. TKDE","author":"Cai Hongyun","year":"2018","unstructured":"Hongyun Cai , Vincent W Zheng , and Kevin Chang . 2018. A comprehensive survey of graph embedding: problems, techniques and applications. TKDE ( 2018 ). Hongyun Cai, Vincent W Zheng, and Kevin Chang. 2018. A comprehensive survey of graph embedding: problems, techniques and applications. TKDE (2018)."},{"key":"e_1_3_2_2_3_1","unstructured":"Yelp Dataset Challenge. 2013. Yelp dataset challenge. (2013).  Yelp Dataset Challenge. 2013. Yelp dataset challenge. (2013)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Shiyu Chang Wei Han Jiliang Tang Guo-Jun Qi Charu C Aggarwal and Thomas S Huang. 2015. Heterogeneous network embedding via deep architectures. In KDD. ACM 119--128.  Shiyu Chang Wei Han Jiliang Tang Guo-Jun Qi Charu C Aggarwal and Thomas S Huang. 2015. Heterogeneous network embedding via deep architectures. In KDD. ACM 119--128.","DOI":"10.1145\/2783258.2783296"},{"key":"e_1_3_2_2_5_1","volume-title":"Harp: Hierarchical representation learning for networks. In AAAI.","author":"Chen Haochen","year":"2018","unstructured":"Haochen Chen , Bryan Perozzi , Yifan Hu , and Steven Skiena . 2018 . Harp: Hierarchical representation learning for networks. In AAAI. Haochen Chen, Bryan Perozzi, Yifan Hu, and Steven Skiena. 2018. Harp: Hierarchical representation learning for networks. In AAAI."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Ting Chen and Yizhou Sun. 2017. Task-guided and path-augmented heterogeneous network embedding for author identification. In WSDM. ACM 295--304.  Ting Chen and Yizhou Sun. 2017. Task-guided and path-augmented heterogeneous network embedding for author identification. In WSDM. ACM 295--304.","DOI":"10.1145\/3018661.3018735"},{"volume-title":"Introduction to algorithms","author":"Cormen Thomas H","key":"e_1_3_2_2_7_1","unstructured":"Thomas H Cormen , Charles E Leiserson , Ronald L Rivest , and Clifford Stein . 2009. Introduction to algorithms . MIT press . Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2009. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Hongbo Deng Jiawei Han Bo Zhao Yintao Yu and Cindy Xide Lin. 2011. Probabilistic topic models with biased propagation on heterogeneous information networks. In KDD. ACM 1271--1279.  Hongbo Deng Jiawei Han Bo Zhao Yintao Yu and Cindy Xide Lin. 2011. Probabilistic topic models with biased propagation on heterogeneous information networks. In KDD. ACM 1271--1279.","DOI":"10.1145\/2020408.2020600"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Yuxiao Dong Nitesh V Chawla and Ananthram Swami. 2017. metapath2vec: Scalable representation learning for heterogeneous networks. In KDD. ACM 135--144.  Yuxiao Dong Nitesh V Chawla and Ananthram Swami. 2017. metapath2vec: Scalable representation learning for heterogeneous networks. In KDD. ACM 135--144.","DOI":"10.1145\/3097983.3098036"},{"key":"e_1_3_2_2_10_1","volume-title":"A fair comparison of graph neural networks for graph classification. arXiv preprint arXiv:1912.09893","author":"Errica Federico","year":"2019","unstructured":"Federico Errica , Marco Podda , Davide Bacciu , and Alessio Micheli . 2019. A fair comparison of graph neural networks for graph classification. arXiv preprint arXiv:1912.09893 ( 2019 ). Federico Errica, Marco Podda, Davide Bacciu, and Alessio Micheli. 2019. A fair comparison of graph neural networks for graph classification. arXiv preprint arXiv:1912.09893 (2019)."},{"key":"e_1_3_2_2_11_1","unstructured":"Tao-yang Fu Wang-Chien Lee and Zhen Lei. 2017. Hin2vec: Explore meta-paths in heterogeneous information networks for representation learning. In CIKM. ACM 1797--1806.  Tao-yang Fu Wang-Chien Lee and Zhen Lei. 2017. Hin2vec: Explore meta-paths in heterogeneous information networks for representation learning. In CIKM. ACM 1797--1806."},{"volume-title":"Deep learning","author":"Goodfellow Ian","key":"e_1_3_2_2_12_1","unstructured":"Ian Goodfellow , Yoshua Bengio , Aaron Courville , and Yoshua Bengio . 2016. Deep learning . Vol. 1 . MIT press Cambridge . Ian Goodfellow, Yoshua Bengio, Aaron Courville, and Yoshua Bengio. 2016. Deep learning. Vol. 1. MIT press Cambridge."},{"key":"e_1_3_2_2_13_1","unstructured":"Ian Goodfellow Jean Pouget-Abadie Mehdi Mirza Bing Xu David Warde-Farley Sherjil Ozair Aaron Courville and Yoshua Bengio. 2014. Generative adversarial nets. In NIPS. 2672--2680.  Ian Goodfellow Jean Pouget-Abadie Mehdi Mirza Bing Xu David Warde-Farley Sherjil Ozair Aaron Courville and Yoshua Bengio. 2014. Generative adversarial nets. In NIPS. 2672--2680."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. KDD. ACM 855--864.  Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. KDD. ACM 855--864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_15_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. NIPS. 1024--1034.  Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. NIPS. 1024--1034."},{"key":"e_1_3_2_2_16_1","first-page":"19","article-title":"The movielens datasets: History and context","volume":"5","author":"Maxwell Harper F","year":"2016","unstructured":"F Maxwell Harper and Joseph A Konstan . 2016 . The movielens datasets: History and context . TIIS , Vol. 5 , 4 (2016), 19 . F Maxwell Harper and Joseph A Konstan. 2016. The movielens datasets: History and context. TIIS, Vol. 5, 4 (2016), 19.","journal-title":"TIIS"},{"key":"e_1_3_2_2_17_1","unstructured":"Binbin Hu Yuan Fang and Chuan Shi. 2019. Adversarial Learning on Heterogeneous Information Networks. In KDD. ACM.  Binbin Hu Yuan Fang and Chuan Shi. 2019. Adversarial Learning on Heterogeneous Information Networks. In KDD. ACM."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Rana Hussein Dingqi Yang and Philippe Cudr\u00e9-Mauroux. 2018. Are Meta-Paths Necessary?: Revisiting Heterogeneous Graph Embeddings. In CIKM. ACM 437--446.  Rana Hussein Dingqi Yang and Philippe Cudr\u00e9-Mauroux. 2018. Are Meta-Paths Necessary?: Revisiting Heterogeneous Graph Embeddings. In CIKM. ACM 437--446.","DOI":"10.1145\/3269206.3271777"},{"key":"e_1_3_2_2_19_1","volume-title":"Variational graph auto-encoders. arXiv preprint arXiv:1611.07308","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 ( 2016 ). Thomas N Kipf and Max Welling. 2016. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_3_2_2_21_1","unstructured":"Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In NIPS. 3111--3119.  Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In NIPS. 3111--3119."},{"key":"e_1_3_2_2_22_1","volume-title":"Clustering in weighted networks. Social networks","author":"Opsahl Tore","year":"2009","unstructured":"Tore Opsahl and Pietro Panzarasa . 2009. Clustering in weighted networks. Social networks , Vol. 31 , 2 ( 2009 ), 155--163. Tore Opsahl and Pietro Panzarasa. 2009. Clustering in weighted networks. Social networks, Vol. 31, 2 (2009), 155--163."},{"key":"e_1_3_2_2_23_1","unstructured":"Mingdong Ou Peng Cui Jian Pei Ziwei Zhang and Wenwu Zhu. 2016. Asymmetric transitivity preserving graph embedding. In KDD. ACM 1105--1114.  Mingdong Ou Peng Cui Jian Pei Ziwei Zhang and Wenwu Zhu. 2016. Asymmetric transitivity preserving graph embedding. In KDD. ACM 1105--1114."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_25_1","unstructured":"David Martin Powers. 2011. Evaluation: from precision recall and F-measure to ROC informedness markedness and correlation. (2011).  David Martin Powers. 2011. Evaluation: from precision recall and F-measure to ROC informedness markedness and correlation. (2011)."},{"key":"e_1_3_2_2_26_1","volume-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In NIPS. 693--701.","author":"Recht Benjamin","year":"2011","unstructured":"Benjamin Recht , Christopher Re , Stephen Wright , and Feng Niu . 2011 . Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In NIPS. 693--701. Benjamin Recht, Christopher Re, Stephen Wright, and Feng Niu. 2011. Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In NIPS. 693--701."},{"key":"e_1_3_2_2_27_1","volume-title":"Heterogeneous Information Network Embedding for Recommendation. TKDE","author":"Shi Chuan","year":"2018","unstructured":"Chuan Shi , Binbin Hu , Xin Zhao , and Philip Yu. 2018. Heterogeneous Information Network Embedding for Recommendation. TKDE ( 2018 ). Chuan Shi, Binbin Hu, Xin Zhao, and Philip Yu. 2018. Heterogeneous Information Network Embedding for Recommendation. TKDE (2018)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2371211"},{"key":"e_1_3_2_2_29_1","first-page":"992","article-title":"Pathsim: Meta path-based top-k similarity search in heterogeneous information networks","volume":"4","author":"Sun Yizhou","year":"2011","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 . VLDB , Vol. 4 , 11 (2011), 992 -- 1003 . 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. VLDB, Vol. 4, 11 (2011), 992--1003.","journal-title":"VLDB"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500492"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783307"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Lei Tang and Huan Liu. 2009. Relational learning via latent social dimensions. KDD. ACM 817--826.  Lei Tang and Huan Liu. 2009. Relational learning via latent social dimensions. KDD. ACM 817--826.","DOI":"10.1145\/1557019.1557109"},{"key":"e_1_3_2_2_34_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In NIPS. 5998--6008.  Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In NIPS. 5998--6008."},{"key":"e_1_3_2_2_35_1","volume-title":"JMLR","volume":"11","author":"Vinh Nguyen Xuan","year":"2010","unstructured":"Nguyen Xuan Vinh , Julien Epps , and James Bailey . 2010 . Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance . JMLR , Vol. 11 , Oct (2010), 2837--2854. Nguyen Xuan Vinh, Julien Epps, and James Bailey. 2010. Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. JMLR, Vol. 11, Oct (2010), 2837--2854."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural deep network embedding. In KDD. ACM 1225--1234.  Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural deep network embedding. In KDD. ACM 1225--1234.","DOI":"10.1145\/2939672.2939753"},{"volume-title":"Signed network embedding in social media","author":"Wang Suhang","key":"e_1_3_2_2_37_1","unstructured":"Suhang Wang , Jiliang Tang , Charu Aggarwal , Yi Chang , and Huan Liu . 2017. Signed network embedding in social media . In SDM. SIAM , 327--335. Suhang Wang, Jiliang Tang, Charu Aggarwal, Yi Chang, and Huan Liu. 2017. Signed network embedding in social media. In SDM. SIAM, 327--335."},{"key":"e_1_3_2_2_38_1","unstructured":"Yu Zhao Zhiyuan Liu and Maosong Sun. 2015. Representation learning for measuring entity relatedness with rich information. In IJCAI.  Yu Zhao Zhiyuan Liu and Maosong Sun. 2015. Representation learning for measuring entity relatedness with rich information. In IJCAI."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Ireland","acronym":"CIKM '20"},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412040","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:29Z","timestamp":1750197749000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412040"}},"subtitle":["Meta-context Aware Random Walks for Heterogeneous Network Representation Learning"],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":38,"alternative-id":["10.1145\/3340531.3412040","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412040","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}