A Research of the Partition Clustering Algorithm

The partition clustering problem is the one of the hardest problems in nowadays research. Also Partition clustering problem is the basic problem in data mining. In most cases, the partition clustering algorithm is NP problem. In this paper, there introduced an algorithm to solve partition clustering problem in polynomial time by using some reduction technology. This algorithm is availability after analyzation, at the same time, this algorithm supports the concurrency operation.