半度量空间中采样、聚类和嵌入数据点的统一框架
A Unified Framework for Sampling, Clustering and Embedding Data Points in Semi-Metric Spaces
摘要:
在本文中,我们提出了一个统一的框架采样,聚类和嵌入数据点在半度量空间。对于半度量空间中的一组数据点$Ω=\{x_1, x_2, \ldots, x_n\}$,我们考虑一个具有$n$节点和$n$自边的完全图,然后将$Ω$中的每个数据点映射到图中的一个节点,其中两个节点之间的边权是$Ω$中相应两个点之间的距离.通过这样做,几个众所周知的采样技术可以应用于聚类半度量空间中的数据点。一个特别有趣的采样技术是指数扭曲采样,其中可以指定所需的平均距离的采样分布,以检测具有各种分辨率的集群。我们还提出了一个softmax聚类算法,可以执行聚类和嵌入数据点在一个半度量空间到一个低维的欧氏空间。我们的实验结果表明,经过一定次数的迭代“训练”,我们的softmax算法可以揭示“拓扑”的数据从高维欧几里德。我们还表明,协方差矩阵的特征分解是等价的主成分分析(PCA)。为了处理聚类的层次结构,我们的softmax聚类算法也可以与层次聚类算法一起使用。为此,我们提出了一个分区分层算法,称为$i$ PHD,在本文中。我们的实验结果表明,这些算法的基础上最大化的归一化模块化往往会平衡检测到的集群的大小,因此不执行时,地面真实集群的大小不同。此外,使用度量比使用半度量更好,因为半度量不满足三角不等式,并且更容易出现聚类错误。
英文摘要:
In this paper, we propose a unified framework for sampling, clustering and embedding data points in semi-metric spaces. For a set of data points $Ω=\{x_1, x_2, \ldots, x_n\}$ in a semi-metric space, we consider a complete graph with $n$ nodes and $n$ self edges and then map each data point in $Ω$ to a node in the graph with the edge weight between two nodes being the distance between the corresponding two points in $Ω$. By doing so, several well-known sampling techniques can be applied for clustering data points in a semi-metric space. One particularly interesting sampling technique is the exponentially twisted sampling in which one can specify the desired average distance from the sampling distribution to detect clusters with various resolutions. We also propose a softmax clustering algorithm that can perform a clustering and embed data points in a semi-metric space to a low dimensional Euclidean space. Our experimental results show that after a certain number of iterations of "training", our softmax algorithm can reveal the "topology" of the data from a high dimensional Euclidean. We also show that the eigendecomposition of a covariance matrix is equivalent to the principal component analysis (PCA). To deal with the hierarchical structure of clusters, our softmax clustering algorithm can also be used with a hierarchical clustering algorithm. For this, we propose a partitional-hierarchical algorithm, called $i$PHD, in this paper. Our experimental results show that those algorithms based on the maximization of normalized modularity tend to balance the sizes of detected clusters and thus do not perform well when the ground-truth clusters are different in sizes. Also, using a metric is better than using a semi-metric as the triangular inequality is not satisfied for a semi-metric and that is more prone to clustering errors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。