{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:02:31Z","timestamp":1775016151419,"version":"3.50.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["MRI #1725573"],"award-info":[{"award-number":["MRI #1725573"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS #1522751"],"award-info":[{"award-number":["DMS #1522751"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NRT #1633608"],"award-info":[{"award-number":["NRT #1633608"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2022,6,1]]},"DOI":"10.1109\/tkde.2020.3017120","type":"journal-article","created":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T21:54:24Z","timestamp":1597701264000},"page":"2771-2782","source":"Crossref","is-referenced-by-count":14,"title":["Hypergraph Partitioning With Embeddings"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5073-0122","authenticated-orcid":false,"given":"Justin","family":"Sybrandt","sequence":"first","affiliation":[{"name":"School of Computing, Clemson University, Clemson, SC, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8657-2848","authenticated-orcid":false,"given":"Ruslan","family":"Shaydulin","sequence":"additional","affiliation":[{"name":"School of Computing, Clemson University, Clemson, SC, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6284-7408","authenticated-orcid":false,"given":"Ilya","family":"Safro","sequence":"additional","affiliation":[{"name":"School of Computing, Clemson University, Clemson, SC, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"ref3","first-page":"2427","article-title":"The total variation on hypergraphs-learning on hypergraphs revisited","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Hein"},{"key":"ref4","first-page":"4026","article-title":"Re-revisiting learning on hypergraphs: Confidence interval and subgradient method","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71351-7_21"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(90)90099-N"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2010\/10\/P10005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-92106-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205475"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/17M1152735"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/180\/1\/012008"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639359"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412232"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-019-05800-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974317.5"},{"key":"ref19","first-page":"21:1","article-title":"Improving coarsening schemes for hypergraph partitioning by exploiting community structure","volume-title":"Proc. 16th Int. Symp. Exp. Algorithms","author":"Heuer"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143847"},{"key":"ref21","article-title":"First-and High-Order Bipartite Embeddings","author":"Sybrandt","year":"2019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036"},{"key":"ref24","article-title":"hMETIS 1.5: A hypergraph partitioning package","author":"Karypis","year":"1998"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09766-4_93"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3329872"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/s1064827595287997"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4330060203"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502409019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.11.002"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/090775087"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/100791142"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"Newman","year":"2010"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/62882.62910"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_40"},{"key":"ref38","article-title":"Aggregative coarsening for multilevel hypergraph partitioning","volume-title":"Proc. 17th Int. Symp. Exp. Algorithms","author":"Shaydulin"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref40","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Mikolov"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209987"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"ref44","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10179"},{"key":"ref46","article-title":"PyTorch-BigGraph: A large-scale graph embedding system","volume-title":"Proc. 2nd Syst. Mach. Conf.","author":"Lerer"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref48","first-page":"693","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","author":"Recht","year":"2011","journal-title":"Advances Neural Inf. Process. Syst."},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2670338"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401972"},{"key":"ref51","volume-title":"Strategic Logistics Management","author":"Stock","year":"2006"},{"key":"ref52","article-title":"Parallel algorithms for hypergraph partitioning","author":"Trifunovic","year":"2006"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.07.030"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/69\/9765561\/9169850-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9765561\/09169850.pdf?arnumber=9169850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:44:24Z","timestamp":1704840264000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9169850\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,1]]},"references-count":54,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2020.3017120","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,1]]}}}