Analysis of Regular Patterns in Un-Weighted Directed Graphs

Analysis of Regular Patterns in Un-Weighted Directed Graphs

Anand Gupta, Hardeo Kumar Thakur, Anmoll Kumar Jain, Prakhar Rustagi
Copyright: © 2022 |Pages: 16
DOI: 10.4018/IJIRR.289571
Article PDF Download
Open access articles are freely available for download

Abstract

Time evolving networks tend to have an element of regularity. This regularity is characterized by existence of repetitive patterns in the data sequences of the graph metrics. As per our research, the relevance of such regular patterns to the network has not been adequately explored. Such patterns in certain data sequences are indicative of properties like popularity, activeness etc. which are of vital significance for any network. These properties are closely indicated by data sequences of graph metrics - degree prestige, degree centrality and occurrence. In this paper, (a) an improved mining algorithm has been used to extract regular patterns in these sequences, and (b) a methodology has been proposed to quantitatively analyse the behavior of the obtained patterns. To analyze this behavior, a quantification measure coined as "Sumscore" has been defined to compare the relative significance of such patterns. The patterns are ranked according to their Sumscores and insights are then drawn upon it. The efficacy of this method is demonstrated by experiments on two real world datasets.
Article Preview
Top

I. Introduction

Real life networks are increasingly being modeled as graphs. Graphs provide an excellent representation of interconnections amongst the nodes of a network. Apart from the information depicted by these connections, some information lays unapparent amongst its properties. Thus, it is imperative to develop methods to process graphs to mine such information. A large amount of work has been done in the field of mining this data from such interconnections.

These connections have traditionally been modeled as static networks (Elseidy et al., 2014; Guimei et al., 2009; Inokuchi et al., 2000; Inokuchi et al., 2003; Kuramochi & Karypis, 2001; Kuramochi & Karypis, 2004; Yan & Han, 2002), which do not change over time. However, real life networks are dynamic in nature, where the nodes and their connections evolve with time. Thus, nowadays, networks are increasingly being modeled in a time-series representation (Borgwardt et al., 2006; Desikan & Srivastava, 2004; Duan et al., 2009; Gupta & Thakur, 2013; Gupta, Thakur, & Goel, 2014; Gupta & Thakur, 2013; Gupta & Thakur, 2015; Gupta, Thakur, & Gundherva, 2014; Gupta et al., in press; Gupta, Thakur, & Kishore, 2014; Halder et al., 2013; Holder & Cook, 2009; Lahiri & Berger-Wolf, 2010; Lin et al., 2008; Obulesu et al., 2014; Rasheed et al., 2011; Yang et al., 2014) where it is represented as a series of graphs. Each subgraph is a snapshot of the network at successive intervals within the duration of observation (Yang et al., 2014). For such representations, data in the graph is seen as data sequence of occurrence, indegree, outdegree etc. for each node and edge. The length of the sequence is equal to the number of snapshots, and each element in the sequence corresponds to the status of the node, or edge, for that snapshot.

Such dynamic graphs usually exhibit recurring patterns in their data-sequences. These recurring patterns find highly lucrative possibilities in domains of email, social networks, transportation networks, stock markets, and many more. They can be used to predict information such as share-price trends, road rush hours, vacation hotspots, airline traffic etc. Extensive research has been carried out for discovery of such patterns(Borgwardt et al., 2006; Gupta & Thakur, 2013; Gupta, Thakur, & Goel, 2014; Gupta & Thakur, 2013; Gupta & Thakur, 2015; Gupta, Thakur, & Gundherva, 2014; Gupta et al., in press; Gupta, Thakur, & Kishore, 2014; Halder et al., 2013; Holder & Cook, 2009; Lahiri & Berger-Wolf, 2010; Obulesu et al., 2014; Rasheed et al., 2011) within evolving network domains. But much attention has not been given to the behavioral analysis of such patterns, i.e. the application and interpretation of the patterns for the said domains.

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024)
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022): 3 Released, 1 Forthcoming
Volume 11: 4 Issues (2021)
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing