Spectral and meta-heuristic algorithms for software clustering

Journal of Systems and Software

Volumn 77, Issue 3, 2005, Pages 213-223

  Shokoufandeh, Ali ^a   Mancoridis, Spiros ^a   Denton, Trip ^a   Maycock, Matthew ^a  

^a Drexel University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE MAINTENANCE; DATABASE SYSTEMS; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; PROBLEM SOLVING; REVERSE ENGINEERING; SYSTEMS ANALYSIS;

GLOBAL OPTIMUM; OPTIMAL SOLUTIONS; SOFTWARE CLUSTERING; SPECTRAL METHODS;

SOFTWARE ENGINEERING;

EID: 18844393966     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2004.03.032     Document Type: Article

References (56)

1. Anquetil, N., 2000. A comparison of graphs of concepts for reverse engineering. In: Proceedings of the International Workshop on Program Comprehension
2. Anquetil, N., Lethbridge, T., 1999. Recovering software architecture from the names of source files. In: Proceedings of Working Conference on Reverse Engineering
3. Anquetil, N., Fourrier, C., Lethbridge, T., 1999. Experiments with hierarchical clustering algorithms as software remodularization methods. In: Proceedings of Working Conference on Reverse Engineering
4. Asano, T., 1997. Approximation algorithms for max sat: Yannakakis vs
5. Azar, Y., Fiat, A., Karlin, A., McSherry, F., Saia, J., 2001. Spectral analysis of data. In: ACM Symposium on Theory of Computing, pp. 619-626
6. Boppana, R., 1988. Eigenvalues and graph bisection: an average case analysis. In: Proceedings of the 28 Annual Symposium on Computer Science, pp. 280-285
7. Charikar, M., Chekuri, C., Feder, T., Motwani, R., 1997. Incremental clustering and dynamic information retrieval. In: ACM Symposium on Theory of Computing, pp. 626-635
8. Y. Chen Reverse engineering B. Krishnamurthy Practical Reusable UNIX Software 1995 John Wiley & Sons New York 177 208 Chapter 6
9. Chen, Y., Gansner, E.R., Koutsofios, E., 1997. A C++ data model supporting reachability analysis and dead code detection. In: Proceedings of the European Conference on Software Engineering/Foundations of Software Engineering
10. Choi, S., Scacchi, W., 1990. Extracting and restructuring the design of large systems. In: IEEE Software. pp. 66-71
11. Chung, F.R.K., 1997. Spectral graph theory. CBMS Regional Conference Series in Mathematics
12. J. Clark, J.J. Dolado, M. Harman, R. Hierons, B. Jones, M. Lumkin, B.S. Mitchell, S. Mancoridis, K. Rees, M. Roper, and M. Shepperd Reformulating software engineering as a search problem Journal of IEE Proceedings-Software 150 3 2003 161 175
13. W.E. Donath, and A.J. Hoffman Lower bounds for the partitioning of graphs IBM Journal of Research and Development 17 1973 420 425
14. Doval, D., Mancoridis, S., Mitchell, B., 1999. Automatic clustering of software systems using a genetic algorithm. In: Proceedings of Software Technology and Engineering Practice
15. M. Fiedler A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory Czechoslovak Mathematical Journal 25 100 1975 619 633
16. M. Garey, and D. Johnson Computers and Intractability 1979 W.H.Freeman
17. D. Goldberg Genetic Algorithms in Search, Optimization & Machine Learning 1989 Addison Wesley
18. G. Golub, and C.V. Loan Matrix Computations third ed. 1996 Johns Hopkins University Press
19. S. Guattery, and G.L. Miller On the quality of spectral separators SIAM Journal on Matrix Analysis and Applications 19 1998 701 719
20. Han, Q., Ye, Y., Zhang, H., Zhang, J., 2000. On approximation of max-vertex-cover. In: 17th International Symposium on Mathematical Programming, Atlanta, Georgia
21. Holt, R., Malton, A., Dean, T., 2004. Cppx: Open source c++ fact extractor. Available from < http://swag.uwaterloo.ca/cppx/>
22. D. Hutchens, and R. Basili System structure analysis: clustering with data bindings IEEE Transactions on Software Engineering 11 1995 749 757
23. B. Kalantari, L. Khachiyan, and A. Shokoufandeh On the complexity of matrix balancing SIAM Journal on Matrix Analysis and Applications 18 2 1997 450 463
24. Kannan, R., Vempala, S., Vetta, A., 2000. On clusterings: good, bad and spectral. In: Proceedings of 41st Symposium on Foundations of Computer Science, FOCS'00, Redondo Beach, CA
25. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins The Web as a graph: Measurements, models, and methods T. Asano H. Imai D.T. Lee S. Nakano T. Tokuyama Proceedings of 5th Annual International Conference on Computing and Combinatorics, COCOON vol. 1627 1999 Springer-Verlag
26. Korn, J., Chen, Y., Koutsofios, E., 1999. Chava: reverse engineering and tracking of Java Applets. In: Proceedings of the 6th Working Conference on Reverse Engineering, pp. 314-325
27. Lindig, C., Snelting, G., 1997. Assessing modular structure of legacy code based on mathematical concept analysis. In: Proceedings of International Conference on Software Engineering
28. Mancoridis, S., Mitchell, B., Rorres, C., Chen, Y., Gansner, E., 1998. Using automatic clustering to produce high-level system organizations of source code. In: Proceedings of the 6th International Workshop on Program Comprehension
29. Mancoridis, S., Mitchell, B., Chen, Y., Gansner, E., 1999. Bunch: a clustering tool for the recovery and maintenance of software system structures. In: Proceedings of International Conference of Software Maintenance
30. McWherter, D., Peabody, M., Regli, W.C., Shokoufandeh, A., 2001a. Transformation invariant shape similarity comparison of models. In: Proceedings of ASME Design Engineering Technical Conferences
31. McWherter, D., Peabody, M., Shokoufandeh, A., Regli, W.C., 2001b. Database techniques for archival of solid models. In: Proceedings of 6th ACM/SIGGRAPH Symposium on Solid Modeling and Applications, pp. 78-87
32. Mitchell, B., Mancoridis, S., 2001. Craft: a framework for evaluating software clustering results in the absence of benchmark decompositions. In: Proceedings of the Working Conference on Reverse Engineering, WCRE'01
33. Mitchell, B., Mancoridis, S., Traverso, M., 2001. An architecture for distributing the computation of software clustering algorithms. In: Proceedings of the IEEE/IFIP Working International Conference on Software Architecture, WICSA'01
34. Mitchell, B.S., Mancoridis, S., 2002. Using heuristic search techniques to extract design abstractions from source code. In: Proceedings of the AAAI Genetic and Evolutionary Computation Conference, GECCO'02
35. Mitchell, B.S., Mancoridis, S., 2003. Modeling the search landscape of metaheuristic software clustering algorithms. In: Proceedings of the AAAI Genetic and Evolutionary Computation Conference, GECCO'03
36. H. Müller, M. Orgun, S. Tilley, and J. Uhl A reverse engineering approach to subsystem structure identification Journal of Software Maintenance: Research and Practice 5 1993 181 204
37. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1988 John Wiley and Sons New York
38. Ng, A., Jordan, M., Weiss, Y., 2001. On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems, number 14
39. North, S., Koutsofios, E., 1994. Applications of graph visualization. In: Proceedings of Graphics Interface
40. A. Pothen, H.D. Simon, and K.-P. Liou Partitioning sparse matrices with eigenvectors of graphs SIAM Journal of Matrix Analysis and Applications 11 1990 430 452
41. S. Russell, and P. Norvig Artificial intelligence: a modern approach. Series in Artificial Intelligence 2002 Prentice Hall Englewood Cliffs, NJ
42. S. Sarkar, and P. Soundararajan Supervised learning of large perceptual organization: graph spectral partitioning and learning automata IEEE Transaction on Pattern Analysis and Machine Intelligence 22 5 2000 504 525
43. Sartipi, K., Kontogiannis, K., 2001. Component clustering based on maximal association. In: Proceedings of Working Conference on Reverse Engineering (WCRE'01)
44. Sartipi, K., Kontogiannis, K., Mavaddat, F., 2000. Architectural design recovery using data mining techniques. In: Proceedings of the European Conference on Software Maintenance and Reengineering (CSMR'00)
45. Schwanke, R., 1991. An intelligent tool for re-engineering software modularity. In: Proceedings of 13th International Conference on Software Engineering
46. R. Schwanke, and S. Hanson Using neural networks to modularize software Machine Learning 15 1998 137 168
47. J. Shi, and J. Malik Normalized cuts and image segmentation IEEE Transactions on Pattern Analysis and Machine Intelligence 22 8 2000 888 905
48. Shokoufandeh, A., Dickinson, S., 1999. Applications of bipartite matching to problems in object recognition
49. Shokoufandeh, A., Dickinson, S., Siddiqi, K., Zucker, S.W., 1999. Indexing using a spectral encoding of topological structure. In: Proceedings of Computer Vision and Pattern Recognition, pp. 491-497
50. Siddiqi, K., Shokoufandeh, A., Dickinson, S., Zucker, S., 1999. Shock graphs and shape matching
51. Spielman, D., Teng, S.H., 1996. Spectral partitioning works: planar graphs and nite element meshes. In: 37th Annual Symposium on Foundations of Computer Science, (FOCS), pp. 96-105
52. Sviridenko, M.I., 1998. Best possible approximation algorithm for MAX SAT with cardinal constraint. In: APPROX: International Workshop on Approximation Algorithms for Combinatorial Optimization
53. Tzerpos, V., Holt, R.C., 2000. ACDC: an algorithm for comprehension driven clustering. In: Proceedings of the Working Conference in Reverse Engineering (WCRE'00)
54. van Deursen, A., Kuipers, T., 1999. Identifying objects using cluster and concept analysis. In: Proceedings of International Conference on Software Engineering
55. Wiggerts, T., 1997. Using clustering algorithms in legacy systems remodularization. In: Proceedings of Working Conference on Reverse Engineering
56. Zwick, U., 1999. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In: ACM Symposium on Theory of Computing, pp. 679-687