Identifying composite crosscutting concerns through semi‐supervised learning. (11th November 2013)

• Record Type: Journal Article
• Authors: Zhu, Jianlin; Huang, Jin; Zhou, Daicui; Carminati, Federico; Zhang, Guoping; He, Qiang
• Is Part Of: Software, practice & experience. Volume 44:Number 12(2014)
• Page Start: 1525
• Page End: 1545
• Publication Date: 2013-11-11
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2234
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2234-abs-0001"> <title>SUMMARY</title> <p id="spe2234-para-0002">Aspect mining improves the modularity of legacy software systems through identifying their underlying crosscutting concerns (CCs). However, a realistic CC is a composite one that consists of CC seeds and relative program elements, which makes it a great challenge to identify a composite CC. In this paper, inspired by the state‐of‐the‐art information retrieval techniques, we model this problem as a semi‐supervised learning problem. First, the link analysis technique is adopted to generate CC seeds. Second, we construct a <italic>coupling graph</italic>, which indicates the relationship between CC seeds. Then, we adopt community detection technique to generate groups of CC seeds as constraints for semi‐supervised learning, which can guide the clustering process. Furthermore, we propose a semi‐supervised graph clustering approach named constrained authority‐shift clustering to identify composite CCs. Two measurements, namely, <italic>similarity</italic> and <italic>connectivity</italic>, are defined and <italic>seeded graph</italic> is generated for clustering program elements. We evaluate constrained authority‐shift clustering on numerous software systems including large‐scale distributed software system. The experimental results demonstrate that our semi‐supervised learning is more effective in detecting composite CCs. Copyright © 2013 John Wiley & Sons, Ltd.</p> </abstract>