Shifting niches for community structure detection

Corrado Grappiolo, Julian Togelius, Georgios N. Yannakakis

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We present a new evolutionary algorithm for community structure detection in both undirected and unweighted (sparse) graphs and fully connected weighted digraphs (complete networks). Previous investigations have found that, although evolutionary computation can identify community structure in complete networks, this approach seems to scale badly due to solutions with the wrong number of communities dominating the population. The new algorithm is based on a niching model, where separate compartments of the population contain candidate solutions with different numbers of communities. We experimentally compare the new algorithm to the well-known algorithms of Pizzuti and Tasgin, and find that we outperform those algorithms for sparse graphs under some conditions, and drastically outperform them on complete networks under all tested conditions.

    Original languageEnglish (US)
    Title of host publication2013 IEEE Congress on Evolutionary Computation, CEC 2013
    Pages111-118
    Number of pages8
    DOIs
    StatePublished - 2013
    Event2013 IEEE Congress on Evolutionary Computation, CEC 2013 - Cancun, Mexico
    Duration: Jun 20 2013Jun 23 2013

    Other

    Other2013 IEEE Congress on Evolutionary Computation, CEC 2013
    CountryMexico
    CityCancun
    Period6/20/136/23/13

    Fingerprint

    Community Structure
    Niche
    Sparse Graphs
    Evolutionary algorithms
    Niching
    Evolutionary Computation
    Digraph
    Evolutionary Algorithms
    Community
    Model

    Keywords

    • Community Structures
    • Complete Weighted Networks
    • Evolutionary Computation
    • Niching
    • Sparse Graphs

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Theoretical Computer Science

    Cite this

    Grappiolo, C., Togelius, J., & Yannakakis, G. N. (2013). Shifting niches for community structure detection. In 2013 IEEE Congress on Evolutionary Computation, CEC 2013 (pp. 111-118). [6557560] https://doi.org/10.1109/CEC.2013.6557560

    Shifting niches for community structure detection. / Grappiolo, Corrado; Togelius, Julian; Yannakakis, Georgios N.

    2013 IEEE Congress on Evolutionary Computation, CEC 2013. 2013. p. 111-118 6557560.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Grappiolo, C, Togelius, J & Yannakakis, GN 2013, Shifting niches for community structure detection. in 2013 IEEE Congress on Evolutionary Computation, CEC 2013., 6557560, pp. 111-118, 2013 IEEE Congress on Evolutionary Computation, CEC 2013, Cancun, Mexico, 6/20/13. https://doi.org/10.1109/CEC.2013.6557560
    Grappiolo C, Togelius J, Yannakakis GN. Shifting niches for community structure detection. In 2013 IEEE Congress on Evolutionary Computation, CEC 2013. 2013. p. 111-118. 6557560 https://doi.org/10.1109/CEC.2013.6557560
    Grappiolo, Corrado ; Togelius, Julian ; Yannakakis, Georgios N. / Shifting niches for community structure detection. 2013 IEEE Congress on Evolutionary Computation, CEC 2013. 2013. pp. 111-118
    @inproceedings{97537f27001a428688fa8ab54ff18d27,
    title = "Shifting niches for community structure detection",
    abstract = "We present a new evolutionary algorithm for community structure detection in both undirected and unweighted (sparse) graphs and fully connected weighted digraphs (complete networks). Previous investigations have found that, although evolutionary computation can identify community structure in complete networks, this approach seems to scale badly due to solutions with the wrong number of communities dominating the population. The new algorithm is based on a niching model, where separate compartments of the population contain candidate solutions with different numbers of communities. We experimentally compare the new algorithm to the well-known algorithms of Pizzuti and Tasgin, and find that we outperform those algorithms for sparse graphs under some conditions, and drastically outperform them on complete networks under all tested conditions.",
    keywords = "Community Structures, Complete Weighted Networks, Evolutionary Computation, Niching, Sparse Graphs",
    author = "Corrado Grappiolo and Julian Togelius and Yannakakis, {Georgios N.}",
    year = "2013",
    doi = "10.1109/CEC.2013.6557560",
    language = "English (US)",
    isbn = "9781479904549",
    pages = "111--118",
    booktitle = "2013 IEEE Congress on Evolutionary Computation, CEC 2013",

    }

    TY - GEN

    T1 - Shifting niches for community structure detection

    AU - Grappiolo, Corrado

    AU - Togelius, Julian

    AU - Yannakakis, Georgios N.

    PY - 2013

    Y1 - 2013

    N2 - We present a new evolutionary algorithm for community structure detection in both undirected and unweighted (sparse) graphs and fully connected weighted digraphs (complete networks). Previous investigations have found that, although evolutionary computation can identify community structure in complete networks, this approach seems to scale badly due to solutions with the wrong number of communities dominating the population. The new algorithm is based on a niching model, where separate compartments of the population contain candidate solutions with different numbers of communities. We experimentally compare the new algorithm to the well-known algorithms of Pizzuti and Tasgin, and find that we outperform those algorithms for sparse graphs under some conditions, and drastically outperform them on complete networks under all tested conditions.

    AB - We present a new evolutionary algorithm for community structure detection in both undirected and unweighted (sparse) graphs and fully connected weighted digraphs (complete networks). Previous investigations have found that, although evolutionary computation can identify community structure in complete networks, this approach seems to scale badly due to solutions with the wrong number of communities dominating the population. The new algorithm is based on a niching model, where separate compartments of the population contain candidate solutions with different numbers of communities. We experimentally compare the new algorithm to the well-known algorithms of Pizzuti and Tasgin, and find that we outperform those algorithms for sparse graphs under some conditions, and drastically outperform them on complete networks under all tested conditions.

    KW - Community Structures

    KW - Complete Weighted Networks

    KW - Evolutionary Computation

    KW - Niching

    KW - Sparse Graphs

    UR - http://www.scopus.com/inward/record.url?scp=84881578305&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84881578305&partnerID=8YFLogxK

    U2 - 10.1109/CEC.2013.6557560

    DO - 10.1109/CEC.2013.6557560

    M3 - Conference contribution

    AN - SCOPUS:84881578305

    SN - 9781479904549

    SP - 111

    EP - 118

    BT - 2013 IEEE Congress on Evolutionary Computation, CEC 2013

    ER -