Framework for mining regular patterns in dynamic networks Online publication date: Tue, 05-Jan-2016
by Anand Gupta; Hardeo Kumar Thakur; Bhavuk Jain; Sonali Garg
International Journal of Knowledge Engineering and Data Mining (IJKEDM), Vol. 3, No. 3/4, 2015
Abstract: Dynamic networks are categorised into four major types: Unweighted-Undirected, Weighted-Undirected, Unweighted-Directed and Weighted-Directed. Mining regular patterns in these dynamic networks finds extensive applications in prediction systems, analysing social network activity, etc. Depending on types of dynamic networks, regular patterns conforming to different characteristics of a system can be mined, each providing some unique information. Dynamic networks have pattern mining techniques that mine these characteristics individually. However, to the best of our knowledge, no such work is available that mines all these regular patterns (if possible) in a single run for any type of the dynamic networks. In this paper, the authors' focus is on providing a framework to make the task of mining regular patterns in dynamic networks more efficient and exhaustive. The accuracy of this framework has been verified mathematically and its efficiency is validated experimentally on a real-world network (Enron dataset).
Online publication date: Tue, 05-Jan-2016
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Data Mining (IJKEDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org