{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T01:46:44Z","timestamp":1787881604993,"version":"build-2784847793"},"reference-count":48,"publisher":"Informa UK Limited","issue":"543","funder":[{"name":"HK RGC","award":["GRF-11303918"],"award-info":[{"award-number":["GRF-11303918"]}]},{"name":"HK RGC","award":["GRF-11300919"],"award-info":[{"award-number":["GRF-11300919"]}]},{"name":"HK RGC","award":["GRF-11304520"],"award-info":[{"award-number":["GRF-11304520"]}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the American Statistical Association"],"published-print":{"date-parts":[[2023,7,3]]},"DOI":"10.1080\/01621459.2021.2002157","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T17:38:33Z","timestamp":1636393113000},"page":"1620-1629","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":32,"title":["Community Detection in General Hypergraph Via Graph Embedding"],"prefix":"10.1080","volume":"118","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3724-9200","authenticated-orcid":false,"given":"Yaoming","family":"Zhen","sequence":"first","affiliation":[{"name":"School of Data Science, City University of Hong Kong, Kowloon, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junhui","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Data Science, City University of Hong Kong, Kowloon, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2022,1,13]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.89"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2837638"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21861"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.20429\/tag.2015.020205"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl370"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2016.1246365"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2928301"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"e_1_3_3_10_1","unstructured":"Dua D. and Graff C. (2019). UCI Machine Learning Repository [http:\/\/archive.ics.uci.edu\/ml]. Irvine CA: University of California School of Information and Computer Science."},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)90045-P"},{"key":"e_1_3_3_12_1","first-page":"397","volume-title":"Advances in Neural Information Processing Systems","author":"Ghoshdastidar D.","year":"2014","unstructured":"Ghoshdastidar, D., and Dukkipati, A. (2014), \u201cConsistency of Spectral Partitioning of Uniform Hypergraphs Under Planted Partition Model,\u201d in Advances in Neural Information Processing Systems 27, eds. Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N. D., and Weinberger, K. Q., pages 397\u2013405. Curran Associates, Inc."},{"key":"e_1_3_3_13_1","first-page":"400","volume-title":"Proceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 37 (ICML\u201915)","author":"Ghoshdastidar D.","year":"2015","unstructured":"Ghoshdastidar, D., and Dukkipati, A. (2015a), \u201cA Provable Generalized Tensor Spectral Method for Uniform Hypergraph Partitioning,\u201d in Proceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 37 (ICML\u201915), pp. 400\u2013409."},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9556"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1453"},{"key":"e_1_3_3_16_1","first-page":"1","article-title":"\u201cUniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques","volume":"18","author":"Ghoshdastidar D.","year":"2017","unstructured":"Ghoshdastidar, D., and Dukkipati, A. (2017b), \u201cUniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques,\u201d Journal of Machine Learning Research, 18, 1\u201341.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214502388618906"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOAS896"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1265"},{"key":"e_1_3_3_20_1","article-title":"\u201cCommunity Detection on Mixture Multi-Layer Networks Via Regularized Tensor Decomposition,\u201d","author":"Jing B.-Y.","year":"2021","unstructured":"Jing, B.-Y., Li, T., Lyu, Z., and Xia, D. (2021), \u201cCommunity Detection on Mixture Multi-Layer Networks Via Regularized Tensor Decomposition,\u201d arXiv:2002.04457.","journal-title":"arXiv:2002.04457"},{"key":"e_1_3_3_21_1","article-title":"\u201cCommunity Detection for Hypergraph Networks Via Regularized Tensor Power Iteration,\u201d","author":"Ke Z. T.","year":"2021","unstructured":"Ke, Z. T., Shi, F., and Xia, D. (2021), \u201cCommunity Detection for Hypergraph Networks Via Regularized Tensor Power Iteration,\u201d arXiv:1909.06503.","journal-title":"arXiv:1909.06503"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2017.8024470"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2789292"},{"key":"e_1_3_3_25_1","article-title":"\u201cHypergraph Clustering: A Modularity Maximization Approach,\u201d","author":"Kumar T.","year":"2021","unstructured":"Kumar, T., Vaidyanathan, S., Ananthapadmanabhan, H., Parthasarathy, S., and Ravindran, B. (2021), \u201cHypergraph Clustering: A Modularity Maximization Approach,\u201d arXiv:1812.10869.","journal-title":"arXiv:1812.10869"},{"key":"e_1_3_3_26_1","article-title":"\u201cHypergraph Clustering in The Weighted Stochastic Block Model Via Convex Relaxation of Truncated mle,\u201d","author":"Lee J.","year":"2021","unstructured":"Lee, J., Kim, D., and Chung, H. W. (2021), \u201cHypergraph Clustering in The Weighted Stochastic Block Model Via Convex Relaxation of Truncated mle,\u201d arXiv preprint arXiv:2003.10038.","journal-title":"arXiv preprint arXiv:2003.10038"},{"key":"e_1_3_3_27_1","first-page":"127","article-title":"\u201cTime-Dependent Community Structure in Legislation Cosponsorship Networks in The Congress of The Republic of Peru,\u201d","volume":"5","author":"Lee S. H.","year":"2017","unstructured":"Lee, S. H., Magallanes, J. M., and Porter, M. A. (2017), \u201cTime-Dependent Community Structure in Legislation Cosponsorship Networks in The Congress of The Republic of Peru,\u201d Journal of Complex Networks, 5, 127\u2013144.","journal-title":"Journal of Complex Networks"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asz068"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1274"},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asaa006"},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1214\/19-STS715"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/insr.12398"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1938"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"key":"e_1_3_3_35_1","article-title":"\u201cAdjacency and Tensor Representation in General Hypergraphs Part 1: E-Adjacency Tensor Uniformisation Using Homogeneous Polynomials,\u201d","author":"Ouvrard X.","year":"2021","unstructured":"Ouvrard, X., Goff, J.-M. L., and Marchand-Maillet, S. (2021), \u201cAdjacency and Tensor Representation in General Hypergraphs Part 1: E-Adjacency Tensor Uniformisation Using Homogeneous Polynomials,\u201d arXiv:1712.08189.","journal-title":"arXiv:1712.08189"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-013-1340-x"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.01.021"},{"key":"e_1_3_3_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.05.007"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/140989340"},{"key":"e_1_3_3_40_1","first-page":"1601","volume-title":"Learning With Hypergraphs: Clustering, Classification, and Embedding","author":"Sch\u00f6lkopf B.","year":"2007","unstructured":"Sch\u00f6lkopf, B., Platt, J., and Hofmann, T. (2007), Learning With Hypergraphs: Clustering, Classification, and Embedding, pp. 1601\u20131608. Pune: MITP."},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12245"},{"key":"e_1_3_3_42_1","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<229::AID-CEM587>3.0.CO;2-N"},{"key":"e_1_3_3_43_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2019.1705308"},{"key":"e_1_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382974"},{"key":"e_1_3_3_45_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asq061"},{"key":"e_1_3_3_46_1","article-title":"\u201cTesting Community Structures for Hypergraphs,\u201d","author":"Yuan M.","year":"2021","unstructured":"Yuan, M., Liu, R., Feng, Y., and Shang, Z. (2021), \u201cTesting Community Structures for Hypergraphs,\u201d arXiv:1810.04617.","journal-title":"arXiv:1810.04617"},{"key":"e_1_3_3_47_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2021.1887742"},{"key":"e_1_3_3_48_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1006642108"},{"key":"e_1_3_3_49_1","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1036"}],"container-title":["Journal of the American Statistical Association"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01621459.2021.2002157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T00:18:32Z","timestamp":1697156312000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01621459.2021.2002157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,13]]},"references-count":48,"journal-issue":{"issue":"543","published-print":{"date-parts":[[2023,7,3]]}},"alternative-id":["10.1080\/01621459.2021.2002157"],"URL":"https:\/\/doi.org\/10.1080\/01621459.2021.2002157","relation":{},"ISSN":["0162-1459","1537-274X"],"issn-type":[{"value":"0162-1459","type":"print"},{"value":"1537-274X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,13]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uasa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uasa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-04-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-30","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-01-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}