Software Module Clustering as a Multi-Objective Search Problem

作者: Kata Praditwong , Mark Harman , Xin Yao

DOI: 10.1109/TSE.2010.26

关键词:

摘要: Software module clustering is the problem of automatically organizing software units into modules to improve program structure. There has been a great deal recent interest in search-based formulations this which boundaries are identified by automated search, guided fitness function that captures twin objectives high cohesion and low coupling single-objective function. This paper introduces two novel multi-objective problem, several different (including coupling) represented separately. In order evaluate effectiveness approach, set experiments was performed on 17 real-world problems. The results empirical study provide strong evidence support claim approach produces significantly better solutions than existing approach.

参考文章(34)
Martin Shepperd, Foundations of software measurement Prentice Hall. ,(1995)
Michael Randolph Garey, David S. Johnson, A guide to the theory of np-completeness ,(1978)
Spiros Mancoridis, Brian S. Mitchell, Using Heuristic Search Techniques To Extract Design Abstractions From Source Code genetic and evolutionary computation conference. pp. 1375- 1382 ,(2002)
Robert M. Hierons, Mark Harman, Mark Proctor, A new representation and crossover operator for search-based optimization of software modularization genetic and evolutionary computation conference. pp. 1351- 1358 ,(2002)
S. Mancoridis, B.S. Mitchell, C. Rorres, Y. Chen, E.R. Gansner, Using automatic clustering to produce high-level system organizations of source code workshop on program comprehension. pp. 45- 52 ,(1998) , 10.1109/WPC.1998.693283
D. Doval, S. Mancoridis, B.S. Mitchell, Automatic clustering of software systems using a genetic algorithm STEP '99. Proceedings Ninth International Workshop Software Technology and Engineering Practice. pp. 73- 81 ,(1999) , 10.1109/STEP.1999.798481
Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler, Do additional objectives make a problem harder genetic and evolutionary computation conference. pp. 765- 772 ,(2007) , 10.1145/1276958.1277114