2021
DOI: 10.1007/s10115-021-01543-x
|View full text |Cite
|
Sign up to set email alerts
|

Tracking triadic cardinality distributions for burst detection in high-speed graph streams

Abstract: In everyday life, we often observe unusually frequent interactions among people before or during important events, e.g., people send/receive more greetings to/from their friends on holidays than regular days. We also observe that some videos or hashtags suddenly go viral through people's sharing on online social networks (OSNs). Do these seemingly different phenomena share a common structure? All these phenomena are associated with sudden surges of user interactions in networks, which we call "bursts" in this … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 62 publications
0
1
0
Order By: Relevance
“…The authors in [15] used unsupervised learning to identify graph features related to suspicious activity patterns for bot detection. The work in [16], [17] studied extracting graph features like vertex degree and triangle count to detect spam accounts.…”
Section: Related Workmentioning
confidence: 99%
“…The authors in [15] used unsupervised learning to identify graph features related to suspicious activity patterns for bot detection. The work in [16], [17] studied extracting graph features like vertex degree and triangle count to detect spam accounts.…”
Section: Related Workmentioning
confidence: 99%