COSPA: Identifying Key Classes in Object-Oriented Software Using Preference Aggregation

被引:5
作者
Du, Xin [1 ]
Wang, Tian [1 ]
Pan, Weifeng [1 ]
Wang, Muchou [2 ]
Jiang, Bo [1 ]
Xiang, Yiming [3 ]
Chai, Chunlai [1 ]
Wang, Jiale [1 ]
Yuan, Chengxiang [1 ]
机构
[1] Zhejiang Gongshang Univ, Sch Comp Sci & Informat Engn, Hangzhou 310018, Peoples R China
[2] Wenzhou Univ, Wenzhou Univ Lib, Wenzhou 325000, Peoples R China
[3] Zhejiang Gongshang Univ, Sch Management & Business, Hangzhou 310018, Peoples R China
关键词
Software; Supervised learning; Software systems; Software algorithms; Object recognition; Unsupervised learning; Documentation; Complex network; key classes; divergence; software comprehension; SYSTEMS;
D O I
10.1109/ACCESS.2021.3105475
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Software comprehension helps us to maintain software better. The developers often use documentation and mutual communication to understand software. However, the incompletion of documentation usually causes some problems such that we cannot acquire the detailed information of software. So researchers are now using key classes as starting points for software understanding and propose several effective methods for key class identification. Such methods are mostly implemented using supervised and unsupervised learning methods; however, they may be subject to class imbalance, insufficient amount of data, and lack of accuracy. In this paper, we propose a novel approach, called COSPA (identifying key Classes in Object-Oriented Software using Preference Aggregation), to identify key classes in software. Our approach is inspired by the social choice theory and uses Kemeny-Young method to find a preference that minimizes the total difference between different pairs of sequences returned by three key class identification methods (i.e., a-index, InDeg, and OSE). Further, we rank the classes in descending order according to that preference set, and a small number of top-ranked classes are considered as key candidates. To better evaluate the performance of our approach, we apply it to six Java software systems and compare it with nine state-of-the-art approaches. In the experiments, we use Friedman to evaluate all methods in the whole set of research subjects; results show that, though no single method works always best in all subject systems, our method indeed performs better than others.
引用
收藏
页码:114767 / 114780
页数:14
相关论文
共 43 条
[1]  
Abreu FB, 2001, FIFTH EUROPEAN CONFERENCE ON SOFTWARE MAINTENANCE AND REENGINEERING, PROCEEDINGS, P47, DOI 10.1109/CSMR.2001.914968
[2]  
[Anonymous], 2014, ICPC
[3]   VOTING SCHEMES FOR WHICH IT CAN BE DIFFICULT TO TELL WHO WON THE ELECTION [J].
BARTHOLDI, J ;
TOVEY, CA ;
TRICK, MA .
SOCIAL CHOICE AND WELFARE, 1989, 6 (02) :157-165
[4]   MODEL OF LARGE PROGRAM-DEVELOPMENT [J].
BELADY, LA ;
LEHMAN, MM .
IBM SYSTEMS JOURNAL, 1976, 15 (03) :225-252
[5]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[6]  
Brito e Abreu F., 2000, Proceedings of the Fourth European Conference on Software Maintenance and Reengineering, P13, DOI 10.1109/CSMR.2000.827300
[7]  
Dwork C, 2001, P 10 INT C WORLD WID, P613
[8]   An identification method for important nodes based on k-shell and structural hole [J].
Feng, Jian ;
Shi, Dandan ;
Luo, Xiangyu .
JOURNAL OF COMPLEX NETWORKS, 2018, 6 (03) :342-352
[9]  
Fjelstad R., 1979, P GUIDE, V48, P13
[10]  
Gaur A., 2014, AESTHETICS BASED ASS