arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.12087cs.CV
收藏

通过构造超平面进行聚类

Clustering by Constructing Hyper-Planes

Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology(北京工业大学北京科学与工程计算学院);College of Applied Sciences, Beijing University of Technology(北京工业大学应用学院)

Luhong Diao, Jinying Gao1, Manman Deng

摘要:

聚类算法是一种基本的机器学习方法,它根据数据点的相似性或分布性将数据点划分为不同的类别。提出了一种通过寻找超平面来区分数据点的聚类算法。它依赖于点之间的边缘空间。然后我们结合这些超平面来确定聚类的中心和数量。由于该算法是基于线性结构的,因此它可以准确而灵活地近似数据集的分布。通过在不同的基准数据集上进行实验,将其与一些著名的聚类算法进行了性能比较。它明显优于其他方法。

英文摘要:

As a kind of basic machine learning method, clustering algorithms group data points into different categories based on their similarity or distribution. We present a clustering algorithm by finding hyper-planes to distinguish the data points. It relies on the marginal space between the points. Then we combine these hyper-planes to determine centers and numbers of clusters. Because the algorithm is based on linear structures, it can approximate the distribution of datasets accurately and flexibly. To evaluate its performance, we compared it with some famous clustering algorithms by carrying experiments on different kinds of benchmark datasets. It outperforms other methods clearly.

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

↑