摘要：Clustering for uncertain data is an interesting research topic in data mining. Researchers prefer to define uncertain data clustering problem by using combinatorial optimization model. Heuristic clustering algorithm is an efficient way to deal with this kind of clustering problem, but initialization sensitivity is one of inevitable drawbacks. In this paper, we propose a novel clustering algorithm named CUDAP (Clustering algorithm for Uncertain Data based on Approximate backbone). In CUDAP, we (1) make M times random sampling on the original uncertain data set Dm to generate M sampled data sets DS= { Ds1,Ds2,…,DsM }; (2) capture the M local optimal clustering results P ={ C1,C2,…,CM } from DS by running UK-Medoids algorithm on each sample data set Dsi, i=1,…M ; (3) design a greedy search algorithm to find out the approximate backbone( APB ) from P ; (4) run UK-Medoids again on the original uncertain data set Dm guided by new initialization which was generated from APB . Experimental results on synthetic and real world data sets demonstrate the superiority of the proposed approach in terms of clustering quality measures.
关键词：NP-hard Problem;Uncertain Data Clustering Problem;Heuristic Clustering Algorithm;Approximate Backbone
