Online social networks can be modelled as graphs; in this paper, we analyze the use of graph metrics for identifying users with anomalous relationships to other users. A framework is proposed for analyzing the effectiveness of various graph theoretic properties such as the number of neighbouring nodes and edges, betweenness centrality, and community cohesiveness in detecting anomalous users. Experimental results on real-world data collected from online social networks show that the majority of users typically have friends who are friends themselves, whereas anomalous users' graphs typically do not follow this common rule. Empirical analysis also shows that the relationship between average betweenness centrality and edges identifies anomalies more accurately than other approaches. © 2012 Springer-Verlag.
CITATION STYLE
Hassanzadeh, R., Nayak, R., & Stebila, D. (2012). Analyzing the effectiveness of graph metrics for anomaly detection in online social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7651 LNCS, pp. 624–630). https://doi.org/10.1007/978-3-642-35063-4_45
Mendeley helps you to discover research relevant for your work.