Algorithms for Mining the Evolution of Conserved Relational States in Dynamic Networks
Authors:
- Rezwan AhmedRARezwan Ahmed
- George KarypisGKGeorge Karypis
- 1 December 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Abstract
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.Keywords
This publication has 27 references indexed in Scilit:
- Discovering Relevant Cross-Graph Cliques in Dynamic Networks2009
- Mining Graph Evolution Rules2009
- Mining Periodic Behavior in Dynamic Social Networks2008
- Community evolution in dynamic multi-mode networks2008
- Comparison of descriptor spaces for chemical compound retrieval and classificationKnowledge and Information Systems, 2007
- Detecting Conserved Interaction Patterns in Biological NetworksJournal of Computational Biology, 2006
- Evolutionary clustering2006
- A framework for analysis of dynamic social networks2006
- Expanded Trade and GDP DataJournal of Conflict Resolution, 2002
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998