{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:58Z","timestamp":1750220638485,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T00:00:00Z","timestamp":1606694400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS Grant-in-Aid for Scientific Research","award":["No.20K11940"],"award-info":[{"award-number":["No.20K11940"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,30]]},"DOI":"10.1145\/3428757.3429095","type":"proceedings-article","created":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T11:29:07Z","timestamp":1611746947000},"page":"115-124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast Clustering of Hypergraphs Based on Bipartite-Edge Restoration and Node Reachability"],"prefix":"10.1145","author":[{"given":"Shuta","family":"Ito","sequence":"first","affiliation":[{"name":"School of Computer Science, Tokyo University of Technology, Hachioji, Tokyo, Japan"}]},{"given":"Takayasu","family":"Fushimi","sequence":"additional","affiliation":[{"name":"School of Computer Science, Tokyo University of Technology, Hachioji, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2021,1,27]]},"reference":[{"volume-title":"Proceedings of the VLDB Workshop on Data Mining in Bioinformatics.","author":"Ahmad W.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2837638"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature09182"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2458782"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"B. Kami\u0144ski V. Poulin P. Pralat P. Szufel and F. Th\u00e9berge. 2019. Clustering via hypergraph modularity. PLOS ONE 14 11 (11 2019) 1--15. https:\/\/doi.org\/10.1371\/journal.pone.0224307  B. Kami\u0144ski V. Poulin P. Pralat P. Szufel and F. Th\u00e9berge. 2019. Clustering via hypergraph modularity. PLOS ONE 14 11 (11 2019) 1--15. https:\/\/doi.org\/10.1371\/journal.pone.0224307","DOI":"10.1371\/journal.pone.0224307"},{"volume-title":"Hypergraph Clustering: A Modularity Maximization Approach. CoRR abs\/1812.10869","year":"2018","author":"Kumar T.","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310594"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.784130"}],"event":{"name":"iiWAS '20: The 22nd International Conference on Information Integration and Web-based Applications & Services","sponsor":["Johannes Kepler University, Linz, Austria"],"location":"Chiang Mai Thailand","acronym":"iiWAS '20"},"container-title":["Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3428757.3429095","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3428757.3429095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:59Z","timestamp":1750197719000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3428757.3429095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,30]]},"references-count":15,"alternative-id":["10.1145\/3428757.3429095","10.1145\/3428757"],"URL":"https:\/\/doi.org\/10.1145\/3428757.3429095","relation":{},"subject":[],"published":{"date-parts":[[2020,11,30]]},"assertion":[{"value":"2021-01-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}