{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T13:25:09Z","timestamp":1780061109230,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["G2019KY0501"],"award-info":[{"award-number":["G2019KY0501"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018AAA0101902"],"award-info":[{"award-number":["2018AAA0101902"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Natural Science Foundation of China","award":["62176212, 61936014, 61772427"],"award-info":[{"award-number":["62176212, 61936014, 61772427"]}]},{"DOI":"10.13039\/501100017596","name":"Natural Science Basic Research Program of Shaanxi Province","doi-asserted-by":"publisher","award":["2021JM-071"],"award-info":[{"award-number":["2021JM-071"]}],"id":[{"id":"10.13039\/501100017596","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557690","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:22:22Z","timestamp":1665883342000},"page":"4279-4283","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Scalable Multiple Kernel\n            <i>k<\/i>\n            -means Clustering"],"prefix":"10.1145","author":[{"given":"Yihang","family":"Lu","sequence":"first","affiliation":[{"name":"Northwestern Polytechnical University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haonan","family":"Xin","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Wang","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feiping","family":"Nie","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuelong","family":"Li","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. IJCAI. 3476--3482","author":"Du Liang","year":"2015","unstructured":"Liang Du , Peng Zhou , Lei Shi , Hanmo Wang , Mingyu Fan , Wenjian Wang , and Yi-Dong Shen . 2015 . Robust multiple kernel k-means using ell_2,1-norm . In Proc. IJCAI. 3476--3482 . Liang Du, Peng Zhou, Lei Shi, Hanmo Wang, Mingyu Fan, Wenjian Wang, and Yi-Dong Shen. 2015. Robust multiple kernel k-means using ell_2,1-norm. In Proc. IJCAI. 3476--3482."},{"key":"e_1_3_2_1_2_1","volume-title":"Margolin","author":"Mehmet G\u00f6","year":"2014","unstructured":"Mehmet G\u00f6 nen and Adam A . Margolin . 2014 . Localized data fusion for kernel k-means clustering with application to cancer biology. In Proc. NeurIPS. 1305--1313. Mehmet G\u00f6 nen and Adam A. Margolin. 2014. Localized data fusion for kernel k-means clustering with application to cancer biology. In Proc. NeurIPS. 1305--1313."},{"key":"e_1_3_2_1_3_1","first-page":"100","article-title":"Algorithm AS 136: A k-means clustering algorithm","volume":"28","author":"Hartigan J. A.","year":"1979","unstructured":"J. A. Hartigan and M. A. Wong . 1979 . Algorithm AS 136: A k-means clustering algorithm . J. Roy. Stat. Soc. , Vol. 28 , 1 (1979), 100 -- 108 . J. A. Hartigan and M. A. Wong. 1979. Algorithm AS 136: A k-means clustering algorithm. J. Roy. Stat. Soc., Vol. 28, 1 (1979), 100--108.","journal-title":"J. Roy. Stat. Soc."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2796860"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_3_2_1_6_1","first-page":"2872","article-title":"Optimal Neighborhood Multiple Kernel Clustering With Adaptive Local Kernels","volume":"34","author":"Liu Jiyuan","year":"2022","unstructured":"Jiyuan Liu , Xinwang Liu , Jian Xiong , Qing Liao , Sihang Zhou , Siwei Wang , and Yuexiang Yang . 2022 . Optimal Neighborhood Multiple Kernel Clustering With Adaptive Local Kernels . IEEE Trans. Knowl. Data Eng. , Vol. 34 , 6 (2022), 2872 -- 2885 . Jiyuan Liu, Xinwang Liu, Jian Xiong, Qing Liao, Sihang Zhou, Siwei Wang, and Yuexiang Yang. 2022. Optimal Neighborhood Multiple Kernel Clustering With Adaptive Local Kernels. IEEE Trans. Knowl. Data Eng., Vol. 34, 6 (2022), 2872--2885.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10249"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10895"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9746905"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9747734"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02547521"},{"key":"e_1_3_2_1_12_1","volume-title":"Digital signal processing with Kernel methods","author":"Rojo-\u00c1lvarez Jos\u00e9 Luis","unstructured":"Jos\u00e9 Luis Rojo-\u00c1lvarez , Manel Mart'inez-Ram\u00f3n , Jordi Munoz-Mari , and Gustau Camps-Valls . 2018. Digital signal processing with Kernel methods . John Wiley & Sons . Jos\u00e9 Luis Rojo-\u00c1lvarez, Manel Mart'inez-Ram\u00f3n, Jordi Munoz-Mari, and Gustau Camps-Valls. 2018. Digital signal processing with Kernel methods. John Wiley & Sons."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017467"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.98"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2021.3056889"},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. AISTATS. 2185--2195","author":"Vankadara Leena Chennuru","year":"2020","unstructured":"Leena Chennuru Vankadara and Debarghya Ghoshdastidar . 2020 . On the optimality of kernels for high-dimensional clustering . In Proc. AISTATS. 2185--2195 . Leena Chennuru Vankadara and Debarghya Ghoshdastidar. 2020. On the optimality of kernels for high-dimensional clustering. In Proc. AISTATS. 2185--2195."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/428"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2022.3141612"},{"key":"e_1_3_2_1_19_1","article-title":"Scalable Kernel K-Means Clustering with Nystr\u00f6m Approximation","volume":"20","author":"Wang Shusen","year":"2019","unstructured":"Shusen Wang , Alex Gittens , and Michael W. Mahoney . 2019 . Scalable Kernel K-Means Clustering with Nystr\u00f6m Approximation : Relative-Error Bounds. J. Mach. Learn. Res. , Vol. 20 (2019), 12:1--12:49. Shusen Wang, Alex Gittens, and Michael W. Mahoney. 2019. Scalable Kernel K-Means Clustering with Nystr\u00f6m Approximation: Relative-Error Bounds. J. Mach. Learn. Res., Vol. 20 (2019), 12:1--12:49.","journal-title":"Relative-Error Bounds. J. Mach. Learn. Res."},{"key":"e_1_3_2_1_20_1","article-title":"Towards More Efficient SPSD Matrix Approximation and CUR Matrix Decomposition","volume":"17","author":"Wang Shusen","year":"2016","unstructured":"Shusen Wang , Zhihua Zhang , and Tong Zhang . 2016 . Towards More Efficient SPSD Matrix Approximation and CUR Matrix Decomposition . J. Mach. Learn. Res. , Vol. 17 (2016), 210:1--210:49. Shusen Wang, Zhihua Zhang, and Tong Zhang. 2016. Towards More Efficient SPSD Matrix Approximation and CUR Matrix Decomposition. J. Mach. Learn. Res., Vol. 17 (2016), 210:1--210:49.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_21_1","volume-title":"Seeger","author":"Williams Christopher K. I.","year":"2000","unstructured":"Christopher K. I. Williams and Matthias W . Seeger . 2000 . Using the Nystr\u00f6 m Method to Speed Up Kernel Machines. In Proc .NeurIPS. 682--688. Christopher K. I. Williams and Matthias W. Seeger. 2000. Using the Nystr\u00f6 m Method to Speed Up Kernel Machines. In Proc.NeurIPS. 682--688."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3008694"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. NeurIPS. 485--493","author":"Yang Tianbao","year":"2012","unstructured":"Tianbao Yang , Yu-Feng Li , Mehrdad Mahdavi , Rong Jin , and Zhi-Hua Zhou . 2012 . Nystr\u00f6 m Method vs Random Fourier Features: A Theoretical and Empirical Comparison . In Proc. NeurIPS. 485--493 . Tianbao Yang, Yu-Feng Li, Mehrdad Mahdavi, Rong Jin, and Zhi-Hua Zhou. 2012. Nystr\u00f6 m Method vs Random Fourier Features: A Theoretical and Empirical Comparison. In Proc. NeurIPS. 485--493."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3026532"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.255"}],"event":{"name":"CIKM '22: The 31st ACM International Conference on Information and Knowledge Management","location":"Atlanta GA USA","acronym":"CIKM '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 31st ACM International Conference on Information &amp; Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557690","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:49Z","timestamp":1750182529000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":25,"alternative-id":["10.1145\/3511808.3557690","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557690","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2022-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}