Abstract
With the development of big data, mobile cloud computing, cyber security issues have become more and more critical. Thus, enabling an intrusion detection method over big data in mobile cloud environment is of paramount importance. In our previous research, we proposed an approach named Mini Batch Kmeans with Principal Component Analysis (PMBKM) for big data which can effectively solve the clustering problem for intrusion detection of big data, but it needs to preset the number of clusters. The best clustering number is selected by comparing the clustering results of different clustering values multiple times. To address the above issue, we propose a new clustering method named Balanced Iterative Reducing and Clustering Using Hierarchies with Principal Component Analysis (PBirch) in this paper. Compared to PMBKM, the experimental results show that PBirch can obtain a good clustering result without presetting clustering values, and the clustering result can be further improved by optimizing the relevant parameters. The clustering time of PBirch decreases linearly with the increasing of the cluster numbers. Thus, the larger the number of clusters, the smaller the PBirch time cost. All in all, our proposed method can be widely used for big data in mobile cloud environment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anderson, J.P.: Computer security threat monitoring and surveillance. Technical Report, vol. 17. James P. Anderson Company, Pennsylvania (1980)
Denning, D.E.: An intrusion-detection model. IEEE Trans. Softw. Eng. 2, 222–232 (1987)
Milenkoski, A., Vieira, M., Kounev, S., Avritzer, A., Payne, B.D.: Evaluating computer intrusion detection systems: a survey of common practices. ACM Comput. Surv. (CSUR) 48(1), 1–41 (2015)
Wang, T., et al.: Fog-based storage technology to fight with cyber threat. Future Gener. Comput. Syst. 83, 208–218 (2018)
Peng, K., Lin, R.H., Huang, B.B., Zou, H., Yang, F.C.: Link importance evaluation of data center network based on maximum flow. J. Internet Technol. 18(1), 23–31 (2017)
Wang, T., et al.: Data collection from WSNs to the cloud based on mobile fog elements. Future Gener. Comput. Syst. (2017). https://doi.org/10.1016/j.future.2017.07.031
Wang, T., Zhang, G.X., Bhuiyan, M.Z.A., Liu, A.F., Jia, W., Xie, M.: A novel trust mechanism based on fog computing in sensor-cloud system. Future Gener. Comput. Syst. (2018). https://doi.org/10.1016/j.future.2018.05.049
Wu, X., Zhu, X., Wu, G.Q., Ding, W.: Data mining with big data. IEEE Trans. Knowl. Data Eng. 26(1), 97–107 (2014)
Wang, T., Bhuiyan, M.Z.A., Wang, G.J., Rahman, A., Wu, J., Cao, J.N.: Big data reduction for smart city’s critical infrastructural health monitoring. IEEE Commun. Mag. 56(3), 128–133 (2018)
Lee, W., Stolfo, S.J.: Data mining approaches for intrusion detection. In: 7th USENIX. USENIX Security Symposium, pp. 79–93 (1998)
Peng, K., Leung, V.C.M., Huang, Q.J.: Clustering approach based on mini batch Kmeans for intrusion detection system over big data. IEEE Access 6, 11897–11906 (2018)
Peng, K., Leung, V.C.M., Zheng, L.X., Wang, S.G., Huang, C., Lin, T.: Intrusion detection system based on decision tree over big data in fog environment. Wirel. Commun. Mob. Comput. (2018). https://doi.org/10.1155/2018/4680867
Halko, N., Martinsson, P.G., Tropp, J.A.: Finding Structure with Randomness: Stochastic Algorithms for Constructing Approximate Matrix Decompositions. http://resolver.caltech.edu/CaltechAUTHORS:20111012-111324407
Tipping, M.E., Bishop, C.M.: Mixtures of probabilistic principal component analyzers. Neural Comput. 11(2), 443–482 (1999)
Martinsson, P.G., Rokhlin, V., Tygert, M.: A randomized algorithm for the decomposition of matrices. Appl. Comput. Harmonic Anal. 30(1), 47–68 (2011)
Zhang, T., Ramakrishnan, R., Livny, M.: An efficient data clustering method for very large databases. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (SIGMOD 1996), pp. 103–114. ACM, New York (1996)
Calinski, T., Harabasz, J.: A dendrite method for cluster analysis. Commun. Stat.-Theory Methods 3(1), 1–27 (1974)
KDDCUP99. http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.html
Scikit-learn. http://scikit-learn.org/stable/index.html
Acknowledgments
This work is supported by The Natural Science Foundation of Fujian Province (Grant No. 2018J05106), Quanzhou Science and Technology Project (No. 2015Z115), the Scientific Research Foundation of Huaqiao University (No. 14BS316). The Education Scientific Research Project for Middle-age and Young Teachers of Fujian Province (JZ160084). China Scholarship Council awards to Kai Peng for one year’s research abroad at The University of British Columbia, Vancouver, Canada. The authors also wants to thank Jianping Liu, Zhiqiang Xu and etc. for sharing a lot of valuable information on his blog.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Peng, K., Zheng, L., Xu, X., Lin, T., Leung, V.C.M. (2018). Balanced Iterative Reducing and Clustering Using Hierarchies with Principal Component Analysis (PBirch) for Intrusion Detection over Big Data in Mobile Cloud Environment. In: Wang, G., Chen, J., Yang, L. (eds) Security, Privacy, and Anonymity in Computation, Communication, and Storage. SpaCCS 2018. Lecture Notes in Computer Science(), vol 11342. Springer, Cham. https://doi.org/10.1007/978-3-030-05345-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-05345-1_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05344-4
Online ISBN: 978-3-030-05345-1
eBook Packages: Computer ScienceComputer Science (R0)