modified convex data clustering algorithm based on alternating direction method of multipliers

knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering  in which there is no need to  be peculiar about how to select initial values. due to properly converting the task of optimization to an equivalent convex optimization problem, the proposed data clustering algorithm can be indeed considered as a global minimizer. in this paper, a splitting method for solving the convex clustering problem is used called as alterneting direction method of multipliers (admm), a simple but powerful algorithm that is well suited to convex optimization. we demonstrate the performance of the proposed algorithm on real data examples. the simulation result easily approve that the modified convex data clustering (mcdc) algorithm provides separation more than the convex data clustering (cdc) algorithm. furthermore, complexity of solving the second part of mcdc problem is reduced from o(n2) to o(n).