关键词: 成对限制信息, 免疫克隆选择算法, 图划分

Abstract: Using some prior information can significantly improve the performance of clustering algorithms. In order to solve the NP-hard graph partitioning problems and utilize some prior information, a semisupervised immune clone selection graph partition algorithm the pairwise constraint information is introduced into the similarity measure in the graph partitioning algorithms, then the immune clonal selection algorithm is utilized to optimal the criterion of the graph partitioning based on the corresponding similarity matrix to obtain the solution. The experimental results on the USPS handwritten digit datasets and UMIST face datasets show that the novel method is effective.

Key words: pairwise constraint information, immune clonal selection algorithm, graph partition