Skip to main content

Evaluating the community partition quality of a network with a genetic programming approach

  • Conference paper
  • First Online:
Complex Networks & Their Applications V (COMPLEX NETWORKS 2016 2016)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 693))

Included in the following conference series:

  • 2632 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, p. 026113, 2004.

    Google Scholar 

  2. L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas, “Comparing community structure identification,” 2005.

    Google Scholar 

  3. S. Fortunato and C. Castellano, Community Structure in Graphs. Encyclopedia of Complexity and System Science, Springer, 2008.

    Google Scholar 

  4. M. E. J. Newman, “Modularity and community structure in networks,” PROC.NATL.ACAD.SCI.USA, vol. 103, p. 8577, 2006.

    Google Scholar 

  5. S. Fortunato and M. Barthelemy, “Resolution limit in community detection,” PROC.NATL.ACAD.SCI.USA, vol. 104, p. 36, 2007.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. R. Poli, W. B. Langdon, and N. F. McPhee, A field guide to genetic programming. 2008.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. 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.

    Google Scholar 

  12. J. R. Koza, Genetic programming: on the programming of computers by means of natural selection. Cambridge, MA: MIT Press, 1992.

    Google Scholar 

  13. R. Poli, W. B. Langdon, and N. F. Mcphee, A field guide to genetic programming. March 2008.

    Google Scholar 

  14. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Marco Buzzanca , Vincenza Carchiolo , Alessandro Longheu , Michele Malgeri or Giuseppe Mangioni .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics