A survey of data mining and social network analysis based anomaly detection techniques
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
With the increasing trend of online social networks in different domains, social network analysis has recently become the center of research. Online Social Networks (OSNs) have fetched the interest of researchers for their analysis of usage as well as detection of abnormal activities. Anomalous activities in social networks represent unusual and illegal activities exhibiting different behaviors than others present in the same structure. This paper discusses different types of anomalies and their novel categorization based on various characteristics. A review of number of techniques for preventing and detecting anomalies along with underlying assumptions and reasons for the presence of such anomalies is covered in this paper. The paper presents a review of number of data mining approaches used to detect anomalies. A special reference is made to the analysis of social network centric anomaly detection techniques which are broadly classified as behavior based, structure based and spectral based. Each one of this classification further incorporates number of techniques which are discussed in the paper. The paper has been concluded with different future directions and areas of research that could be addressed and worked upon.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Social network sites: definition, history, and scholarship
boyd, D. M., & Ellison, N. B. (2007) · Journal of Computer-Mediated Communication · doi:10.1111/j.1083-6101.2007.00393.x · Cited by 16,251
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
Procedures for Detecting Outlying Observations in Samples
Grubbs, F. E. (1969) · Technometrics · doi:10.1080/00401706.1969.10490657 · Cited by 4,105
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
Distance-based outliers: algorithms and applications
Knorr, E. M., Ng, R. T., & Tucakov, V. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050006 · Cited by 1,195
A Geometric Framework for Unsupervised Anomaly Detection: Detecting Intrusions in Unlabeled Data
Eskin, E., Arnold, A., Prerau, M., Portnoy, L., & Stolfo, S. (2002) · Advances in Information Security · doi:10.1007/978-1-4615-0953-0_4 · Cited by 683
It's who you know: graph mining using recursive structural features
Henderson, K., Gallagher, B., Li, L., Akoglu, L., Eliassi-Rad, T., Tong, H., & Faloutsos, C. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020512 · Cited by 223
Kisilevich, S., Mansmann, F., & Keim, D. (2010) · Proceedings of the 1st International Conference and Exhibition on Computing for Geospatial Research & Application · doi:10.1145/1823854.1823897 · Cited by 209
Detecting Clusters of Fake Accounts in Online Social Networks
Xiao, C., Freeman, D. M., & Hwa, T. (2015) · Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security · doi:10.1145/2808769.2808779 · Cited by 184
Cited by
Ransomware threat success factors, taxonomy, and countermeasures: A survey and research directions
Al-rimy, B. A. S., Maarof, M. A., & Shaid, S. Z. M. (2018) · Computers & Security · doi:10.1016/j.cose.2018.01.001 · Cited by 383
Detecting Fake Accounts on Social Media
Khaled, S., El-Tazi, N., & Mokhtar, H. M. O. (2018) · 2018 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata.2018.8621913 · Cited by 131
A survey on the development status and application prospects of knowledge graph in smart grids
Wang, J., Wang, X., Ma, C., & Kou, L. (2021) · IET Generation, Transmission & Distribution · doi:10.1049/gtd2.12040 · Cited by 111
Detection of malicious social bots: A survey and a refined taxonomy
Latah, M. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113383 · Cited by 94
Metadata
- Authors
- Kaur, R., & Singh, S.
- Venue
- Egyptian Informatics Journal
- Publisher
- Elsevier BV
- Published
- 2016-07
- Volume
- 17
- Issue
- 2
- Pages
- 199-216
- ISSN
- 1110-8665 (ISSN-L)
- OpenAlex
- W2212381007
- Cited by
- 118
- References
- 14
- FWCI
- 10.01
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.