kProtoClust:Towards Adaptive k-Prototype Clustering without Known k  

作　　者：Yuan Ping Huina Li Chun Guo Bin Hao 

机构地区：[1]School of Information Engineering,Xuchang University,Xuchang,461000,China [2]Henan Province Engineering Technology Research Center of Big Data Security andApplications,Xuchang,461000,China [3]College of Computer Science and Technology,Guizhou University,Guiyang,550025,China [4]Here Data Technology,Shenzhen,518000,China

出　　处：《Computers, Materials & Continua》2025年第3期4949-4976,共28页计算机、材料和连续体(英文)

基　　金：supported by the National Natural Science Foundation of China under Grant No.62162009;the Key Technologies R&D Program of He’nan Province under Grant No.242102211065;the Scientific Research Innovation Team of Xuchang University under GrantNo.2022CXTD003;Postgraduate Education Reform and Quality Improvement Project of Henan Province under Grant No.YJS2024JD38.

摘　　要：Towards optimal k-prototype discovery,k-means-like algorithms give us inspirations of central samples collection,yet the unstable seed samples selection,the hypothesis of a circle-like pattern,and the unknown K are still challenges,particularly for non-predetermined data patterns.We propose an adaptive k-prototype clustering method(kProtoClust)which launches cluster exploration with a sketchy division of K clusters and finds evidence for splitting and merging.On behalf of a group of data samples,support vectors and outliers from the perspective of support vector data description are not the appropriate candidates for prototypes,while inner samples become the first candidates for instability reduction of seeds.Different from the representation of samples in traditional,we extend sample selection by encouraging fictitious samples to emphasize the representativeness of patterns.To get out of the circle-like pattern limitation,we introduce a convex decomposition-based strategy of one-cluster-multiple-prototypes in which convex hulls of varying sizes are prototypes,and accurate connection analysis makes the support of arbitrary cluster shapes possible.Inspired by geometry,the three presented strategies make kProtoClust bypassing the K dependence well with the global and local position relationship analysis for data samples.Experimental results on twelve datasets of irregular cluster shape or high dimension suggest that kProtoClust handles arbitrary cluster shapes with prominent accuracy even without the prior knowledge K.

关 键 词：Prototype finding convex hull support vector data description geometrical information 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]