Mining composite crosscutting concerns based on graph clustering

被引:0
作者
Huang, Jin [1 ]
Zhu, Jianlin [2 ]
Lu, Yansheng [3 ]
机构
[1] 709 Research Institute, China Shipbuilding Industry Corporation, Wuhan
[2] School of Computer Science and Technology, South-Central University for Nationalities, Wuhan
[3] School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan
来源
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) | 2015年 / 43卷 / 04期
关键词
Aspect mining; Composite crosscutting concern; Directed graph; Graph clustering; Software module; Software system;
D O I
10.13245/j.hust.150424
中图分类号
学科分类号
摘要
A graph clustering technique was adopted to obtain composite crosscutting concerns consisting of several program elements. Our graph clustering technique considers not only the connectivity between program elements, but also the similarity between them. A composite crosscutting concern is still a software module, which consists of strongly connected program elements and similar ones. Taking advantage of both connectivity and similarity, a directed graph clustering approach was proposed based on authority-shift approach for finding software modules. Fan-in technique was adopted to identify composite crosscutting concerns. Comparing with various clustering methods through experiments, our approach is more effective in identifying crosscutting concerns. ©, 2015, Huazhong University of Science and Technology. All right reserved.
引用
收藏
页码:118 / 122
页数:4
相关论文
共 10 条
[1]  
Grigoreta S.C., Gabriela S.C., On clustering based aspect mining, Proc of International Conference on Intelligent Computer Communication and Processing, pp. 129-136, (2008)
[2]  
Zhang D., Guo Y., Chen X., Automated aspect recommendation through clustering-based fan-in analysis, Proc of International Conference on Automated Software Engineering, pp. 278-287, (2008)
[3]  
Silvia B., Jens K., Aspect mining using event traces, Proc of International Conference on Automated Software Engineering, pp. 310-315, (2004)
[4]  
Tonella P., Ceccato M., Aspect mining through the formal concept analysis of execution traces, Proc of Working Conference on Reverse Engineering, pp. 112-121, (2004)
[5]  
Marius M., Arie V.D., Leon M., Identifying crosscutting concerns using fan-in analysis, ACM Transactions on Software Engineering and Methodology, 17, 1, pp. 1-37, (2007)
[6]  
Zhang C., Hans A.J., Mining crosscutting concerns through random walks, IEEE Transactions on Software Engineering, 8, 1, pp. 1-15, (2011)
[7]  
Jeh G., Widom J., Simrank: a measure of structural-context similarity, Proc of 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2002), pp. 538-543, (2002)
[8]  
Cho M., Lee K.M., Authority-shift clustering: hierarchical clustering by authority seeking on graphs, Proc of IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010), pp. 3193-3200, (2010)
[9]  
Altini V., Anticic T., Carena F., Et al., Commissioning and first experience of the alice data acquisition system, Proc of 16th IEEE-NPSS Real Time Conference (RT'09), pp. 236-239, (2009)
[10]  
Kanungo T., Mount D., Netanyahu N., Et al., An efficient k-means clustering algorithm: analysis and implementation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 7, pp. 881-892, (2002)