cispa_all_3005.pdf (429.35 kB)

Discovering Robustly Connected Subgraphs with Simple Descriptions

Download (429.35 kB)
conference contribution
posted on 2023-11-29, 18:11 authored by Janis KalofoliasJanis Kalofolias, Mario Boley, Jilles VreekenJilles Vreeken
We study the problem of discovering robustly connected subgraphs that have simple descriptions. Our aim is, hence, to discover vertex sets which not only a) induce a subgraph that is difficult to fragment into disconnected components, but also b) can be selected from the entire graph using just a simple conjunctive query on their vertex attributes. Since many subgraphs do not have such a simple logical description, first mining robust subgraphs and post-hoc discovering their description leads to sub-optimal results. Instead, we propose to optimise over describable subgraphs only. To do so efficiently we propose a non-redundant iterative deepening approach, which we equip with a linear-time tight optimistic estimator that allows pruning large parts of the search space. Extensive empirical evaluation shows that our method can handle large real-world graphs, and discovers easily interpretable and meaningful subgraphs.


Preferred Citation

Janis Kalofolias, Mario Boley and Jilles Vreeken. Discovering Robustly Connected Subgraphs with Simple Descriptions. In: IEEE International Conference on Data Mining (ICDM). 2019.

Primary Research Area

  • Algorithmic Foundations and Cryptography

Secondary Research Area

  • Empirical and Behavioral Security

Name of Conference

IEEE International Conference on Data Mining (ICDM)

Legacy Posted Date


Open Access Type

  • Unknown


@inproceedings{cispa_all_3005, title = "Discovering Robustly Connected Subgraphs with Simple Descriptions", author = "Kalofolias, Janis and Boley, Mario and Vreeken, Jilles", booktitle="{IEEE International Conference on Data Mining (ICDM)}", year="2019", }

Usage metrics


    No categories selected


    Ref. manager