{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T10:15:31Z","timestamp":1781604931462,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18H05291,19K20218"],"award-info":[{"award-number":["18H05291,19K20218"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403248","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:03:59Z","timestamp":1597964639000},"page":"1970-1978","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Hypergraph Clustering Based on PageRank"],"prefix":"10.1145","author":[{"given":"Yuuki","family":"Takai","sequence":"first","affiliation":[{"name":"RIKEN AIP, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Atsushi","family":"Miyauchi","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masahiro","family":"Ikeda","sequence":"additional","affiliation":[{"name":"RIKEN AIP, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuichi","family":"Yoshida","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Sameer Agarwal Kristin Branson and Serge Belongie. 2006. Higher order learning with graphs. In ICML. 17--24. Sameer Agarwal Kristin Branson and Serge Belongie. 2006. Higher order learning with graphs. In ICML. 17--24.","DOI":"10.1145\/1143844.1143847"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Sameer Agarwal Jongwoo Lim Lihi Zelnik-Manor Pietro Perona David Kriegman and Serge Belongie. 2005. Beyond pairwise clustering. In CVPR. 838--845. Sameer Agarwal Jongwoo Lim Lihi Zelnik-Manor Pietro Perona David Kriegman and Serge Belongie. 2005. Beyond pairwise clustering. In CVPR. 838--845.","DOI":"10.1109\/CVPR.2005.89"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2007.10129139"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Reid Andersen and Yuval Peres. 2009. Finding sparse cuts locally using evolving sets. STOC. 235--244. Reid Andersen and Yuval Peres. 2009. Finding sparse cuts locally using evolving sets. STOC. 235--244.","DOI":"10.1145\/1536414.1536449"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90322-K"},{"key":"e_1_3_2_1_8_1","first-page":"15","article-title":"Spectral properties of hypergraph Laplacian and approximation algorithms","volume":"65","author":"Hubert Chan T-H","year":"2018","unstructured":"T-H Hubert Chan , Anand Louis , Zhihao Gavin Tang , and Chenzi Zhang . 2018 . Spectral properties of hypergraph Laplacian and approximation algorithms . J. ACM , Vol. 65 , 3 (2018), 15 -- 48 . T-H Hubert Chan, Anand Louis, Zhihao Gavin Tang, and Chenzi Zhang. 2018. Spectral properties of hypergraph Laplacian and approximation algorithms. J. ACM, Vol. 65, 3 (2018), 15--48.","journal-title":"J. ACM"},{"key":"e_1_3_2_1_9_1","unstructured":"I Chien Chung-Yi Lin and I-Hsiang Wang. 2018. Community detection in hypergraphs: Optimal statistical limit and efficient algorithms. In AISTATS. 871--879. I Chien Chung-Yi Lin and I-Hsiang Wang. 2018. Community detection in hypergraphs: Optimal statistical limit and efficient algorithms. In AISTATS. 871--879."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0708838104"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000022288.19776.77"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_1_13_1","volume-title":"Polynomial-time algorithms for submodular Laplacian systems. arXiv preprint, arXiv:1803.10923","author":"Fujii Kaito","year":"2018","unstructured":"Kaito Fujii , Tasuku Soma , and Yuichi Yoshida . 2018. Polynomial-time algorithms for submodular Laplacian systems. arXiv preprint, arXiv:1803.10923 ( 2018 ). Kaito Fujii, Tasuku Soma, and Yuichi Yoshida. 2018. Polynomial-time algorithms for submodular Laplacian systems. arXiv preprint, arXiv:1803.10923 (2018)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Shayan Oveis Gharan and Luca Trevisan. 2012. Approximating the expansion profile and almost optimal local graph clustering. In FOCS. 187--196. Shayan Oveis Gharan and Luca Trevisan. 2012. Approximating the expansion profile and almost optimal local graph clustering. In FOCS. 187--196.","DOI":"10.1109\/FOCS.2012.85"},{"key":"e_1_3_2_1_15_1","unstructured":"Debarghya Ghoshdastidar and Ambedkar Dukkipati. 2014. Consistency of spectral partitioning of uniform hypergraphs under planted partition model. In NIPS. 397--405. Debarghya Ghoshdastidar and Ambedkar Dukkipati. 2014. Consistency of spectral partitioning of uniform hypergraphs under planted partition model. In NIPS. 397--405."},{"key":"e_1_3_2_1_16_1","volume-title":"Finding Cheeger cuts in hypergraphs via heat equation. arXiv preprint arXiv:1809.04396","author":"Ikeda Masahiro","year":"2018","unstructured":"Masahiro Ikeda , Atsushi Miyauchi , Yuuki Takai , and Yuichi Yoshida . 2018. Finding Cheeger cuts in hypergraphs via heat equation. arXiv preprint arXiv:1809.04396 ( 2018 ). Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, and Yuichi Yoshida. 2018. Finding Cheeger cuts in hypergraphs via heat equation. arXiv preprint arXiv:1809.04396 (2018)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In WWW. 271--279. Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In WWW. 271--279.","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_1_18_1","volume-title":"Gleich","author":"Kloster Kyle","year":"2014","unstructured":"Kyle Kloster and David F . Gleich . 2014 . Heat kernel based community detection. In KDD. 1386--1395. Kyle Kloster and David F. Gleich. 2014. Heat kernel based community detection. In KDD. 1386--1395."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1079816"},{"key":"e_1_3_2_1_20_1","unstructured":"Marius Leordeanu and Cristian Sminchisescu. 2012. Efficient hypergraph clustering. In AISTATS. 676--684. Marius Leordeanu and Cristian Sminchisescu. 2012. Efficient hypergraph clustering. In AISTATS. 676--684."},{"key":"e_1_3_2_1_21_1","unstructured":"Pan Li Niao He and Olgica Milenkovic. 2018. Quadratic decomposable submodular function minimization. In NeurIPS. 1054--1064. Pan Li Niao He and Olgica Milenkovic. 2018. Quadratic decomposable submodular function minimization. In NeurIPS. 1054--1064."},{"key":"e_1_3_2_1_22_1","unstructured":"Hairong Liu Longin J. Latecki and Shuicheng Yan. 2010. Robust clustering as ensembles of affinity relations. In NIPS. 1414--1422. Hairong Liu Longin J. Latecki and Shuicheng Yan. 2010. Robust clustering as ensembles of affinity relations. In NIPS. 1414--1422."},{"key":"e_1_3_2_1_23_1","first-page":"1113","article-title":"Evolution Equations for Maximal Monotone Operators: Asymptotic Analysis in Continuous and Discrete Time","volume":"17","author":"Peypouquet Juan","year":"2010","unstructured":"Juan Peypouquet and Sylvain Sorin . 2010 . Evolution Equations for Maximal Monotone Operators: Asymptotic Analysis in Continuous and Discrete Time . Journal of Convex Analysis , Vol. 17 , 3&4 (2010), 1113 -- 1163 . Juan Peypouquet and Sylvain Sorin. 2010. Evolution Equations for Maximal Monotone Operators: Asymptotic Analysis in Continuous and Discrete Time. Journal of Convex Analysis, Vol. 17, 3&4 (2010), 1113--1163.","journal-title":"Journal of Convex Analysis"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081080290011692"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.226"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/080744888"},{"key":"e_1_3_2_1_27_1","unstructured":"Yuuki Takai Atsushi Miyauchi Masahiro Ikeda and Yuichi Yoshida. 2020. Hypergraph Clustering Based on PageRank. (2020). arxiv: cs.DS\/2006.08302 Yuuki Takai Atsushi Miyauchi Masahiro Ikeda and Yuichi Yoshida. 2020. Hypergraph Clustering Based on PageRank. (2020). arxiv: cs.DS\/2006.08302"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Yuichi Yoshida. 2016. Nonlinear Laplacian for digraphs and its applications to network analysis. In WSDM. 483--492. Yuichi Yoshida. 2016. Nonlinear Laplacian for digraphs and its applications to network analysis. In WSDM. 483--492.","DOI":"10.1145\/2835776.2835785"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Yuichi Yoshida. 2019. Cheeger inequalities for submodular transformations. In SODA. 2582--2601. Yuichi Yoshida. 2019. Cheeger inequalities for submodular transformations. In SODA. 2582--2601.","DOI":"10.1137\/1.9781611975482.160"},{"key":"e_1_3_2_1_30_1","volume-title":"Beyond pairwise classification and clustering using hypergraphs","author":"Zhou Dengyong","year":"2005","unstructured":"Dengyong Zhou , Jiayuan Huang , and Bernhard Sch\u00f6lkopf . 2005. Beyond pairwise classification and clustering using hypergraphs . Max Plank Institute for Biological Cybernetics , T\u00fcbingen, Germany ( 2005 ). Dengyong Zhou, Jiayuan Huang, and Bernhard Sch\u00f6lkopf. 2005. Beyond pairwise classification and clustering using hypergraphs. Max Plank Institute for Biological Cybernetics, T\u00fcbingen, Germany (2005)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2007. Learning with hypergraphs: Clustering classification and embedding. In NIPS. 1601--1608. Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2007. Learning with hypergraphs: Clustering classification and embedding. In NIPS. 1601--1608.","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"e_1_3_2_1_32_1","first-page":"1389","article-title":"Multilevel spectral hypergraph partitioning with arbitrary vertex sizes","volume":"18","author":"Zien Jason Y.","year":"1999","unstructured":"Jason Y. Zien , Martin D. F. Schlag , and Pak K. Chan . 1999 . Multilevel spectral hypergraph partitioning with arbitrary vertex sizes . IEEE Transactions on Pattern Analysis and Machine Intelligence , Vol. 18 , 9 (1999), 1389 -- 1399 . Jason Y. Zien, Martin D. F. Schlag, and Pak K. Chan. 1999. Multilevel spectral hypergraph partitioning with arbitrary vertex sizes. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 18, 9 (1999), 1389--1399.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403248","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:47Z","timestamp":1750197707000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":32,"alternative-id":["10.1145\/3394486.3403248","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403248","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}