Advertisement

An Effective Multi-level Algorithm Based on Simulated Annealing for Bisecting Graph

  • Lingyu Sun
  • Ming Leng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4679)

Abstract

Partitioning is a fundamental problem in diverse fields of study such as knowledge discovery, data mining, image segmentation and grouping. The min-cut bipartitioning problem is a fundamental graph partitioning problem and is NP-Complete. In this paper, we present an effective multi-level algorithm based on simulated annealing for bisecting graph. The success of our algorithm relies on exploiting both the simulated annealing procedure and the concept of the graph core. Our experimental evaluations on 18 different graphs show that our algorithm produces encouraging solutions compared with those produced by MeTiS that is a state-of-the-art partitioner in the literature.

Keywords

Simulated Annealing Tabu Search Boundary Vertex External Degree Simulated Annealing Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning. Integration, the VLSI Journal 19, 1–81 (1995)zbMATHCrossRefGoogle Scholar
  2. 2.
    Hsu, W.H., Anvil, L.S.: Self-organizing systems for knowledge discovery in large databases. In: International Joint Conference on Neural Networks, pp. 2480–2485 (1999)Google Scholar
  3. 3.
    Zha, H., He, X., Ding, C., Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. In: Proc. ACM Conf. Information and Knowledge Management, pp. 25–32 (2001)Google Scholar
  4. 4.
    Ding, C., He, X., Zha, H., Gu, M., Simon, H.: A Min-Max cut algorithm for graph partitioning and data clustering. In: Proc. IEEE Conf. Data Mining, pp. 107–114 (2001)Google Scholar
  5. 5.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 731–737 (1997)Google Scholar
  6. 6.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 888–905 (2000)Google Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. WH Freeman, New York (1979)zbMATHGoogle Scholar
  8. 8.
    Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49, 291–307 (1970)Google Scholar
  9. 9.
    Fiduccia, C., Mattheyses, R.: A linear-time heuristics for improving network partitions. In: Proc. 19th Design Automation Conf. pp. 175–181 (1982)Google Scholar
  10. 10.
    Leng, M., Yu, S., Chen, Y.: An effective refinement algorithm based on multi-level paradigm for graph bipartitioning. In: The IFIP TC5 International Conference on Knowledge Enterprise. IFIP Series, pp. 294–303. Springer (2006)Google Scholar
  11. 11.
    Leng, M., Yu, S.: An effective multi-level algorithm for bisecting graph. In: Li, X., Zaïane, O.R., Li, Z. (eds.) ADMA 2006. LNCS (LNAI), vol. 4093, pp. 493–500. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Żola, J., Wyrzykowski, R.: Application of genetic algorithm for mesh partitioning. In: Proc. Workshop on Parallel Numerics, pp. 209–217 (2000)Google Scholar
  13. 13.
    Bahreininejad, A., Topping, B.H.V., Khan, A.I.: Finite element mesh partitioning using neural networks. Advances in Engineering Software, 103–115 (1996)Google Scholar
  14. 14.
    Leng, M., Yu, S.: An effective multi-level algorithm based on ant colony optimization for bisecting graph. In: The 11th PacificAsia Conference on Knowledge Discovery and Data Mining. LNCS(LNAI), pp. 138–149. Springer, Heidelberg (2007)Google Scholar
  15. 15.
    Sun, L., Leng, M., Yu, S.: A new multi-level algorithm based on particle swarm optimization for bisecting graph. In: The 3rd International Conference on Advanced Data Mining and Applications. LNCS(LNAI), Springer, Heidelberg (2007)Google Scholar
  16. 16.
    Sun, L., Leng, M.: An effective refinement algorithm based on swarm intelligence for graph bipartitioning. In: The International symposium on combinatorics, algorithms, probabilistic and experimental methodologies. LNCS(LNAI), Springer, Heidelberg (2007)Google Scholar
  17. 17.
    Karypis, G., Kumar, V.: MeTiS 4.0: Unstructured graphs partitioning and sparse matrix ordering system. Technical Report, Department of Computer Science, University of Minnesota (1998)Google Scholar
  18. 18.
    Selvakkumaran, N., Karypis, G.: Multi-objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization. IEEE Trans. Computer Aided Design 25, 504–517 (2006)CrossRefGoogle Scholar
  19. 19.
    Amine, A.B., Karypis, G.: Multi-level algorithms for partitioning power-law Graphs. Technical Report, Department of Computer Science, University of Minnesota (2005), available on the WWW at URL http://www.cs.umn.edu/~metis
  20. 20.
    Gil, C., Ortega, J., Montoya, M.G.: Parallel heuristic search in multilevel graph partitioning. In: Proc. 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, pp. 88–95 (2004)Google Scholar
  21. 21.
    Alpert, C.J.: The ISPD98 circuit benchmark suite. In: Proc. Intel Symposium of Physical Design, pp. 80–85 (1998)Google Scholar
  22. 22.
    Aarts, E., Korst, J.: Simulated annealing and boltzmann machines. A Stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley and Sons, New York (1990)Google Scholar
  23. 23.
    Gil, C., Ortega, J., Montoya, M.G., Basnos, R.: A mixed heuristic for circuit partitioning. Computational Optimization and Applications 23, 321–340 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Batagelj, V., Zaversnik, M.: Generalized cores. Journal of the ACM, 1–8 (2002)Google Scholar
  25. 25.
    Glover, F., Manuel, L.: Tabu search: Modern heuristic techniques for combinatorial problems, pp. 70–150. Blackwell Scientific Publications, Oxford (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Lingyu Sun
    • 1
  • Ming Leng
    • 2
  1. 1.Department of Computer Science, Jinggangshan College, Ji’an, 343009P.R. China
  2. 2.School of Computer Engineering and Science, Shanghai University, Shanghai, 200072P.R. China

Personalised recommendations