Multi-Objective Optimization for Relevant Sub-graph Extraction
In recent years, graph clustering methods have rapidly emerged to mine latent knowledge and functions in networks. Most sub-graphs extracting methods that have been introduced fall into graph clustering. In this paper, a novel trend of relevant sub-graphs extraction problem was considered as multi-objective optimization. Genetic Algorithms (GAs) and Simulated Annealing (SA) were then used to solve the problem applied to biological networks. Comparisons between GAs, SA and Markov Cluster Algorithm (MCL) were carried out and the results showed that the proposed approach is superior.
KeywordsSub-graph extraction Genetic algorithms Simulated annealing Multi-objective optimization
We thank F. Radvanyi for fruitful discussions and the anonymous referees for their pertinent suggestions.This work is supported by the INCa (French National Institute of Cancer) through the INCa project PL-2010-196. R. Nicolle is supported by a fellowship from the French Ministry of Higher Education and Research.
- 4.Coello, C.A.C., Dhaenens, C., Jourdan, L. (eds.): Advances in Multi-Objective Nature Inspired Computing. Studies in Computational Intelligence, vol. 272. Springer, Heidelberg (2010)Google Scholar
- 5.van Dongen, S.: Graph clustering by flow simulation. Ph.D. thesis, University of Utrecht (May 2000)Google Scholar
- 6.Dupont, P., Callut, J., Dooms, G., Monette, J.N., Deville, Y.: Relevant subgraph extraction from random walks in a graph (2006)Google Scholar
- 7.Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’04,pp. 118–127 (2004)Google Scholar