A new meta-method for graph partitioning

In this paper, a new meta-method based on the physical nuclear process is presented. This meta-method called Fusion-Fission is applied to the two different class of graph partitioning problems. This paper presents results found by this method in comparison with results of classical methods for an air traffic management problem, an image segmentation problem and applied to classical benchmarks. All of these applications of the Fusion-Fission method are successful and the results found by this method outperform state-of-the-art graph partitioning packages both on classical benchmarks and on the air traffic management problem.

[1]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[2]  Chris Walshaw,et al.  Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm , 2000, SIAM J. Sci. Comput..

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

[4]  Charles-Edmond Bichot,et al.  Optimisation par fusion et fission. Application au problème du découpage aérien européen Charles-Edmond Bichot , 2004 .

[5]  Jianbo Shi,et al.  Learning Segmentation by Random Walks , 2000, NIPS.

[6]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[7]  George Karypis,et al.  Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering , 2004, Machine Learning.

[8]  Charles-Edmond Bichot,et al.  A metaheuristic based on fusion and fission for partitioning problems , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[9]  Jianbo Shi,et al.  Spectral segmentation with multiscale graph decomposition , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[10]  Jitendra Malik,et al.  Image and video segmentation: the normalized cut framework , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[11]  Chris Walshaw,et al.  A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning , 2004, J. Glob. Optim..

[12]  Inderjit S. Dhillon,et al.  Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.

[13]  Joan Carletta,et al.  An evaluation of move-based multi-way partitioning algorithms , 2000, Proceedings 2000 International Conference on Computer Design.

[14]  Michael Werman,et al.  Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping, and Image Database Organization , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Charles-Edmond Bichot,et al.  A New Method, the Fusion Fission, for the Relaxed k-way Graph Partitioning Problem, and Comparisons with Some Multilevel Algorithms , 2007, J. Math. Model. Algorithms.

[16]  Chris H. Q. Ding,et al.  Bipartite graph partitioning and data clustering , 2001, CIKM '01.

[17]  Avinash C. Kak,et al.  On combining graph-partitioning with non-parametric clustering for image segmentation , 2004, Comput. Vis. Image Underst..

[18]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[19]  Inderjit S. Dhillon,et al.  Kernel k-means: spectral clustering and normalized cuts , 2004, KDD.

[20]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[21]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[22]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[23]  Chris H. Q. Ding,et al.  A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[24]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[25]  Pietro Perona,et al.  A Factorization Approach to Grouping , 1998, ECCV.

[26]  J. Siskind,et al.  Image segmentation with minimum mean cut , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[27]  Bruce Hendrickson,et al.  Graph Partitioning and Parallel Solvers: Has the Emperor No Clother? (Extended Abstract) , 1998, IRREGULAR.

[28]  Shang-Hua Teng,et al.  How Good is Recursive Bisection? , 1997, SIAM J. Sci. Comput..