Large-scale network motif analysis using compression

• Autores: Peter Bloem, Steven de Rooij
• Localización: Data mining and knowledge discovery, ISSN 1384-5810, Vol. 34, Nº 5, 2020, págs. 1421-1453
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We introduce a new method for finding network motifs. Subgraphs are motifs when their frequency in the data is high compared to the expected frequency under a null model. To compute this expectation, a full or approximate count of the occurrences of a motif is normally repeated on as many as 1000 random graphs sampled from the null model; a prohibitively expensive step. We use ideas from the minimum description length literature to define a new measure of motif relevance. With our method, samples from the null model are not required. Instead we compute the probability of the data under the null model and compare this to the probability under a specially designed alternative model. With this new relevance test, we can search for motifs by random sampling, rather than requiring an accurate count of all instances of a motif. This allows motif analysis to scale to networks with billions of links.