Abstract
Although the problem of partition quality evaluation is well-known in literature, most of the traditional approaches involve the application of a model built upon a theoretical foundation and then applied to real data. Conversely, this work presents a novel approach: it extracts a model from a network which partition in ground-truth communities is known, so that it can be used in other contexts. The extracted model takes the form of a validation function, which is a function that assigns a score to a specific partition of a network: the closer the partition is to the optimal, the better the score. In order to obtain a suitable validation function, we make use of genetic programming, an application of genetic algorithms where the individuals of a population are computer programs. In this paper we present a computationally feasible methodology to set up the genetic programming run, and show our design choices for the terminal set, function set, fitness function and control parameters.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, p. 026113, 2004.
L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas, “Comparing community structure identification,” 2005.
S. Fortunato and C. Castellano, Community Structure in Graphs. Encyclopedia of Complexity and System Science, Springer, 2008.
M. E. J. Newman, “Modularity and community structure in networks,” PROC.NATL.ACAD.SCI.USA, vol. 103, p. 8577, 2006.
S. Fortunato and M. Barthelemy, “Resolution limit in community detection,” PROC.NATL.ACAD.SCI.USA, vol. 104, p. 36, 2007.
U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, and D. Wagner, “On modularity clustering,” Knowledge and Data Engineering, IEEE Transactions on, vol. 20, pp. 172–188, Feb. 2008.
V. Nicosia, G. Mangioni, V. Carchiolo, and M. Malgeri, “Extending the definition of modularity to directed graphs with overlapping communities,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2009, no. 03, p. P03024, 2009.
V. Carchiolo, A. Longheu, M. Malgeri, and G. Mangioni, “Search for overlapped communities by parallel genetic algorithms,” International Journal of Computer Science and Information Security, Vol. 6 No. 2, pp. 113-118, vol. abs/0912.0913, 2009.
R. Poli, W. B. Langdon, and N. F. McPhee, A field guide to genetic programming. 2008.
W. Banzhaf, F. D. Francone, R. E. Keller, and P. Nordin, Genetic Programming: An Introduction: on the Automatic Evolution of Computer Programs and Its Applications. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1998.
J. Wu, H. Xiong, and J. Chen, “Adapting the right measures for k-means clustering,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’09, (New York, NY, USA), pp. 877–886, ACM, 2009.
J. R. Koza, Genetic programming: on the programming of computers by means of natural selection. Cambridge, MA: MIT Press, 1992.
R. Poli, W. B. Langdon, and N. F. Mcphee, A field guide to genetic programming. March 2008.
S. Luke, “A comparison of crossover and mutation in genetic programming,” in Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 240–248, Morgan Kaufmann, 1997.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Buzzanca, M., Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G. (2017). Evaluating the community partition quality of a network with a genetic programming approach. In: Cherifi, H., Gaito, S., Quattrociocchi, W., Sala, A. (eds) Complex Networks & Their Applications V. COMPLEX NETWORKS 2016 2016. Studies in Computational Intelligence, vol 693. Springer, Cham. https://doi.org/10.1007/978-3-319-50901-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-50901-3_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50900-6
Online ISBN: 978-3-319-50901-3
eBook Packages: EngineeringEngineering (R0)