Algorithms for mining the evolution of conserved relational states in dynamic networks

Rezwan Ahmed, George Karypis

Research output: Contribution to journalArticlepeer-review

29 Scopus citations


Dynamic networks have recently being recognized as a powerful abstraction to model and represent the temporal changes and dynamic aspects of the data underlying many complex systems. Significant insights regarding the stable relational patterns among the entities can be gained by analyzing temporal evolution of the complex entity relations. This can help identify the transitions from one conserved state to the next and may provide evidence to the existence of external factors that are responsible for changing the stable relational patterns in these networks. This paper presents a new data mining method that analyzes the time-persistent relations or states between the entities of the dynamic networks and captures all maximal non-redundant evolution paths of the stable relational states. Experimental results based on multiple datasets from real-world applications show that the method is efficient and scalable.

Original languageEnglish (US)
Pages (from-to)603-630
Number of pages28
JournalKnowledge and Information Systems
Issue number3
StatePublished - Dec 2012

Bibliographical note

Funding Information:
This work was supported in part by NSF (IIS-0905220, OCI-1048018, and IOS-0820730) and by the DOE grant USDOE/DE-SC0005013 and the Digital Technology Center at the University of Minnesota. Access to research and computing facilities was provided by the Digital Technology Center and the Minnesota Supercomputing Institute.


  • Dynamic network
  • Evolution
  • Relational state


Dive into the research topics of 'Algorithms for mining the evolution of conserved relational states in dynamic networks'. Together they form a unique fingerprint.

Cite this