| 半监督免疫克隆选择图划分方法 |
| |
| 引用本文： | 刘汉强. 半监督免疫克隆选择图划分方法[J]. 计算机工程与应用, 2014, 50(22): 11-16 |
| |
| 作者姓名： | 刘汉强 |
| |
| 作者单位： | 陕西师范大学 计算机科学学院，西安 710119 |
| |
| 基金项目： | 国家自然科学基金(No.61202153，No.61102095)；陕西省自然科学基础研究计划资助项目(No.2012JQ8045，No.2014JQ8336)；陕西省科学技术研究发展计划资助项目(No.2014KJXX-72)。 |
| |
| 摘 要： | 在聚类过程中利用一定量先验信息会显著提高聚类算法的性能。为了解决求解图谱划分方法NP难的问题并合理地利用一定量的先验信息，将成对限制信息引入到图谱划分方法中样本点的相似性测度，并在获得的相应的相似性矩阵的基础上，利用免疫克隆选择优化方法来优化图谱划分准则，提出了半监督免疫克隆选择图划分方法。USPS手写体数字集和UMIST人脸数据集识别的仿真实验证明了新方法的有效性。
|
| 关 键 词： | 成对限制信息 免疫克隆选择算法 图划分 |
Semisupervised immune clone selection graph partition algorithm |
| |
| LIU Hanqiang. Semisupervised immune clone selection graph partition algorithm[J]. Computer Engineering and Applications, 2014, 50(22): 11-16 |
| |
| Authors: | LIU Hanqiang |
| |
| Affiliation: | School of Computer Science, Shaanxi Normal University, Xi’an 710119, China |
| |
| 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 selec-tion 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 parti-tioning based on the corresponding similarity matrix to obtain the solution. The experimental results on the USPS hand-written digit datasets and UMIST face datasets show that the novel method is effective. |
| |
| Keywords: | pairwise constraint information immune clonal selection algorithm graph partition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
