arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.3949cs.LGmath.OCstat.ML
收藏

论软实力图

On Soft Power Diagrams

Technische Universität München(慕尼黑工业大学)

Steffen Borgwardt

摘要:

数据分析中的许多应用都是从欧氏空间中的一组点开始的,这些点被划分为聚类。然后,常见的任务是设计一个分类器,决定新点与哪个聚类相关联,找到关于聚类的离群值,或者识别用于分区的聚类类型。一种常见的聚类是相对于一组给定站点的(平衡)最小二乘分配。对于这些,有一个“分离功率图”,其中每个集群位于其自己的单元中。在本文中,我们的目标是有效的算法离群值检测和阈值的计算,衡量如何相似的聚类是一个最小二乘分配固定的网站。为此,我们设计了一个新的模型,用于计算一个“软实力”,它允许一个软分离的集群与“点计数属性”,例如,我们能够规定有多少点,我们要分类为离群值。由于我们的结果持有一个更一般的非凸模型的自由网站,我们描述它和我们的证明,在这种更一般的方式。其局部最优解满足上述点计数性质。对于使用固定站点的目标应用程序,我们的算法可以通过线性规划有效地求解全局最优解。

英文摘要:

Many applications in data analysis begin with a set of points in a Euclidean space that is partitioned into clusters. Common tasks then are to devise a classifier deciding which of the clusters a new point is associated to, finding outliers with respect to the clusters, or identifying the type of clustering used for the partition. One of the common kinds of clusterings are (balanced) least-squares assignments with respect to a given set of sites. For these, there is a 'separating power diagram' for which each cluster lies in its own cell. In the present paper, we aim for efficient algorithms for outlier detection and the computation of thresholds that measure how similar a clustering is to a least-squares assignment for fixed sites. For this purpose, we devise a new model for the computation of a 'soft power diagram', which allows a soft separation of the clusters with 'point counting properties'; e.g. we are able to prescribe how many points we want to classify as outliers. As our results hold for a more general non-convex model of free sites, we describe it and our proofs in this more general way. Its locally optimal solutions satisfy the aforementioned point counting properties. For our target applications that use fixed sites, our algorithms are efficiently solvable to global optimality by linear programming.

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

↑