Asymptotic theory of geometric and adaptive k-means clustering
几何与自适应 k 均值聚类的渐近理论AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论一般聚类的几何与渐近理论,未明确对应所列经济计量细分方向。
反馈分类问题几何与自适应 k 均值聚类的渐近理论AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We revisit Pollard’s classical result on consistency for k-means clustering in Euclidean space, with a focus on extensions in two directions: first, to problems where the data may come from interesting geometric settings (e.g., Riemannian manifolds, reflexive Banach spaces or the Wasserstein space); second, to problems where some parameters are chosen adaptively from the data (e.g., k-medoids or elbow-method k-means). Toward this end, we provide a general theory, which shows that all clustering procedures described above are strongly consistent. In fact, our method of proof allows us to derive many asymptotic limit theorems beyond strong consistency. We also remove all assumptions about uniqueness of the set of optimal cluster centers.