WalDis: Mining Discriminative Patterns within Dynamic Graphs

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

VACULÍK Karel POPELÍNSKÝ Lubomír

Year of publication 2017
Type Conference abstract
MU Faculty or unit

Faculty of Informatics

Citation
Description Real-world networks typically evolve through time, which means there are various events occurring, such as edge additions or attribute changes. In order to understand the events, one must be able to discriminate between different events. Existing approaches typically discriminate whole graphs, which are, in addition, mostly static. We propose a new algorithm WalDis for mining discriminate patterns of events in dynamic graphs. This algorithm uses sampling and greedy approaches in order to keep the performance high. Furthermore, it does not require the time to be discretized as other algorithms commonly do. We have evaluated the algorithm on three real-world graph datasets.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info