2008 IEEE 24th International Conference on Data Engineering 2008
DOI: 10.1109/icde.2008.4497457
|View full text |Cite
|
Sign up to set email alerts
|

Mining (Social) Network Graphs to Detect Random Link Attacks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
46
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 71 publications
(46 citation statements)
references
References 18 publications
0
46
0
Order By: Relevance
“…"Mining (Social) Network Graphs to Detect Random Link Attacks (RLA)" by Nisheeth Shrivastava et al [13] analyses the static social network graph to detect RLA to find spammers by profiling properties of whom they send the messages to, instead of what they are sending. In an RLA, a group of malicious users attack a large, randomly selected set of victims and incorporates a large number of existing attacks (like email spams, telemarketing calls, etc.…”
Section: Related Workmentioning
confidence: 99%
“…"Mining (Social) Network Graphs to Detect Random Link Attacks (RLA)" by Nisheeth Shrivastava et al [13] analyses the static social network graph to detect RLA to find spammers by profiling properties of whom they send the messages to, instead of what they are sending. In an RLA, a group of malicious users attack a large, randomly selected set of victims and incorporates a large number of existing attacks (like email spams, telemarketing calls, etc.…”
Section: Related Workmentioning
confidence: 99%
“…Shrivastava [13] proposed an algorithm that can identify fake nodes based on the neighborhood graph difference between normal nodes and fake nodes.…”
Section: Related Workmentioning
confidence: 99%
“…The attack that only uses certain background knowledge and doesn't "actively" change the graph is called passive attack, and the one "actively" changes the graph when social networks are collecting data is called active attack. Most current works can be categorized into two classes: to prevent passive attack [8,6,4,16,3,15,17] and to prevent active attack [13].…”
Section: Related Workmentioning
confidence: 99%
“…Graph Mining: There exists lots of "graph mining" algorithms: subgraph discovery(e.g., [12], [13], gPrune [14], gApprox [15], gSpan [16], Subdue [17], ADI [18], CSV [19]), computing communities (eg., [20], DENGRAPH [21], METIS [22]), attack detection [23], with too many alternatives for each of the above tasks. They are not directly related to the focus of this paper which is the static and dynamic structures of real networks.…”
Section: Related Workmentioning
confidence: 99%