A meta-algorithm for finding large k-plexes

• Published in: Knowledge and information systems Vol. 63; no. 7; pp. 1745 - 1769
• Main Authors: Conte, Alessio, Firmani, Donatella, Patrignani, Maurizio, Torlone, Riccardo
• Format: Journal Article
• Language: English
• Published: London Springer London 01.07.2021; Springer Nature B.V
• Subjects: Algorithms; Computer Science; Data Mining and Knowledge Discovery; Database Management; Enumeration; Information Storage and Retrieval; Information Systems and Communication Service; Information Systems Applications (incl.Internet); IT in Business; Regular Paper; Sociology
• ISSN: 0219-1377; 0219-3116; 0219-3116
• DOI: 10.1007/s10115-021-01570-8

We focus on the automatic detection of communities in large networks, a challenging problem in many disciplines (such as sociology, biology, and computer science). Humans tend to associate to form families, villages, and nations. Similarly, the elements of real-world networks naturally tend to form highly connected groups. A popular model to represent such structures is the clique, that is, a set of fully interconnected nodes. However, it has been observed that cliques are too strict to represent communities in practice. The k -plex relaxes the notion of clique, by allowing each node to miss up to k connections. Although k -plexes are more flexible than cliques, finding them is more challenging as their number is greater. In addition, most of them are small and not significant. In this paper we tackle the problem of finding only large k -plexes (i.e., comparable in size to the largest clique) and design a meta-algorithm that can be used on top of known enumeration algorithms to return only significant k -plexes in a fraction of the time. Our approach relies on: (1) methods for strongly reducing the search space and (2) decomposition techniques based on the efficient computation of maximal cliques. We demonstrate experimentally that known enumeration algorithms equipped with our approach can run orders of magnitude faster than full enumeration.