{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:41:11Z","timestamp":1787017271599,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":33,"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":"Department of Energy?s PacificNorthwest National Laboratory","award":["DE-ACO6-76RL01830"],"award-info":[{"award-number":["DE-ACO6-76RL01830"]}]},{"name":"United States Department of Energy","award":["DE-SC0020347"],"award-info":[{"award-number":["DE-SC0020347"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412034","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T01:31:03Z","timestamp":1603071063000},"page":"495-504","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Hypergraph Random Walks, Laplacians, and Clustering"],"prefix":"10.1145","author":[{"given":"Koby","family":"Hayashi","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sinan G.","family":"Aksoy","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Lab, Richland, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheong Hee","family":"Park","sequence":"additional","affiliation":[{"name":"Chungnam National University, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haesun","family":"Park","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3242034"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143847"},{"key":"e_1_3_2_2_3_1","unstructured":"David Aldous and James Fill. 1995. Reversible Markov chains and random walks on graphs.  David Aldous and James Fill. 1995. Reversible Markov chains and random walks on graphs."},{"key":"e_1_3_2_2_4_1","volume-title":"Ad Hoc Networks","volume":"12","author":"Avin Chen","year":"2014","unstructured":"Chen Avin , Yuval Lando , and Zvi Lotker . 2014 . Radio cover time in hyper-graphs . Ad Hoc Networks , Vol. 12 (jan 2014), 278--290. https:\/\/doi.org\/10.1016\/j.adhoc.2012.08.010 10.1016\/j.adhoc.2012.08.010 Chen Avin, Yuval Lando, and Zvi Lotker. 2014. Radio cover time in hyper-graphs. Ad Hoc Networks, Vol. 12 (jan 2014), 278--290. https:\/\/doi.org\/10.1016\/j.adhoc.2012.08.010"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.01.020"},{"key":"e_1_3_2_2_6_1","volume-title":"Higher-order organization of complex networks. CoRR","author":"Benson Austin R.","year":"2016","unstructured":"Austin R. Benson , David F. Gleich , and Jure Leskovec . 2016. Higher-order organization of complex networks. CoRR , Vol. abs\/ 1612 .08447 ( 2016 ). arxiv: 1612.08447 http:\/\/arxiv.org\/abs\/1612.08447 Austin R. Benson, David F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. CoRR, Vol. abs\/1612.08447 (2016). arxiv: 1612.08447 http:\/\/arxiv.org\/abs\/1612.08447"},{"key":"e_1_3_2_2_7_1","first-page":"616","article-title":"Clustering via Random Walk Hitting Time on Directed Graphs","volume":"8","author":"Chen Mo","year":"2008","unstructured":"Mo Chen , Jianzhuang Liu , and Xiaoou Tang . 2008 . Clustering via Random Walk Hitting Time on Directed Graphs . In AAAI , Vol. 8. 616 -- 621 . Mo Chen, Jianzhuang Liu, and Xiaoou Tang. 2008. Clustering via Random Walk Hitting Time on Directed Graphs. In AAAI, Vol. 8. 616--621.","journal-title":"AAAI"},{"key":"e_1_3_2_2_8_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15","author":"Chitra Uthsav","year":"2019","unstructured":"Uthsav Chitra and Benjamin J. Raphael . 2019. Random Walks on Hypergraphs with Edge-Dependent Vertex Weights . In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15 June 2019 , Long Beach, California, USA. 1172--1181. http:\/\/proceedings.mlr.press\/v97\/chitra19a.html Uthsav Chitra and Benjamin J. Raphael. 2019. Random Walks on Hypergraphs with Edge-Dependent Vertex Weights. In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15 June 2019, Long Beach, California, USA. 1172--1181. http:\/\/proceedings.mlr.press\/v97\/chitra19a.html"},{"key":"e_1_3_2_2_9_1","unstructured":"Fan Chung. 1997. Spectral graph theory. Number 92. American Mathematical Soc.  Fan Chung. 1997. Spectral graph theory. Number 92. American Mathematical Soc."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-005-0237-z"},{"key":"e_1_3_2_2_11_1","volume-title":"Theoretical Computer Science","volume":"509","author":"Cooper Colin","year":"2013","unstructured":"Colin Cooper , Alan Frieze , and Tomasz Radzik . 2013 . The cover times of random walks on random uniform hypergraphs . Theoretical Computer Science , Vol. 509 (oct 2013), 51--69. https:\/\/doi.org\/10.1016\/j.tcs.2013.01.020 10.1016\/j.tcs.2013.01.020 Colin Cooper, Alan Frieze, and Tomasz Radzik. 2013. The cover times of random walks on random uniform hypergraphs. Theoretical Computer Science, Vol. 509 (oct 2013), 51--69. https:\/\/doi.org\/10.1016\/j.tcs.2013.01.020"},{"key":"e_1_3_2_2_12_1","unstructured":"Mihai Cucuringu Huan Li He Sun and Luca Zanetti. [n.d.]. Hermitian matrices for clustering directed graphs: insights and applications. arXiv:1908.02096 ([n. d.]). showeprint[arXiv]cs.LG\/1908.02096v1  Mihai Cucuringu Huan Li He Sun and Luca Zanetti. [n.d.]. Hermitian matrices for clustering directed graphs: insights and applications. arXiv:1908.02096 ([n. d.]). showeprint[arXiv]cs.LG\/1908.02096v1"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_2_14_1","volume-title":"Hybrid Clustering based on Content and Connection Structure using Joint Nonnegative Matrix Factorization. CoRR","author":"Du Rundong","year":"2017","unstructured":"Rundong Du , Barry L. Drake , and Haesun Park . 2017a. Hybrid Clustering based on Content and Connection Structure using Joint Nonnegative Matrix Factorization. CoRR , Vol. abs\/ 1703 .09646 ( 2017 ). arxiv: 1703.09646 http:\/\/arxiv.org\/abs\/1703.09646 Rundong Du, Barry L. Drake, and Haesun Park. 2017a. Hybrid Clustering based on Content and Connection Structure using Joint Nonnegative Matrix Factorization. CoRR, Vol. abs\/1703.09646 (2017). arxiv: 1703.09646 http:\/\/arxiv.org\/abs\/1703.09646"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40649-017-0043-5"},{"key":"e_1_3_2_2_16_1","unstructured":"D. Gleich. 2006. Hierarchical directed spectral graph partitioning. (2006).  D. Gleich. 2006. Hierarchical directed spectral graph partitioning. (2006)."},{"key":"e_1_3_2_2_17_1","first-page":"1","article-title":"Hermitian Adjacency Matrix of Digraphs and Mixed Graphs","volume":"85","author":"Guo Krystal","year":"2016","unstructured":"Krystal Guo and Bojan Mohar . 2016 . Hermitian Adjacency Matrix of Digraphs and Mixed Graphs . Journal of Graph Theory , Vol. 85 , 1 (jun 2016), 217--248. https:\/\/doi.org\/10.1002\/jgt.22057 10.1002\/jgt.22057 Krystal Guo and Bojan Mohar. 2016. Hermitian Adjacency Matrix of Digraphs and Mixed Graphs. Journal of Graph Theory, Vol. 85, 1 (jun 2016), 217--248. https:\/\/doi.org\/10.1002\/jgt.22057","journal-title":"Journal of Graph Theory"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"e_1_3_2_2_19_1","first-page":"2","article-title":"Two-mode networks exhibiting data loss","volume":"6","author":"Kirkland Steve","year":"2017","unstructured":"Steve Kirkland . 2017 . Two-mode networks exhibiting data loss . Journal of Complex Networks , Vol. 6 , 2 (aug 2017), 297--316. https:\/\/doi.org\/10.1093\/comnet\/cnx039 10.1093\/comnet Steve Kirkland. 2017. Two-mode networks exhibiting data loss. Journal of Complex Networks, Vol. 6, 2 (aug 2017), 297--316. https:\/\/doi.org\/10.1093\/comnet\/cnx039","journal-title":"Journal of Complex Networks"},{"key":"e_1_3_2_2_20_1","unstructured":"Da Kuang Chris Ding and Haesun Park. [n.d.]. Symmetric Nonnegative Matrix Factorization for Graph Clustering.  Da Kuang Chris Ding and Haesun Park. [n.d.]. Symmetric Nonnegative Matrix Factorization for Graph Clustering."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0247-2"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1274"},{"key":"e_1_3_2_2_23_1","unstructured":"Pan Li and Olgica Milenkovic. 2017. Inhomogeneous Hypergraph Clustering with Applications. arxiv: cs.LG\/1709.01249  Pan Li and Olgica Milenkovic. 2017. Inhomogeneous Hypergraph Clustering with Applications. arxiv: cs.LG\/1709.01249"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18009-5_8"},{"key":"e_1_3_2_2_25_1","first-page":"1","article-title":"Quantum walks on regular uniform hypergraphs","volume":"8","author":"Liu Ying","year":"2018","unstructured":"Ying Liu , Jiabin Yuan , Bojia Duan , and Dan Li . 2018 . Quantum walks on regular uniform hypergraphs . Scientific Reports , Vol. 8 , 1 (jun 2018). https:\/\/doi.org\/10.1038\/s41598-018-27825-z 10.1038\/s41598-018-27825-z Ying Liu, Jiabin Yuan, Bojia Duan, and Dan Li. 2018. Quantum walks on regular uniform hypergraphs. Scientific Reports, Vol. 8, 1 (jun 2018). https:\/\/doi.org\/10.1038\/s41598-018-27825-z","journal-title":"Scientific Reports"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.678151"},{"key":"e_1_3_2_2_27_1","volume-title":"Proceedings of AI and STATISTICS (AISTATS)","author":"Maila Marina","year":"2001","unstructured":"Marina Maila and Jianbo Shi . 2001 . A Random Walks View of Spectral Segmentation . In Proceedings of AI and STATISTICS (AISTATS) 2001. Marina Maila and Jianbo Shi. 2001. A Random Walks View of Spectral Segmentation. In Proceedings of AI and STATISTICS (AISTATS) 2001."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2019.09.024"},{"key":"e_1_3_2_2_29_1","volume-title":"Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic","author":"Ng Andrew Y.","year":"2001","unstructured":"Andrew Y. Ng , Michael I. Jordan , and Yair Weiss . 2001 . On Spectral Clustering: Analysis and an Algorithm . In Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic ( Vancouver, British Columbia, Canada) (NIPS'01). MIT Press, Cambridge, MA, USA, 849--856. Andrew Y. Ng, Michael I. Jordan, and Yair Weiss. 2001. On Spectral Clustering: Analysis and an Algorithm. In Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic (Vancouver, British Columbia, Canada) (NIPS'01). MIT Press, Cambridge, MA, USA, 849--856."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860485"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433471"},{"key":"e_1_3_2_2_32_1","volume-title":"Learning from Labeled and Unlabeled Data on a Directed Graph. Framework (01","author":"Zhou Dengyong","year":"2005","unstructured":"Dengyong Zhou , Jiayuan Huang , and Bernhard Schoelkopf . 2005. Learning from Labeled and Unlabeled Data on a Directed Graph. Framework (01 2005 ). https:\/\/doi.org\/10.1145\/1102351.1102482 10.1145\/1102351.1102482 Dengyong Zhou, Jiayuan Huang, and Bernhard Schoelkopf. 2005. Learning from Labeled and Unlabeled Data on a Directed Graph. Framework (01 2005). https:\/\/doi.org\/10.1145\/1102351.1102482"},{"key":"e_1_3_2_2_33_1","volume-title":"Advances in Neural Information Processing Systems 19","author":"Zhou Dengyong","unstructured":"Dengyong Zhou , Jiayuan Huang , and Bernhard Sch\u00f6lkopf . 2007. Learning with Hypergraphs: Clustering, Classification, and Embedding . In Advances in Neural Information Processing Systems 19 ,, B. Sch\u00f6lkopf, J. C. Platt, and T. Hoffman (Eds.). MIT Press , 1601--1608. http:\/\/papers.nips.cc\/paper\/3128-learning-with-hypergraphs-clustering-classification-and-embedding.pdf Dengyong Zhou, Jiayuan Huang, and Bernhard Sch\u00f6lkopf. 2007. Learning with Hypergraphs: Clustering, Classification, and Embedding. In Advances in Neural Information Processing Systems 19,, B. Sch\u00f6lkopf, J. C. Platt, and T. Hoffman (Eds.). MIT Press, 1601--1608. http:\/\/papers.nips.cc\/paper\/3128-learning-with-hypergraphs-clustering-classification-and-embedding.pdf"}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"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.3412034","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:02:29Z","timestamp":1750183349000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":33,"alternative-id":["10.1145\/3340531.3412034","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412034","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"}}]}}