{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T02:48:48Z","timestamp":1785898128281,"version":"3.56.0"},"reference-count":67,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2023YFB4503600"],"award-info":[{"award-number":["2023YFB4503600"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018806","name":"Hubei Province Department of Science and Technology","doi-asserted-by":"publisher","award":["2023BAB081"],"award-info":[{"award-number":["2023BAB081"]}],"id":[{"id":"10.13039\/501100018806","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202338"],"award-info":[{"award-number":["62202338"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.asoc.2026.115776","type":"journal-article","created":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T15:54:36Z","timestamp":1781625276000},"page":"115776","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Memory-efficient and scalable k-means with individual fairness"],"prefix":"10.1016","volume":"202","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6664-0770","authenticated-orcid":false,"given":"Xin","family":"Jin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengkun","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2911-0070","authenticated-orcid":false,"given":"Yuan","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3281-5939","authenticated-orcid":false,"given":"Dingwen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2026.115776_bib0005","series-title":"NeurIPS","article-title":"Constant approximation for individual preference stable clustering","author":"Aamand","year":"2023"},{"key":"10.1016\/j.asoc.2026.115776_bib0010","series-title":"KDD","first-page":"267","article-title":"Clustering without over-representation","author":"Ahmadian","year":"2019"},{"key":"10.1016\/j.asoc.2026.115776_bib0015","series-title":"SIGMOD","first-page":"49","article-title":"OPTICS: ordering points to identify the clustering structure","author":"Ankerst","year":"1999"},{"key":"10.1016\/j.asoc.2026.115776_bib0020","series-title":"ICML","article-title":"Scalable fair clustering","author":"Backurs","year":"2019"},{"key":"10.1016\/j.asoc.2026.115776_bib0025","series-title":"ICML","article-title":"Monotone individual fairness","author":"Bechavod","year":"2024"},{"key":"10.1016\/j.asoc.2026.115776_bib0030","series-title":"NIPS","first-page":"4955","article-title":"Fair algorithms for clustering","author":"Bera","year":"2019"},{"key":"10.1016\/j.asoc.2026.115776_bib0035","series-title":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","first-page":"2212","article-title":"Fairness in recommendation ranking through pairwise comparisons","author":"Beutel","year":"2019"},{"key":"10.1016\/j.asoc.2026.115776_bib0040","series-title":"NeurIPS","first-page":"129","article-title":"Convergence properties of the k-means algorithms","author":"Bottou","year":"1994"},{"key":"10.1016\/j.asoc.2026.115776_bib0045","series-title":"AAAI","first-page":"6822","article-title":"Fairness, semi-supervised learning, and more: a general framework for clustering with stochastic pairwise constraints","author":"Brubach","year":"2021"},{"key":"10.1016\/j.asoc.2026.115776_bib0050","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1109\/TKDE.2024.3508057","article-title":"FWCEC: an enhanced feature weighting method via causal effect for clustering","volume":"37","author":"Cao","year":"2025","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.asoc.2026.115776_bib0055","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.14778\/1920841.1920968","article-title":"Mining significant semantic locations from GPS data","volume":"3","author":"Cao","year":"2010","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.asoc.2026.115776_bib0060","series-title":"ICAIS","first-page":"6387","article-title":"A new notion of individually fair clustering: \u03b1-equitable k-center","author":"Chakrabarti","year":"2022"},{"key":"10.1016\/j.asoc.2026.115776_bib0065","series-title":"CIKM","first-page":"621","article-title":"Expected reciprocal rank for graded relevance","author":"Chapelle","year":"2009"},{"key":"10.1016\/j.asoc.2026.115776_bib0070","series-title":"NeurIPS","first-page":"5199","article-title":"SPANN: highly-efficient billion-scale approximate nearest neighborhood search","author":"Chen","year":"2021"},{"key":"10.1016\/j.asoc.2026.115776_bib0075","series-title":"AISTATS","first-page":"9603","article-title":"On coresets for fair regression and individually fair clustering","author":"Chhaya","year":"2022"},{"key":"10.1016\/j.asoc.2026.115776_bib0080","series-title":"NeurIPS","first-page":"5029","article-title":"Fair clustering through fairlets","author":"Chierichetti","year":"2017"},{"key":"10.1016\/j.asoc.2026.115776_bib0085","doi-asserted-by":"crossref","first-page":"337","DOI":"10.14778\/1687627.1687666","article-title":"Efficient retrieval of the top-k most relevant spatial web objects","volume":"2","author":"Cong","year":"2009","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.asoc.2026.115776_bib0090","series-title":"LREC","first-page":"1","article-title":"Evaluating web-based question answering systems","volume":"vol. 3","author":"Radev","year":"2002"},{"key":"10.1016\/j.asoc.2026.115776_bib0095","series-title":"SDM","first-page":"300","article-title":"A dual-tree algorithm for fast K-means clustering with large k","author":"Curtin","year":"2017"},{"key":"10.1016\/j.asoc.2026.115776_bib0100","series-title":"ICML","first-page":"579","article-title":"Yinyang K-means: a drop-in replacement of the classic K-means with consistent speedup","author":"Ding","year":"2015"},{"key":"10.1016\/j.asoc.2026.115776_bib0105","series-title":"Faster K-means clustering","author":"Drake","year":"2013"},{"key":"10.1016\/j.asoc.2026.115776_bib0110","doi-asserted-by":"crossref","first-page":"3083","DOI":"10.14778\/3476311.3476385","article-title":"Big metadata: when metadata is big data","volume":"14","author":"Edara","year":"2021","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.asoc.2026.115776_bib0115","series-title":"IAAI","first-page":"11847","article-title":"Causal adversarial perturbations for individual fairness and robustness in heterogeneous data spaces","author":"Ehyaei","year":"2024"},{"key":"10.1016\/j.asoc.2026.115776_bib0120","series-title":"ICML","first-page":"147","article-title":"Using the triangle inequality to accelerate K-means","author":"Elkan","year":"2003"},{"key":"10.1016\/j.asoc.2026.115776_bib0125","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/18M1209854","article-title":"Turning big data into tiny data: constant-size coresets for K-means, PCA, and projective clustering","volume":"49","author":"Feldman","year":"2020","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.asoc.2026.115776_bib0130","doi-asserted-by":"crossref","first-page":"2118","DOI":"10.14778\/3407790.3407813","article-title":"LOG-means: efficiently estimating the number of clusters in large datasets","volume":"13","author":"Fritz","year":"2020","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.asoc.2026.115776_bib0135","series-title":"Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency","first-page":"438","article-title":"Socially fair K-means clustering","author":"Ghadiri","year":"2021"},{"key":"10.1016\/j.asoc.2026.115776_bib0140","doi-asserted-by":"crossref","first-page":"757","DOI":"10.14778\/3067421.3067425","article-title":"Local search methods for K-means with outliers","volume":"10","author":"Gupta","year":"2017","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.asoc.2026.115776_bib0145","series-title":"SDM","first-page":"130","article-title":"Making K-means even faster","author":"Hamerly","year":"2010"},{"key":"10.1016\/j.asoc.2026.115776_bib0150","series-title":"Partitional Clustering Algorithms","first-page":"41","article-title":"Accelerating Lloyd\u2019s algorithm for K-means clustering","author":"Hamerly","year":"2014"},{"key":"10.1016\/j.asoc.2026.115776_bib0155","author":"Hossein Bateni"},{"key":"10.1016\/j.asoc.2026.115776_bib0160","series-title":"ICML","first-page":"13270","article-title":"Approximation algorithms for fair range clustering","author":"Hotegni","year":"2023"},{"key":"10.1016\/j.asoc.2026.115776_bib0165","series-title":"NeurIPS","article-title":"Coresets for clustering with fairness constraints","author":"Huang","year":"2019"},{"key":"10.1016\/j.asoc.2026.115776_bib0170","series-title":"FORC","first-page":":5:1","article-title":"Service in your neighborhood: fairness in center location","author":"Jung","year":"2020"},{"key":"10.1016\/j.asoc.2026.115776_bib0175","first-page":"111299","article-title":"Proportional fairness in clustering: a social choice perspective","volume":"37","author":"Kellerhals","year":"2024","journal-title":"NeurIPS"},{"key":"10.1016\/j.asoc.2026.115776_bib0180","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1162\/089976604773717621","article-title":"Stability-based validation of clustering solutions","volume":"16","author":"Lange","year":"2004","journal-title":"Neural Comput."},{"key":"10.1016\/j.asoc.2026.115776_bib0185","series-title":"IAAI","first-page":"14312","article-title":"Accurate fairness: improving individual fairness without trading accuracy","author":"Li","year":"2023"},{"key":"10.1016\/j.asoc.2026.115776_bib0190","series-title":"SIGMOD","first-page":"731","article-title":"Elastic machine learning algorithms in Amazon SageMaker","author":"Liberty","year":"2020"},{"key":"10.1016\/j.asoc.2026.115776_bib0195","series-title":"ICML","first-page":"6586","article-title":"Individual fairness for k-clustering","author":"Mahabadi","year":"2020"},{"key":"10.1016\/j.asoc.2026.115776_bib0200","series-title":"ICML","article-title":"Individual fairness for \u03ba-clustering","author":"Mahabadi","year":"2020"},{"key":"10.1016\/j.asoc.2026.115776_bib0205","series-title":"ICML","first-page":"775","article-title":"Metric learning to rank","author":"Mcfee","year":"2010"},{"key":"10.1016\/j.asoc.2026.115776_bib0210","series-title":"International Colloquium on Automata, Languages, and Programming (ICALP)","first-page":":85:1","article-title":"Proportionally fair clustering revisited","author":"Micha","year":"2020"},{"key":"10.1016\/j.asoc.2026.115776_bib0215","series-title":"UAI","first-page":"397","article-title":"The anchors hierarchy: using the triangle inequality to survive high dimensional data","author":"Moore","year":"2000"},{"key":"10.1016\/j.asoc.2026.115776_bib0220","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.14778\/3587136.3587147","article-title":"Marigold: efficient K-means clustering in high dimensions","volume":"16","author":"Mortensen","year":"2023","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.asoc.2026.115776_bib0225","doi-asserted-by":"crossref","DOI":"10.1126\/science.abg1780","article-title":"Big-data approaches lead to an increased understanding of the ecology of animal movement","volume":"375","author":"Nathan","year":"2022","journal-title":"Science"},{"key":"10.1016\/j.asoc.2026.115776_bib0230","series-title":"NIPS","first-page":"13340","article-title":"Better algorithms for individually fair k-clustering","author":"Negahbani","year":"2021"},{"key":"10.1016\/j.asoc.2026.115776_bib0235","series-title":"NeurIPS","first-page":"13340","article-title":"Better algorithms for individually fair k-clustering","author":"Negahbani","year":"2021"},{"key":"10.1016\/j.asoc.2026.115776_bib0240","series-title":"ICML","first-page":"936","article-title":"Fast K-means with accurate bounds","author":"Newling","year":"2016"},{"key":"10.1016\/j.asoc.2026.115776_bib0245","series-title":"NeurIPS","first-page":"5201","article-title":"K-Medoids for K-means seeding","author":"Newling","year":"2017"},{"key":"10.1016\/j.asoc.2026.115776_bib0250","series-title":"Five balltree construction algorithms","author":"Omohundro","year":"1989"},{"key":"10.1016\/j.asoc.2026.115776_bib0255","series-title":"NeurIPS","article-title":"Learning certified individually fair representations","author":"Ruoss","year":"2020"},{"key":"10.1016\/j.asoc.2026.115776_bib0260","series-title":"SDM","first-page":"324","article-title":"Geometric methods to accelerate k -means algorithms","author":"Ry\u0161av\u00fd","year":"2016"},{"key":"10.1016\/j.asoc.2026.115776_bib0265","series-title":"KDD","first-page":"1514","article-title":"Fair ranking as fair division: impact-based individual fairness in ranking","author":"Saito","year":"2022"},{"key":"10.1016\/j.asoc.2026.115776_bib0270","series-title":"NeurIPS","first-page":"8240","article-title":"Average individual fairness: algorithms, generalization and experiments","author":"Sharifi-Malvajerdi","year":"2019"},{"key":"10.1016\/j.asoc.2026.115776_bib0275","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TPAMI.2022.3148905","article-title":"Fair representation: guaranteeing approximate multiple group fairness for unknown tasks","volume":"45","author":"Shen","year":"2023","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.asoc.2026.115776_bib0280","first-page":"1150","article-title":"Cross-validation approach to evaluate clustering algorithms: an experimental study using multi-label datasets","volume":"20","author":"Tarekegn","year":"2020","journal-title":"J. Comput. Sci. Technol."},{"key":"10.1016\/j.asoc.2026.115776_bib0285","series-title":"ICML","article-title":"Frapp\u00c9: a group fairness framework for post-processing everything","author":"Tifrea","year":"2024"},{"key":"10.1016\/j.asoc.2026.115776_bib0290","series-title":"ICAIS","first-page":"8758","article-title":"Improved approximation algorithms for individually fair clustering","author":"Vakilian","year":"2022"},{"key":"10.1016\/j.asoc.2026.115776_bib0295","series-title":"SIGMOD","first-page":"1009","article-title":"Automatic database management system tuning through large-scale machine learning","author":"Van Aken","year":"2017"},{"key":"10.1016\/j.asoc.2026.115776_bib0300","first-page":"163","article-title":"On the efficiency of K-means clustering: evaluation, optimization, and algorithm selection","volume":"14","author":"Wang","year":"2020","journal-title":"PVLDB"},{"key":"10.1016\/j.asoc.2026.115776_bib0305","series-title":"SOSP","first-page":"545","article-title":"SPFresh: incremental in-place update for billion-scale vector search","author":"Xu","year":"2023"},{"key":"10.1016\/j.asoc.2026.115776_bib0310","series-title":"ICML","first-page":"40871","article-title":"Matrix estimation for individual fairness","author":"Zhang","year":"2023"},{"key":"10.1016\/j.asoc.2026.115776_bib0315","series-title":"Advances in Neural Information Processing Systems","first-page":"26525","article-title":"Label consistency in overfitted generalized K-means","author":"Zhang","year":"2021"},{"key":"10.1016\/j.asoc.2026.115776_bib0320","doi-asserted-by":"crossref","first-page":"3346","DOI":"10.14778\/3681954.3682005","article-title":"Searching data lakes for nested and joined data","volume":"17","author":"Zhang","year":"2024","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.asoc.2026.115776_bib0325","doi-asserted-by":"crossref","first-page":":241:1","DOI":"10.1145\/3626728","article-title":"F3KM: federated, fair, and fast K-means","volume":"1","author":"Zhu","year":"2023","journal-title":"Proc. ACM Manag. Data"},{"key":"10.1016\/j.asoc.2026.115776_bib0330","series-title":"AAAI","first-page":"11202","article-title":"Variational fair clustering","author":"Ziko","year":"2021"},{"key":"10.1016\/j.asoc.2026.115776_bib0335","first-page":"1","article-title":"Prerequisite-driven fair clustering on heterogeneous information networks","volume":"1","author":"Zhang","year":"2023","journal-title":"Proc. ACM Manag. Data"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S156849462601224X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S156849462601224X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T02:22:45Z","timestamp":1785896565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S156849462601224X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":67,"alternative-id":["S156849462601224X"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115776","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Memory-efficient and scalable -means with individual fairness","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115776","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115776"}}