A hybrid ensemble approach for the Steiner tree problem in large graphs: A geographical application

Applied Soft Computing Journal

Volumn 11, Issue 8, 2011, Pages 5745-5754

  Bouchachia, Abdelhamid ^a   Prossegger, Markus ^b  

^a UNIVERSITY OF KLAGENFURT   (Austria)

^b CARINTHIA UNIVERSITY OF APPLIED SCIENCES   (Austria)

Author keywords

Divide and conquer; Ensemble clustering; Parallel ant colony optimization; Spectral clustering; Steiner tree problem

Indexed keywords

DIVIDE AND CONQUER; ENSEMBLE CLUSTERING; PARALLEL ANT COLONY OPTIMIZATION; SPECTRAL CLUSTERING; STEINER TREE PROBLEM;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BENCHMARKING; OPTIMIZATION; PLANT EXTRACTS;

TREES (MATHEMATICS);

EID: 80053576557     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2011.03.005     Document Type: Article

References (31)

1. S. Barnard, and H. Simon Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems Concurrency: Pract. Exp. 6 2 1994 101 117
2. S. Barnard, and H. Simon A parallel implementation of multilevel recursive spectral besection for application to adaptive unstructured meshes Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing 1995 627 632
3. A. Bouchachia, and W. Pedrycz Enhancement of fuzzy clustering by mechanisms of partial supervision Fuzzy Sets Syst. 735 13 2006 776 786
4. B. Chamberlain, Graph partitioning algorithms for distributing workloads of parallel computations, Tech. Re TR-98-10-03, Univ. of Washington, Dept. of Computer Science & Engineering, 1998.
5. S. Chu, J. Roddick, J. Pan, and C. Su Parallelization strategies for ant colony optimization Proceedings of the 5th International Symposium on Methodologies for Intelligent Systems 2003 Springer 279 284 (Pubitemid 37331884)
6. C. Domeniconi, and M. Al-Razgan Weighted cluster ensembles: methods and analysis ACM Trans. Knowl. Discov. Data 2 4 2009 1 40
7. X. Fern, and C. Brodley Solving cluster ensemble problems by bipartite graph partitioning Proceedings of the Twenty-first International Conference on Machine Learning 2004 36
8. M. Fiedler A property of eigenvectors of non-negative symmetric matrices and its application to graph theory Czech. Math. J. 25 1975 619 633
9. G. Flake, R. Tarjan, and K. Tsioutsiouliklis Graph clustering and minimum cut trees Internet Math. 1 3 2004 355 378
10. D. Greene, A. Tsymbal, N. Bolshakova, and P. Cunningham Ensemble clustering in medical diagnostics 17th IEEE Symposium on Computer-based Medical Systems 2004 576 581
11. S. Hadjitodorov, L. Kuncheva, and L. Todorova Moderate diversity for better cluster ensembles Inf. Fusion 7 3 2006 264 275 (Pubitemid 43842123)
12. B. Hendrickson, and R. Leland A multilevel algorithm for partitioning graphs Proceedings of the 1995 ACM/IEEE Conference on Supercomputing (CDROM), Supercomputing'95 1995 ACM New York, NY, USA
13. F. Hwang, D. Richards, and P. Winter The Steiner Tree Problem 1992 North-Holland
14. K. Inoue, and K. Urahama Sequential fuzzy cluster extraction by a graph spectral method Pattern Recognit. Lett. 20 7 1999 699 705 (Pubitemid 29515071)
15. A. Ivanov, and A. Tuzhelin Minimal Networks: The Steiner Problem and its Generalizations 1994 CRC Press
16. R. Karp Complexity of Computer Computations, chap. Reducibility among Combinatorial Problems 1972 Plenum Press New York 85 103
17. T. Koch, A. Martin, S. Voß, SteinLib: an updated library on steiner tree problems in graphs, Tech. Re ZIB-Report 00-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustr. 7, Berlin, 2000. http://elib.zib.de/steinlib
18. T. Li, C. Ding, and M. Jordan Solving consensus and semi-supervised clustering problems using nonnegative matrix factorization Proceedings of the 2007 Seventh IEEE International Conference on Data Mining 2007 577 582
19. C. Lim, S. Bohacek, J. Hespanha, and K. Obraczka Hierarchical max-flow routing IEEE Conference on Global Telecommunications Conference 2005 550 556
20. M. Manfrin, M. Birattari, T. Stützle, and M. Dorigo Parallel ant colony optimization for the traveling salesman problem ANTS Workshop 2006 224 234 (Pubitemid 44811951)
21. M. Meila, and J. Shi Learning segmentation by random walks Neural Information Processing Systems, NIPS 2001 873 879
22. M. Middendorf, F. Reischle, and H. Schmeck Multi colony ant algorithms J. Heuristics 8 2002 305 320 (Pubitemid 34536963)
23. S. Monti, P. Tamayo, J. Mesirov, and T. Golub Consensus clustering: a resampling-based method for class discovery and visualization of gene expression microarray data Mach. Learn. 52 1-2 2003 91 118
24. A. Ng, M. Jordan, and Y. Weiss On spectral clustering: analysis and an algorithm Proceedings of Advances in Neural Information Processing Systems (14) 2001 MIT Press 849 856
25. A. Pothen Parallel Numerical Algorithms, chap. Graph Partitioning with Application to Scientific Computing 1995 Kluwer Academic Press
26. A. Pothen, D. Simon, and K. Liou Partitioning sparse matrices with eigenvectors of graphs SIAM J. Matrix Anal. Appl. 11 3 1990 430 452
27. S. Schaeffer Graph clustering Comput. Sci. Rev. 1 1 2007 27 64
28. A. Strehl, J. Ghosh, and C. Cardie Cluster ensembles - a knowledge reuse framework for combining multiple partitions J. Mach. Learn. Res. 3 2002 583 617
29. T. Stuetzle Parallelization strategies for ant colony optimization Proceedings of the 5th International Conference on Parallel Problem Soving for Nature 1998 Springer 722 731 (Pubitemid 128146002)
30. H. Wang, H. Shan, and A. Banerjee Bayesian cluster ensembles Statistical Analysis Data Mining 4 2011 57 70
31. Y. Zhou, H. Cheng, and J. Yu Graph clustering based on structural/attribute similarities Proceedings of VLDB'09 2 2009 718 729