Abstract
Data mining processes data from different perspectives into useful knowledge, and becomes an important component in designing intelligent decision support systems (IDSS). Clustering is an effective method to discover natural structures of data objects in data mining. Both clustering ensemble and semi-supervised clustering techniques have been emerged to improve the clustering performance of unsupervised clustering algorithms. Cop-Kmeans is a K-means variant that incorporates background knowledge in the form of pairwise constraints. However, there exists a constraint violation in Cop-Kmeans. This paper proposes an improved Cop-Kmeans (ICop-Kmeans) algorithm to solve the constraint violation of Cop-Kmeans. The certainty of objects is computed to obtain a better assignment order of objects by the weighted co-association. The paper proposes a new constrained self-organizing map (SOM) to combine multiple semi-supervised clustering solutions for further enhancing the performance of ICop-Kmeans. The proposed methods effectively improve the clustering results from the validated experiments and the quality of complex decisions in IDSS.
Original language | English |
---|---|
Pages (from-to) | 101-115 |
Number of pages | 15 |
Journal | Knowledge-Based Systems |
Volume | 32 |
DOIs | |
State | Published - Aug 2012 |
Funding
This work is partially supported by the National Science Foundation of China (Nos. 60873108 , 61170111 and 61003142 ) and the Fundamental Research Funds for the Central Universities (No. SWJTU11ZT08 ).
Funders | Funder number |
---|---|
NSFC - National Natural Science Foundation of China | 61003142, 60873108, 61170111 |
ASJC Scopus subject areas
- Software
- Management Information Systems
- Information Systems and Management
- Artificial Intelligence