A novel clustering technique based on the projection onto convex set (POCS) method, called POCS-based clustering algorithm, is proposed in this paper. The proposed POCS-based clustering algorithm exploits a parallel projection method of POCS to find appropriate cluster prototypes in the feature space. The algorithm considers each data point as a convex set and projects the cluster prototypes parallelly to the member data points. The projections are convexly combined to minimize the objective function for data clustering purpose. The performance of the proposed POCS-based clustering algorithm is verified through experiments on various synthetic datasets. The experimental results show that the proposed POCS-based clustering algorithm is competitive and efficient in terms of clustering error and execution speed when compared with other conventional clustering methods including Fuzzy C-Means (FCM) and K-means clustering algorithms.
翻译:本文件建议采用基于投向 convex (POCS) 集成法的新集群技术,称为POCS 集成算法。拟议的基于POCS的组群算法利用POCS的平行预测法,在特性空间找到适当的集束原型。该算法将每个数据点视为一个相近的集成法,并将集成原型与成员数据点平行地投放。这些预测是相互连接的,以尽量减少数据集成的目的功能。拟议的POCS 集成算法的性能通过各种合成数据集的实验加以核实。实验结果显示,与Fuzzy C-Means (FCM) 和K- means 群集算法等其他常规集法相比,基于POCS的组群集算法具有竞争力和效率。