Intrusion detection (ID) is the task of analysis the event occurring on a network system in order to detect abnormal activity. Intrusion Detection System has increased due to its more constructive working than traditional security mechanisms. As the network data is dynamic in nature, it leads to the problem of incremental learning of dynamic data. Now, combining classifiers is a new method for the improving classifiers robustness and accuracy. Most of ensemble methods operates in batch mode. For this purpose, proposed system incremental combining classifiers that combines three classifiers that operates incrementally on dynamic data, Naïve Bayes, K-star, Non Nested Generalised Exemplars classifiers based on voting approach. In incremental learning process, numbers of hypotheses are generated during classification; an ensemble decision method is required to aggregate all the votes from multiple hypotheses for the final decision process which produces better accuracy in most of the cases in experiments.

1. Zhang, Y., Lee, W. 2000. “Intrusion Detection in wireless ad-hoc networks”, In Proceedings of the 6th annual international conference on Mobile Computing and networking, ACM , 275-283.
2. Calinon, S., Billard, A. 2007. “Incremental Learning of gestures by imitation in a humanoid robot”, In Proceedings of the ACM/IEEE international conference on human-robot interception, 255-263.
3. R. Elwell and R. Polikar. 2011. “Incremental learning of concept drift in nonstationary environments”, In IEEE Trans. Neural Netw., vol. 22, no. 10, 1517-1531.
4. Wang, H., Fan, W., Yu, P. S., Han, J. 2003. “Mining concept-drifting data streams using ensemble classifiers”, In Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining. ACM. 226-235.
5. Kittler, M. Hatel, R. P. W. Duin, and J. Matas. 1998. “On combining classifiers”, in IEEE Trans. Pattern Anal. Mach. Intell., vol. 20, no. 3, 226-239.
6. Hulten, G., Spencer, L., Domingos, P. 2001. “Mining time-changing data streams”, In Proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining. ACM. (August, 2001), 97-106.
7. Haibo He, Sheng Chen, Kang Li And Xin Xu. 2011. “Incremental Learning From Strem Data”, In IEEE Transaction On Neural Networks, vol. 22 No. 12., (December, 2011).
8. Syed, N. A., Sung, K. K. 1999. “Handling Concept drift Incremental Learning with support vector machine”, In Proceedings of the 5th ACM SIGKDD international conference on knowledge discovery and data mining. ACM. (August, 1999), 317-321.
9. Street, W. N., Kim, Y. 2001. “A streaming ensemble algorithm (SEA) for large-scale classification”, In Proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining. ACM. (August, 2001), 377-382
10. Ade, R., & Deshmukh, P. “Efficient Knowledge Transformation for Incremental Learning and Detection of New Concept Class in Students Classification System”, In Information Systems Design and Intelligent Applications. Springer India. 757-766.
11. Ade, Roshani, and P. R. Deshmukh. “An incremental ensemble of classifiers as a technique for prediction of student's career choice”, ICNSC.
12. M. D. Muhlbaier, A. Topalis, and R. Polikar.. “Learn ++.NC: Combining ensemble of classifiers with dynamically weighted consult-and-vote for efficient incremental learning of new classes”, In IEEE Trans. Neural Netw., vol. 20, no. 1, , (Jan., 2009). 152-168.
13. Janssens D, Brijs T, Vanhoof K,Wets G. “Evaluating the performance of cost-based discretization versus entropy- and error-based discretization”, Comput Oper Res 33(11), 3107–3123
14. N. Littlestone and M.Warmuth. “Weighted majority algorithm”, Information and Computation, vol. 108, 212-261.
15. NSL-KDD dataset for network-based intrusion detection systems available on http://iscx.info/NSL-KDD/

Security Algorithms