{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T20:47:40Z","timestamp":1775594860405,"version":"3.50.1"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"name":"NSF &#x28;National Science Foundation&#x29;","award":["DBI-2327954"],"award-info":[{"award-number":["DBI-2327954"]}]},{"name":"NSF &#x28;National Science Foundation&#x29;","award":["CCF-2106621"],"award-info":[{"award-number":["CCF-2106621"]}]},{"name":"Amazon Web Services","award":["Amazon Research Awards"],"award-info":[{"award-number":["Amazon Research Awards"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2026,4,2]]},"abstract":"<jats:p>\n                    As a data preprocessing step, clustering high-dimensional vector streams plays a critical role in many applications such as recommendation, community detection in social networks, and anomaly detection in large-scale computer networks. In this work, we propose a scalable framework, Suffice, to cluster high-dimensional vectors in streaming environments that continuously experience three fundamental types of data update including entry values, vectors, and dimensions. Suffice features a new clustering definition that is native to the dynamic and high-dimensional nature of vector streams. Moreover, it incorporates two key optimizations. First, to minimize the frequency of pairwise similarity comparisons between vectors, we design an adaptive multiple reference strategy that dynamically selects multiple reference vectors per cluster. Each reference vector in a cluster is associated with a\n                    <jats:italic toggle=\"yes\">safe region<\/jats:italic>\n                    such that any vector falling into it is guaranteed to belong to this cluster. We design a reward function to select reference vectors that jointly maximize the size of the safe region, thus minimizing the chance of conducting extra similarity comparisons when determining the cluster membership of incoming vectors. Second, we introduce a double-hash structure that efficiently supports both nearest neighbor-based and furthest neighbor-based similarity searches, critical to selecting and searching reference vectors. Using both real-world and synthetic streaming datasets, our comprehensive experimental studies confirm that Suffice outperforms baselines with a speedup from 18\u00d7 to 120\u00d7 in run time and demonstrate the superiority of our proposed cluster definition in cluster quality.\n                  <\/jats:p>","DOI":"10.1145\/3786694","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T17:54:13Z","timestamp":1775584453000},"page":"1-26","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Clustering Over High Dimensional Vector Streams"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0539-9013","authenticated-orcid":false,"given":"Han","family":"Han","sequence":"first","affiliation":[{"name":"University of Arizona, Tucson, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5333-8465","authenticated-orcid":false,"given":"Beichuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9909-8607","authenticated-orcid":false,"given":"Lei","family":"Cao","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Principal component analysis","author":"Abdi Herv\u00e9","year":"2010","unstructured":"Herv\u00e9 Abdi and Lynne J Williams. 2010. Principal component analysis. Wiley interdisciplinary reviews: computational statistics, Vol. 2, 4 (2010), 433-459."},{"key":"e_1_2_1_2_1","first-page":"2","article-title":"Streamkm a clustering algorithm for data streams","volume":"17","author":"Ackermann Marcel R","year":"2012","unstructured":"Marcel R Ackermann, Marcus M\u00e4rtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, and Christian Sohler. 2012. Streamkm a clustering algorithm for data streams. Journal of Experimental Algorithmics (JEA), Vol. 17 (2012), 2-1.","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44503-X_27"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2622240"},{"key":"e_1_2_1_5_1","volume-title":"High-dimensional clustering via random projections. Journal of Classification","author":"Anderlucci Laura","year":"2022","unstructured":"Laura Anderlucci, Francesca Fortunato, and Angela Montanari. 2022. High-dimensional clustering via random projections. Journal of Classification (2022), 1-26."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3163362"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1062023.1710967"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v14i1.7347"},{"key":"e_1_2_1_9_1","volume-title":"Review of clustering-based recommender systems. arXiv preprint arXiv:2109.12839","author":"Beregovskaya Irina","year":"2021","unstructured":"Irina Beregovskaya and Mikhail Koroteev. 2021. Review of clustering-based recommender systems. arXiv preprint arXiv:2109.12839 (2021)."},{"key":"e_1_2_1_10_1","volume-title":"Dhruba Kumar Bhattacharyya, and Jugal K Kalita","author":"Bhuyan Monowar H","year":"2013","unstructured":"Monowar H Bhuyan, Dhruba Kumar Bhattacharyya, and Jugal K Kalita. 2013. Network anomaly detection: methods, systems and tools. Ieee communications surveys & tutorials, Vol. 16, 1 (2013), 303-336."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.29"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.0105"},{"key":"e_1_2_1_13_1","volume-title":"Hierarchical Sparse Representation Clustering for High-Dimensional Data Streams. arXiv preprint arXiv:2409.04698","author":"Chen Jie","year":"2024","unstructured":"Jie Chen, Hua Mao, Yuanbiao Gou, and Xi Peng. 2024. Hierarchical Sparse Representation Clustering for High-Dimensional Data Streams. arXiv preprint arXiv:2409.04698 (2024)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281210"},{"key":"e_1_2_1_15_1","volume-title":"Supervised community detection with line graph neural networks. arXiv preprint arXiv:1705.08415","author":"Chen Zhengdao","year":"2017","unstructured":"Zhengdao Chen, Xiang Li, and Joan Bruna. 2017. Supervised community detection with line graph neural networks. arXiv preprint arXiv:1705.08415 (2017)."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1186\/s41044-016-0011-3"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2522412"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2707600"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.02.025"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.3390\/electronics11010141"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386367.3432731"},{"key":"e_1_2_1_22_1","unstructured":"Yongjae Lee and Woo Chang Kim. 2014. Concise formulas for the surface area of the intersection of two hyperspherical caps. KAIST Technical Report (2014)."},{"key":"e_1_2_1_23_1","volume-title":"Links: A high-dimensional online clustering method. arXiv preprint arXiv:1801.10123","author":"Mansfield Philip Andrew","year":"2018","unstructured":"Philip Andrew Mansfield, Quan Wang, Carlton Downey, Li Wan, and Ignacio Lopez Moreno. 2018. Links: A high-dimensional online clustering method. arXiv preprint arXiv:1801.10123 (2018)."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpa.2024.100635"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00077-9"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.85"},{"key":"e_1_2_1_27_1","volume-title":"The analysis of social networks. Health services and outcomes research methodology","author":"James O'malley A","year":"2008","unstructured":"A James O'malley and Peter V Marsden. 2008. The analysis of social networks. Health services and outcomes research methodology, Vol. 8, 4 (2008), 222-269."},{"key":"e_1_2_1_28_1","volume-title":"Determination of the Minimum Enclosing Cone of a Finite Collection of Cones Sharing the Same Vertex. Available at SSRN 4801268","author":"Patra Bibekananda","year":"2024","unstructured":"Bibekananda Patra and Sandipan Bandyopadhyay. 2024. Determination of the Minimum Enclosing Cone of a Finite Collection of Cones Sharing the Same Vertex. Available at SSRN 4801268 (2024)."},{"key":"e_1_2_1_29_1","first-page":"905","article-title":"An evaluation of criteria for measuring the quality of clusters","volume":"99","author":"Raskutti Bhavani","year":"1999","unstructured":"Bhavani Raskutti and Christopher Leckie. 1999. An evaluation of criteria for measuring the quality of clusters. In Ijcai, Vol. 99. 905-910.","journal-title":"Ijcai"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Yakov Rekhter Tony Li and Susan Hares. 2006. A border gateway protocol 4 (BGP-4). Technical Report.","DOI":"10.17487\/rfc4271"},{"key":"e_1_2_1_31_1","unstructured":"RetailRocket. 2017. RetailRocket Recommender System Dataset [Online]. https:\/\/www.kaggle.com\/datasets\/retailrocket\/ecommerce-dataset."},{"key":"e_1_2_1_32_1","unstructured":"RIPE NCC. 2014. RIPE RIS Raw Data and RIB Snapshots. https:\/\/ris.ripe.net\/."},{"key":"e_1_2_1_33_1","volume-title":"Community discovery in dynamic networks: a survey. ACM computing surveys (CSUR)","author":"Rossetti Giulio","year":"2018","unstructured":"Giulio Rossetti and R\u00e9my Cazabet. 2018. Community discovery in dynamic networks: a survey. ACM computing surveys (CSUR), Vol. 51, 2 (2018), 1-37."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72079-9_9"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2024.110926"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914237"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794370"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1002\/wics.1461"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1519065.1519089"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063694"},{"key":"e_1_2_1_42_1","volume-title":"Streaming adaptive nonparametric variational autoencoder. arXiv preprint arXiv:1906.03288","author":"Zhao Tingting","year":"2019","unstructured":"Tingting Zhao, Zifeng Wang, Aria Masoomi, and Jennifer G Dy. 2019. Streaming adaptive nonparametric variational autoencoder. arXiv preprint arXiv:1906.03288 (2019)."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3786694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T19:55:17Z","timestamp":1775591717000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3786694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,2]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4,2]]}},"alternative-id":["10.1145\/3786694"],"URL":"https:\/\/doi.org\/10.1145\/3786694","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,2]]}}}