Abstract
Dynamic graphs are valuable means to represent the volatility of real-world networks. In such scenarios, dense subgraph mining is a widely studied task, as it can give insights about how the relationships change over time. However, there are cases in which these changes are correlated. For example, in a road network, a traffic accident affects also the traffic in the adjacent road segments. We consider the problem of detecting dense regions of correlation in dynamically evolving networks, and demonstrate EXCODE, a system that solves two variants of the problem, which are based on two different density measures. It enumerates all the subgraphs satisfying certain density and correlation constraints, but can also detect compact subsets of limited overlap. In this demonstration, the audience can try this tool with real-world datasets, hence visualizing, interacting, and exploring the dense correlated subgraphs discovered in the mining process. An interactive panel allows them to learn where the correlations are located in the network, how the regions of correlation are related to each other, and how they evolve over time.
Original language | English |
---|---|
Title of host publication | Proceedings - 19th IEEE International Conference on Data Mining Workshops, ICDMW 2019 |
Editors | Panagiotis Papapetrou, Xueqi Cheng, Qing He |
Publisher | IEEE |
Pages | 1114-1117 |
Number of pages | 4 |
Volume | 2019-November |
ISBN (Electronic) | 9781728146034 |
DOIs | |
Publication status | Published - 1 Nov 2019 |
Event | 19th IEEE International Conference on Data Mining Workshops, ICDMW 2019 - Beijing, China Duration: 8 Nov 2019 → 11 Nov 2019 |
Conference
Conference | 19th IEEE International Conference on Data Mining Workshops, ICDMW 2019 |
---|---|
Country/Territory | China |
City | Beijing |
Period | 8/11/19 → 11/11/19 |
Keywords
- Correlated subgraphs
- Dense subgraphs
- Dynamic graphs