Jump to: navigation, search

Program : MS

Research Guide : Dr. Balaraman Ravindan

Areas of Interest :

Graph Mining

Social Network Analysis

Research :

COMMIT : A Scalable Approach to Mining Communication Motifs from Dynamic Networks

A fundamental problem in behavioral analysis of human interactions is to understand how communications unfold. In this work, we study this problem by mining Communication motifs from dynamic interaction networks. A communication motif is a recurring subgraph that has a similar sequence of information flow. Mining communication motifs requires us to explore the exponential subgraph search space where existing techniques fail to scale. To tackle this scalability bottleneck, we develop a technique called COMMIT. COMMIT converts a dynamic graph into a database of sequences. Through careful analysis in the sequence space, only a small portion of the exponential search space is accessed to identify regions embedding communication motifs. Extensive experiments on three different social networks show COMMIT to be up to two orders of magnitude faster than baseline techniques. Furthermore, qualitative analysis demonstrate communication motifs to be effective in characterizing the recurring patterns of interactions while also revealing the role that the underlying social network plays in shaping human behavior.


1. Gurkar, S., Ranu, S., and Ravindran, B. (2015) "COMMIT : A Scalable Approach to Mining Communication Motifs from Dynamic Networks". To appear in the Proceedings of ACM SIGMOD/PODS Conferece on Management of Data. ACM Press.

2. S. Gurukar and B. Ravindran. Temporal analysis of telecom call graphs. In Communication Systems and Networks (COMSNETS), 2014 Sixth International Conference, pages 1-6, Jan 2014

Saket Gurukar

Personal tools