The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Clustering Approach Based on Mini Batch Kmeans for Intrusion Detection System Over Big Data
Open accessAbstract
Intrusion detection system (IDS) provides an important basis for the network defense. Due to the development of the cloud computing and social network, massive amounts of data are generated, which inevitably brings much pressure to IDS. And therefore, it becomes crucial to efficiently divide the data into different classes over big data according to data features. Moreover, we can further determine whether one is normal behavior or not based on the classes information. Although the clustering approach based on K-means for IDS has been well studied, unfortunately directly using it in big data environment may suffer from inappropriateness. On the one hand, the efficiency of data clustering needs to be improved. On the other hand, differ from the classification, there is no unified evaluation indicator for clustering issue, and thus, it is necessary to study which indicator is more suitable for evaluating the clustering results of IDS. In this paper, we propose a clustering method for IDS based on Mini Batch K-means combined with principal component analysis. First, a preprocessing method is proposed to digitize the strings and then the data set is normalized so as to improve the clustering efficiency. Second, the principal component analysis method is used to reduce the dimension of the processed data set aiming to further improve the clustering efficiency, and then mini batch K-means method is used for data clustering. More specifically, we use K-means++ to initialize the centers of cluster in order to avoid the algorithm getting into the local optimum, in addition, we choose the Calsski Harabasz indicator so that the clustering result is more easily determined. Compared with the other methods, the experimental results and the time complexity analysis show that our proposed method is effective and efficient. Above all, our proposed clustering method can be used for IDS over big data environment.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1996) · Cited by 20,179
A dendrite method for cluster analysis
Caliński, T., & Harabasz, J. (1974) · Communications in Statistics · doi:10.1080/03610927408827101 · Cited by 4,480
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
Denning, D. E. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.232894 · Cited by 3,427
Wu, X., Zhu, X., Wu, G.-Q., & Ding, W. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.109 · Cited by 2,410
A simple and fast algorithm for K-medoids clustering
Park, H.-S., & Jun, C.-H. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.01.039 · Cited by 2,104
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
Mixtures of Probabilistic Principal Component Analyzers
Tipping, M. E., & Bishop, C. M. (1999) · Neural Computation · doi:10.1162/089976699300016728 · Cited by 1,873
Computer security threat monitoring and surveillance
Anderson, J. (1980) · Medical Entomology and Zoology · Cited by 1,342
Big data deep learning: Challenges and perspectives
Chen, X.-W., & Lin, X. (2014) · IEEE Access · doi:10.1109/access.2014.2325029 · Cited by 1,255
An efficient approach to clustering in large multimedia databases with noise
Hinneburg, A., & Keim, D. A. (1998) · KOPS (University of Konstanz) · Cited by 1,181
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
Sculley, D. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772862 · Cited by 1,147
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Sheikholeslami, G., Chatterjee, S., & Zhang, A. (1998) · Cited by 756
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276312 · Cited by 669
Convergence Properties of the K-Means Algorithms
Bottou, L., & Bengio, Y. (1994) · Cited by 398
A randomized algorithm for the decomposition of matrices
Martinsson, P.-G., Rokhlin, V., & Tygert, M. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.003 · Cited by 352
How slow is the k -means method?
Arthur, D., & Vassilvitskii, S. (2006) · Proceedings of the twenty-second annual symposium on Computational geometry · doi:10.1145/1137856.1137880 · Cited by 304
Network Anomaly Detection by Cascading K-Means Clustering and C4.5 Decision Tree algorithm
Muniyandi, A. P., Rajeswari, R., & Rajaram, R. (2012) · Procedia Engineering · doi:10.1016/j.proeng.2012.01.849 · Cited by 251
CCPA: Coordinated Cyber-Physical Attacks and Countermeasures in Smart Grid
Deng, R., Zhuang, P., & Liang, H. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2702125 · Cited by 218
Evaluating Computer Intrusion Detection Systems: A Survey of Common Practices
Milenkoski, A., Vieira, M., Kounev, S., Avritzer, A., & Payne, B. D. (2015) · ACM Computing Surveys · doi:10.1145/2808691 · Cited by 194
A Survey on Mobile Data Offloading Technologies
Zhou, H., Wang, H., Li, X., & Leung, V. C. M. (2018) · IEEE Access · doi:10.1109/access.2018.2799546 · Cited by 171
Self-citationProcess Mining Based on Clustering: A Quest for Precision
de Medeiros, A. K. A., Guzzo, A., Greco, G., van der Aalst, W. M. P., Weijters, T., van Dongen, B. F., & Saccà, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78238-4_4 · Cited by 125
Predicting Temporal Social Contact Patterns for Data Forwarding in Opportunistic Mobile Networks
Zhou, H., Leung, V. C. M., Zhu, C., Xu, S., & Fan, J. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2740218 · Cited by 108
Self-citationStructural Balance Theory-Based E-Commerce Recommendation over Big Rating Data
Qi, L., Xu, X., Zhang, X., Dou, W., Hu, C., Zhou, Y., & Yu, J. (2016) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2016.2602849 · Cited by 76
Madan, S. K., & Dana, K. (2015) · Pattern Analysis and Applications · doi:10.1007/s10044-015-0472-4 · Cited by 44
Data Placement for Privacy-Aware Applications over Big Data in Hybrid Clouds
Xu, X., Zhao, X., Ruan, F., Zhang, J., Tian, W., Dou, W., & Liu, A. X. (2017) · Security and Communication Networks · doi:10.1155/2017/2376484 · Cited by 40
Comparative Study of Apache Spark MLlib Clustering Algorithms
Harifi, S., Byagowi, E., & Khalilian, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-61845-6_7 · Cited by 21
Cited by
Machine Learning and Deep Learning Methods for Intrusion Detection Systems: A Survey
Liu, H., & Lang, B. (2019) · Applied Sciences · doi:10.3390/app9204396 · Cited by 1,133
Network Intrusion Detection Combined Hybrid Sampling With Deep Hierarchical Network
Jiang, K., Wang, W., Wang, A., & Wu, H. (2020) · IEEE Access · doi:10.1109/access.2020.2973730 · Cited by 446
Clustering-Based Speech Emotion Recognition by Incorporating Learned Features and Deep BiLSTM
Mustaqeem, Sajjad, M., & Kwon, S. (2020) · IEEE Access · doi:10.1109/access.2020.2990405 · Cited by 402
A systematic literature review of methods and datasets for anomaly-based network intrusion detection
Yang, Z., Liu, X., Li, T., Wu, D., Wang, J., Zhao, Y., & Han, H. (2022) · Computers & Security · doi:10.1016/j.cose.2022.102675 · Cited by 355
Metadata
- Authors
- Peng, K., Leung, V. C. M., & Huang, Q.
- Venue
- IEEE Access
- Published
- 2018
- Volume
- 6
- Pages
- 11897-11906
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2790117078
- Cited by
- 268
- References
- 29
- FWCI
- 17.43
- 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.