计算机科学
又称作
依赖关系(UML)
可扩展性
班级(哲学)
集合(抽象数据类型)
钥匙(锁)
逆向工程
理论计算机科学
软件
数据挖掘
人工智能
程序设计语言
数据库
计算机安全
图书馆学
作者
Weifeng Pan,Wei Wu,Hua Ming,Dae-Kyoo Kim,Jinkai Yang,Ruochen Liu
标识
DOI:10.1145/3639478.3643520
摘要
Reverse engineered class diagrams (REDs) are helpful to ease the comprehension of complex software. However, the original REDs might contain many details and thus provide little benefit. Condensing REDs by identifying the most important classes (aka key classes) and discarding unimportant ones has been regarded as a promising way. In the last decade, many key class prediction (KCP) approaches have been proposed. However, the unweighted network metrics used in these studies fail to capture the dependency strength between classes and thus cannot precisely measure the actual complexity of classes. In this paper, we propose an approach, KEEPER, for condensing REDs, which introduces a set of weighted network metrics to characterize the complexity of classes and to build KCP models. Empirical results show that KEEPER performs better than all the baseline approaches and has a good scalability.
科研通智能强力驱动
Strongly Powered by AbleSci AI