| 基于凝聚式信息瓶颈的加权层次聚类算法 |
| |
| 引用本文： | 李寒,郭禾,王宇新,刘萍,杨元生. 基于凝聚式信息瓶颈的加权层次聚类算法[J]. 计算机工程, 2011, 37(6): 55-57. DOI: 10.3969/j.issn.1000-3428.2011.06.020 |
| |
| 作者姓名： | 李寒 郭禾 王宇新 刘萍 杨元生 |
| |
| 作者单位： | 1. 大连理工大学计算机科学与技术学院,辽宁,大连,116024
2. 大连理工大学软件学院,辽宁,大连,116620 |
| |
| 摘 要： | 提出一种针对面向对象软件架构恢复的基于凝聚式信息瓶颈的加权层次聚类算法(ABWHC)。该算法采用信息丢失度作为相似度度量标准，扩充聚类特征和权值，利用面向对象软件的特性，为实体或簇生成用以描述其含义的标签组。实验结果表明，ABWHC算法不仅能改善聚类的性能，还能恢复面向对象软件的架构。
|
| 关 键 词： | 层次聚类 架构恢复 面向对象软件 聚类特征 信息瓶颈 |
Weighted Hierarchical Clustering Algorithm Based on Agglomerative Information Bottleneck |
| |
| LI Han,GUO He,WANG Yu-xin,LIU Ping,YANG Yuan-sheng. Weighted Hierarchical Clustering Algorithm Based on Agglomerative Information Bottleneck[J]. Computer Engineering, 2011, 37(6): 55-57. DOI: 10.3969/j.issn.1000-3428.2011.06.020 |
| |
| Authors: | LI Han GUO He WANG Yu-xin LIU Ping YANG Yuan-sheng |
| |
| Affiliation: | 1(1.School of Computer Science and Technology,Dalian University of Technology,Dalian 116024,China;2.School of Software,Dalian University of Technology,Dalian 116620,China) |
| |
| Abstract: | This paper proposes an Agglomerative Information Bottleneck based Weighted Hierarchical Clustering algorithm（ABWHC） to rebuild the architecture of object oriented software.ABWHC uses information loss as the similarity measure,considers the characteristics of object oriented software by extending clustering features and weights,and generating label group for each entity or cluster.Experimental results demonstrate that ABWHC improves the performance of clustering,and efficiently and flexibly achieves object oriented software architecture recovery. |
| |
| Keywords: | hierarchical clustering architecture recovery object oriented software clustering feature information bottleneck |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
|
