Interactive Graph Clustering based on User Hints

Graph clustering is a difficult optimization problem that arises in Software Engineering. This paper presents a framework for graph clustering where users play a strong role. In the framework, a soft computing method produces a clustering of the graph and a visualization of it is provided using some graph drawing techniques. Through the visualization the user can then analyze the clustering and give “hints” that help the soft computing method to find better solutions. Hints include a variety of constraints for solutions, as well as direct manipulation of the previously computed clustering. The framework is flexible: it can accommodate several kinds of hints, clustering algorithms, and visualization techniques.

[1]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[2]  Derek Rayside,et al.  The effect of call graph construction algorithms for object-oriented programs on automatic clustering , 2000, Proceedings IWPC 2000. 8th International Workshop on Program Comprehension.

[3]  Youssef Saab,et al.  Stochastic evolution: a fast effective heuristic for some generic layout problems , 1991, DAC '90.

[4]  Gregor von Laszewski,et al.  Intelligent Structural Operators for the k-way Graph Partitioning Problem , 1991, ICGA.

[5]  Byung Ro Moon,et al.  Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.

[6]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[7]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[8]  Richard C. Holt,et al.  On the stability of software clustering algorithms , 2000, Proceedings IWPC 2000. 8th International Workshop on Program Comprehension.

[9]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[10]  Rainer Koschke,et al.  A framework for experimental evaluation of clustering techniques , 2000, Proceedings IWPC 2000. 8th International Workshop on Program Comprehension.

[11]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[12]  Fred W. Glover,et al.  Tabu search for graph partitioning , 1996, Ann. Oper. Res..

[13]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[14]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[16]  Martin Grötschel,et al.  Facets of the clique partitioning polytope , 1990, Math. Program..

[17]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[18]  Roy D. Williams,et al.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..