Authors: Anand Gupta; Hardeo Kumar Thakur; Bhavuk Jain; Sonali Garg
Addresses: Department of Computer Engineering, Netaji Subhas Institute of Technology, New Delhi, India ' Department of Computer Engineering, Netaji Subhas Institute of Technology, New Delhi, India ' Department of Information Technology, Netaji Subhas Institute of Technology, New Delhi, India ' Department of Information Technology, Netaji Subhas Institute of Technology, New Delhi, India
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).
Keywords: dynamic weighted graphs; evolving graphs; regular graphs; frequent graphs; pattern mining; regular patterns; dynamic networks; data mining.
International Journal of Knowledge Engineering and Data Mining, 2015 Vol.3 No.3/4, pp.299 - 314
Available online: 05 Jan 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article