arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.19247cs.LG
收藏

双曲球中的聚类

Clustering in hyperbolic balls

Vladimir Jaćimović, Aladin Crnkić

AI总结:

本文建立了双曲空间中聚类的严格数学框架,基于新颖重心定义提出了双曲球中的k-means聚类,并引入期望最大化(EM)算法学习新概率分布的混合模型,奠定了双曲空间无监督学习的基础。

摘要:

数据在负曲率流形中的表示思想近期引起了广泛关注,并催生了名为双曲机器学习(ML)的新研究方向。为了揭示这一新范式的全部潜力,需要针对双曲空间中的数据分析和统计建模的高效技术。本文建立了双曲空间中聚类的严格数学框架。首先,基于重心的新颖定义,我们引入了双曲球中的k-means聚类。其次,我们提出了期望最大化(EM)算法,用于学习双曲球中新概率分布的混合模型。通过这种方式,我们奠定了双曲空间中无监督学习的基础。

英文摘要:

The idea of representations of the data in negatively curved manifolds recently attracted a lot of attention and gave a rise to the new research direction named {\it hyperbolic machine learning} (ML). In order to unveil the full potential of this new paradigm, efficient techniques for data analysis and statistical modeling in hyperbolic spaces are necessary. In the present paper rigorous mathematical framework for clustering in hyperbolic spaces is established. First, we introduce the $k$-means clustering in hyperbolic balls, based on the novel definition of barycenter. Second, we present the expectation-maximization (EM) algorithm for learning mixtures of novel probability distributions in hyperbolic balls. In such a way we lay the foundation of unsupervised learning in hyperbolic spaces.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑