2014
DOI: 10.21236/ada613504
|View full text |Cite
|
Sign up to set email alerts
|

Data Stream Mining Based Dynamic Link Anomaly Analysis Using Paired Sliding Time Window Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…In theory, there are two types of link anomalies, that is, Type-I (missing connections that should have appeared) and Type-II (established connections that should not occur). In order to detect both Type-I and Type-II link anomalies, we utilize several similarity metrics [30] such as Jaccard's Coefficient and Katz Index. Let G = (V; E) be the graph that represents the topological structure of a general connected network.…”
Section: Link Anomaly Graphmentioning
confidence: 99%
“…In theory, there are two types of link anomalies, that is, Type-I (missing connections that should have appeared) and Type-II (established connections that should not occur). In order to detect both Type-I and Type-II link anomalies, we utilize several similarity metrics [30] such as Jaccard's Coefficient and Katz Index. Let G = (V; E) be the graph that represents the topological structure of a general connected network.…”
Section: Link Anomaly Graphmentioning
confidence: 99%