arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.03667cs.LGstat.ML
收藏

高维空间中的微分相似性:理论与应用

Differential Similarity in Higher Dimensional Spaces: Theory and Applications

Rutgers, The State University of New Jersey(新泽西州立罗格斯大学)

L. Thorne McCarty

AI总结:

本文拓展了微分相似性理论,将其从三维推广至$n$维空间,提出了对应的求解策略与参数估计技术,并在MNIST和CIFAR-10数据集上完成验证,为结合几何与概率模型的聚类编码算法提供了高维场景的理论与方法支撑。

摘要:

本文对最初发表于arXiv:1401.2411 [cs.LG]的微分相似性理论进行了拓展与细化。研究目标是开发一种将几何模型与概率模型以原则性方式相结合的聚类与编码算法。为简化起见,早期论文中的几何模型仅局限于三维情形,本文移除了这一限制,考虑完整的$n$维情形。尽管数学模型保持一致,但$n$维情形下的求解策略有所不同,本文的主要目的之一便是开发并分析这些求解策略。另一主要目的是设计同样适用于$n$维场景的、从样本数据中估计模型参数的技术。我们通过将这些求解策略与参数估计技术应用于两个常见的真实案例——经典的MNIST数据集和CIFAR-10数据集,对其进行了评估。

英文摘要:

This paper presents an extension and an elaboration of the theory of differential similarity, which was originally proposed in arXiv:1401.2411 [cs.LG]. The goal is to develop an algorithm for clustering and coding that combines a geometric model with a probabilistic model in a principled way. For simplicity, the geometric model in the earlier paper was restricted to the three-dimensional case. The present paper removes this restriction, and considers the full $n$-dimensional case. Although the mathematical model is the same, the strategies for computing solutions in the $n$-dimensional case are different, and one of the main purposes of this paper is to develop and analyze these strategies. Another main purpose is to devise techniques for estimating the parameters of the model from sample data, again in $n$ dimensions. We evaluate the solution strategies and the estimation techniques by applying them to two familiar real-world examples: the classical MNIST dataset and the CIFAR-10 dataset.

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

↑