2007
DOI: 10.21914/anziamj.v48i0.62
|View full text |Cite
|
Sign up to set email alerts
|

Detecting changes in time series of network graphs using minimum mean squared error and cumulative summation

Abstract: Through characterising a computer network as a time series of graphs, with ip addresses on the vertices and edges weighted by the number of packets transmitted, we apply graph distance metrics to arrive at a measure of the distance between the network at different times. Two computationally simple methods of detecting change points in a one dimensional time series of this distance data are proposed. These techniques are cumulative summation and minimum mean squared error. This offers a very space efficient met… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 19 publications
0
11
0
Order By: Relevance
“…There are many models can be used to build time series models for dynamic networks, such as autoregressive models, Bayesian models, and Exponential‐family Random Graph Models (ERGM) . We use the autoregressive model as a representative for illustration.…”
Section: Learning Methodologiesmentioning
confidence: 99%
See 1 more Smart Citation
“…There are many models can be used to build time series models for dynamic networks, such as autoregressive models, Bayesian models, and Exponential‐family Random Graph Models (ERGM) . We use the autoregressive model as a representative for illustration.…”
Section: Learning Methodologiesmentioning
confidence: 99%
“…We use the autoregressive model as a representative for illustration. In Pincombe's project, the author proposed to use an AR moving‐average (ARMA) model, a variant of the AR model, to detect anomalies on dynamic communication networks. In this study, each observation on a graph topology, such as weight and diameter, is used to construct a single time series.…”
Section: Learning Methodologiesmentioning
confidence: 99%
“… X = the number of bootstraps for which d b < d , where d is the difference between the maximum and minimum value of the original series, and d b is the difference between the maximum and minimum values generated by the bootstrap CUSUM samples (Taylor 2002; Pincombe 2007). N = the number of bootstraps.…”
Section: Methodsmentioning
confidence: 99%
“…This GDD metric can be used to compare two structural brain networks, a structural brain network with every time-instant temporal network and, at the same time, as a proper metric for comparing two sets of brain networks via J index. (c) Spectral K distance (Pincombe, 2007), (d) Laplacian energy (Gutman and Zhou, 2006). This set of four spectral distance metrics implemented in our module can be used in conjunction with the J index.…”
Section: Graph-diffusion Distancementioning
confidence: 99%