CRA: Identifying Key Classes Using Markov-Chain-Based Ranking Aggregation

被引:1
作者
Du, Xin [1 ]
Pan, Weifeng [1 ]
Jiang, Bo [1 ]
Ding, Luyun [1 ]
Pan, Yun [1 ]
Yuan, Chengxiang [1 ]
Xiang, Yiming [2 ]
机构
[1] Zhejiang Gongshang Univ, Sch Comp Sci & Informat Engn, Hangzhou 310018, Peoples R China
[2] Zhejiang Gongshang Univ, Sch Management & Business, Hangzhou 310018, Peoples R China
基金
中国国家自然科学基金;
关键词
key class identification; complex network; Markov chain; ranking aggregation; IDENTIFICATION;
D O I
10.3390/axioms11100491
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Researchers have proposed many approaches to identify key classes in software from the perspective of complex networks, such as CONN-TOTAL-W, PageRankBR, and ElementRank, which can effectively help developers understand software. However, these approaches tend to rely on a single metric when measuring the importance of classes. They do not consider the aggregation of multiple metrics to select the winner classes that rank high in majority metrics. In this work, we propose a key class identification approach using Markov-Chain-based ranking aggregation, namely CRA. First, CRA constructs a weighted directed class coupling network (WDCCNet) to describe the software and further applies existing approaches on WDCCNet to calculate class importance. Second, CRA filters out some metrics according to specific rules and uses the Markov chain to aggregate the remaining metrics. When the state probability distribution reaches a fixed point and does not change anymore, the classes in the software are sorted in a descending order according to the probability distribution, and the top-15% classes are treated as key classes. To evaluate the CRA approach, we compare it with 10 baseline approaches available on 6 pieces of software. Empirical results show that our approach is superior to the baselines according to the average ranking of the Friedman Test.
引用
收藏
页数:14
相关论文
共 31 条
[1]  
[Anonymous], 2008, NETW HETEROG MEDIA
[2]  
[Anonymous], 2010, PROC 4 WORKSHOP FAMI
[3]   Scale-free characteristics of random networks:: the topology of the World-Wide Web [J].
Barabási, AL ;
Albert, R ;
Jeong, H .
PHYSICA A, 2000, 281 (1-4) :69-77
[4]   MODEL OF LARGE PROGRAM-DEVELOPMENT [J].
BELADY, LA ;
LEHMAN, MM .
IBM SYSTEMS JOURNAL, 1976, 15 (03) :225-252
[5]   FACTORING AND WEIGHTING APPROACHES TO STATUS SCORES AND CLIQUE IDENTIFICATION [J].
BONACICH, P .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 1972, 2 (01) :113-120
[6]   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
[7]  
Brito e Abreu F., 2000, Proceedings of the Fourth European Conference on Software Maintenance and Reengineering, P13, DOI 10.1109/CSMR.2000.827300
[8]   CoreBug: Improving Effort-Aware Bug Prediction in Software Systems Using Generalized k-Core Decomposition in Class Dependency Networks [J].
Du, Xin ;
Wang, Tian ;
Wang, Liuhai ;
Pan, Weifeng ;
Chai, Chunlai ;
Xu, Xinxin ;
Jiang, Bo ;
Wang, Jiale .
AXIOMS, 2022, 11 (05)
[9]  
Dwork C., 2001, P INT WORLD WID WEB, P613, DOI [10.1145/371920.372165, DOI 10.1145/371920.372165]
[10]   Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power [J].
Garcia, Salvador ;
Fernandez, Alberto ;
Luengo, Julian ;
Herrera, Francisco .
INFORMATION SCIENCES, 2010, 180 (10) :2044-2064