Designing of on line intrusion detection system using rough set theory and Q-learning algorithm

Neurocomputing

Volumn 111, Issue , 2013, Pages 161-168

  Sengupta, Nandita ^a   Sen, Jaydeep ^b   Sil, Jaya ^c   Saha, Moumita ^d  

^a UNIVERSITY COLLEGE OF BAHRAIN   (Bahrain)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^c INDIAN INSTITUTE OF ENGINEERING SCIENCE AND TECHNOLOGY   (India)

^d INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Discretization; Intrusion detection system; Q learning algorithm; Rough set theory

Indexed keywords

ATTRIBUTE VALUES; CLASSIFICATION ACCURACY; DISCRETIZATIONS; INDISCERNIBILITY; INTRUSION DETECTION SYSTEMS; MACHINE LEARNING APPROACHES; Q-LEARNING ALGORITHMS; ROUGH SET THEORY (RST);

COMPUTER CRIME; ROUGH SET THEORY; WEBSITES;

LEARNING ALGORITHMS;

ALGORITHM; ARTICLE; CLASSIFICATION; CLASSIFIER; COMPUTER NETWORK; CONTROLLED STUDY; DATA PROCESSING; INTRUSION DETECTION SYSTEM; MACHINE LEARNING; PRIORITY JOURNAL; Q LEARNING ALGORITHM; REDUCT; ROUGH SET THEORY; THEORY;

EID: 84876731442     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2012.12.023     Document Type: Article

References (29)

1. S. Zanero, G. Serazzi, Unsupervised learning algorithms for intrusion detection, in: Network Operations and Management Symposium, 2008, NOMS 2008, IEEE.
2. Dasgupta D., Gonzalez F. An immunity-based technique to characterize intrusions in computer networks. IEEE Trans. Evol. Comput. 2002, 6:1081-1088.
3. M. Mahoney, P. Chan, Learning rules for anomaly detection of hostile network traffic, in: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM-2003), Melbourne, FL, IEEE Computer Society, 2003, pp. 601-604.
4. Gaddam Shekhar R., Phoha Vir V., Balagani Kiran S. KMeans+ID3. a novel method for supervised anomaly detection by cascading K-means clustering and ID3 decision tree learning methods. IEEE Trans. Knowl. Data Eng. 2007, 19(March (3)):345-354.
5. W. Fangfei, J. Qingshan, S. Liang, W. Nannan, An intrusion detection system based on the clustering ensemble, in: IEEE International Workshop on 16-18 April 2007, p. 12.
6. Mark L.J., Michael K., Yiu-ming C., Huang J.Z. Agglomerative fuzzy K-means clustering algorithm with selection of number of clusters. IEEE Trans. Knowl. Data Eng. 2008, 20(November (11)):1519-1534.
7. C. Zhang, S. Xia, K-means Clustering algorithm with improved initial center, in: Second International Workshop on Knowledge Discovery and Data Mining, 2009 IEEE, pp. 790-793.
8. M. Jianliang, S. Haikun, B. Ling, The application on intrusion detection based on K-means cluster algorithm, in: International Forum on Information Technology and Application, IEEE, 15-17 May 2009, pp. 150-152.
9. Xu X. Adaptive intrusion detection based on machine learning. feature extraction, classifier construction and sequential pattern prediction. Int. J. Web Serv. Pract. 2006, 2(1-2):49-58.
10. A.L. Strehl, L. Li, E. Wiewiora, J. Langford, M.L. Littman, PAC model-free reinforcement learning, in: ICML '06 Proceedings of the 23rd International Conference on Machine Learning.
11. J. Asmuth, M.L. Littman, R. Zinkov, Potential-based shaping in model-based reinforcement learning, in: Proceedings of the 23rd AAAI Conference on Artificial Intelligence, AAAI Press, 2008, pp. 604-609.
12. J. Asmuth, L. Li, M.L. Littman, A. Nouri, D. Wingate, A Bayesian sampling approach to exploration in reinforcement learning, in: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, 2009.
13. Auer P., Jaksch T., Ortner R. Near-optimal regret bounds for reinforcement learning. Adv. Neural Inf. Process. Syst. 2009, 21:89-96.
14. E. Brunskill, B.R. Leffler, L. Li, M.L. Littman, N. Roy, CORL: a continuous-state offset-dynamics reinforcement learner, in: Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, 2008, pp. 53-61.
15. Even-Dar E., Mansour Y. Learning rates for Q-learning. J. Mach. Learn. Res. 2003, 5:1-25.
16. S.M. Kakade, On the sample complexity of reinforcement learning, Ph.D. Thesis, Gatsby Computational Neuroscience Unit, University College London, 2003.
17. B.R. Leffler, M.L. Littman, T. Edmunds, Efficient reinforcement learning with relocatable action models, in: Proceedings of the 22nd Conference on Artificial Intelligence, 2007, pp. 572-577.
18. Manju S., Punithavalli M. An analysis of Q-learning algorithms with strategies of reward function. Int. J. Comput. Sci. Eng. (IJCSE) 2011, 3(2).
19. T. Kohri, K. Matsubayashi, M. Tokoro, An adaptive architecture for modular Q-learning, in: IJCAI'97 Proceedings of the 15th International Joint Conference on Artifical Intelligence, vol. 2.
20. A. Servin, D. Kudenko, Multi-agent reinforcement learning for intrusion detection, in: MATES '08 Proceedings of the 6th German Conference on Multiagent System Technologies, Springer-Verlag Berlin, Heidelberg, 2008.
21. L. Panait, S. Luke, Cooperative Multi-Agent Learning: The State of the Art, Autonomous Agents and Multi-Agent Systems, vol. 11(3), Springer, 2005, pp. 387-434.
22. Chou T.S., Yen K.K., Luo J. Network intrusion detection design using feature selection of soft computing paradigms. Int. J. Computat. Intell. 2008, 4(3):196-208.
23. M. Dash, H. Liu, Consistency-based Search in Feature Selection, vol. 151(1-2), Elsevier, December 2003, pp. 155-176.
24. Das A.K., Sil J. An efficient classifier design integrating rough set and set oriented database operations. Appl. Soft Comput. J. 2011, 11:2279-2285. Elsevier, Science Direct.
25. Swiniarski R.W. Rough sets methods in feature reduction and classification. Int. J. Appl. Math. Comput. Sci. 2001, 11(3):565-582.
26. Huang Y., Huang X., Cercone N. Feature selection with rough sets for web page classification. Transactions on Rough Sets 2004, vol. 2. SpringerLink Publishers, pp. 1-13.
27. Siedlecki W., Sklansky J. An automatic feature selection. Int. J. Pattern Recognition Artif. Intell. 1988, 2(2):197-220.
28. Skowron A., Rauszer C. The discernibility matrices and functions in information systems. Intelligent Decision Support-Handbook of Applications and Advances of the Rough Sets Theory 1991, 331-362. X. Slowinski (Ed.).
29. http://www.iscx.ca/NSL-KDD/.