Physical Sciences and Mathematics Commons^™

As Strong As The Weakest Link: Mining Diverse Cliques In Weighted Graphs, Petko Bogdanov, Ben Baumer, Prithwish Basu, Amotz Bar-Noy, Ambuj K. Singh

Statistical and Data Sciences: Faculty Publications

Mining for cliques in networks provides an essential tool for the discovery of strong associations among entities. Applications vary, from extracting core subgroups in team performance data arising in sports, entertainment, research and business; to the discovery of functional complexes in high-throughput gene interaction data. A challenge in all of these scenarios is the large size of real-world networks and the computational complexity associated with clique enumeration. Furthermore, when mining for multiple cliques within the same network, the results need to be diversified in order to extract meaningful information that is both comprehensive and representative of the whole dataset. We …