This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mining Crosscutting Concerns through Random Walks
Sept.-Oct. 2012 (vol. 38 no. 5)
pp. 1123-1137
Charles Zhang, The Hong Kong University of Science and Technology, Hong Kong
Hans-Arno Jacobsen, University of Toronto, Toronto
Inspired by our past manual aspect mining experiences, this paper describes a probabilistic random walk model to approximate the process of discovering crosscutting concerns (CCs) in the absence of the domain knowledge about the investigated application. The random walks are performed on the concept graphs extracted from the program sources to calculate metrics of “utilization” and “aggregation” for each of the program elements. We rank all the program elements based on these metrics and use a threshold to produce a set of candidates that represent crosscutting concerns. We implemented the algorithm as the Prism CC miner (PCM) and evaluated PCM on Java applications ranging from a small-scale drawing application to a medium-sized middleware application and to a large-scale enterprise application server. Our quantification shows that PCM is able to produce comparable results (95 percent accuracy for the top 125 candidates) with respect to the manual mining effort. PCM is also significantly more effective as compared to the conventional approach.
Index Terms:
Phase change materials,Radiation detectors,Data mining,Manuals,Mathematical model,Computational modeling,Algorithm design and analysis,mining crosscutting concerns,Aspect mining
Citation:
Charles Zhang, Hans-Arno Jacobsen, "Mining Crosscutting Concerns through Random Walks," IEEE Transactions on Software Engineering, vol. 38, no. 5, pp. 1123-1137, Sept.-Oct. 2012, doi:10.1109/TSE.2011.83
Usage of this product signifies your acceptance of the Terms of Use.