Title :
A Research of the Partition Clustering Algorithm
Author :
Xiao Jing-zhong ; Xiao Li
Author_Institution :
Sch. of Comput. Sci. & Technol., SouthWest Univ. for Nat., Chengdu, China
Abstract :
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.
Keywords :
data mining; data reduction; optimisation; pattern clustering; NP problem; concurrency operation; data mining; partition clustering algorithm; polynomial time; reduction technology; Clustering algorithms; Color; Complexity theory; Computer science; Concurrent computing; Partitioning algorithms; Plagiarism; NP problem; data mining; the concurrency operation;
Conference_Titel :
Intelligence Information Processing and Trusted Computing (IPTC), 2010 International Symposium on
Conference_Location :
Huanggang
Print_ISBN :
978-1-4244-8148-4
Electronic_ISBN :
978-0-7695-4196-9
DOI :
10.1109/IPTC.2010.148
