Development of Rough Set – Hypergraph Technique for Key Feature Identification in Intrusion Detection Systems

Computers and Electrical Engineering

Volumn 59, Issue , 2017, Pages 189-200

  Gauthama Raman, M R ^a   Kirthivasan, Kannan ^a   Shankar Sriram, V S ^a  

^a SASTRA UNIVERSITY   (India)

Author keywords

Hypergraph; Intrusion Detection System (IDS); Minimal transversal property; Optimal feature subset; Rough Set Theory (RST); Vertex linearity property

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTER CRIME; FEATURE EXTRACTION; GRAPH THEORY; INTELLIGENT SYSTEMS; INTRUSION DETECTION; MERCURY (METAL); NETWORK SECURITY;

FEATURE SUBSET; HYPERGRAPH; INTRUSION DETECTION SYSTEMS; MINIMAL TRANSVERSAL PROPERTY; ROUGH SET THEORY (RST); VERTEX LINEARITY PROPERTY;

ROUGH SET THEORY;

EID: 85012897941     PISSN: 00457906     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compeleceng.2017.01.006     Document Type: Article

References (30)

1. [1] Tsai, C-F., Hsu, Y-F., Lin, C-Y., Lin, W-Y., Intrusion detection by machine learning: a review. Expert Syst Appl 36 (2009), 11994–12000, 10.1016/j.eswa.2009.05.029.
2. [2] Chung, Y.Y., Wahid, N., A hybrid network intrusion detection system using simplified swarm optimization (SSO). Appl Soft Comput 12 (2012), 3014–3022, 10.1016/j.asoc.2012.04.020.
3. [3] Scarfone, K., Mell, P., Guide to intrusion detection and prevention systems (idps). NIST Spec Publ, 800, 2007, 94.
4. [4] Liao, H-J., Richard Lin, C-H., Lin, Y-C., Tung, K-Y., Intrusion detection system: a comprehensive review. J Netw Comput Appl 36 (2013), 16–24, 10.1016/j.jnca.2012.09.004.
5. [5] Chandrashekar, G., Sahin, F., A survey on feature selection methods. Comput Electr Eng 40 (2014), 16–28, 10.1016/j.compeleceng.2013.11.024.
6. [6] Jiang, F., Sui, Y., Zhou, L., A relative decision entropy-based feature selection approach. Pattern Recognit 48:7 (2015), 2151–2163.
7. [7] Wroblewski, J., Finding minimal reducts using genetic algorithms. Proccedings of the second annual join conference on information science, 1995, 186–189 Sep 28 n.d.
8. [8] Jensen R., Jensen R., Shen Q. Finding Rough Set reducts with ant colony optimization. Proc 2003 UK Work Comput Intell 2003:15–22.
9. [9] Sengupta, N., Sen, J., Sil, J., Saha, M., Designing of online intrusion detection system using rough set theory and Q-learning algorithm. Neurocomputing 111 (2013), 161–168, 10.1016/j.neucom.2012.12.023.
10. [10] Jensen, R., Shen, Q., Fuzzy-Rough Sets assisted attribute selection. IEEE Trans Fuzzy Syst 15:1 (2007), 73–89.
11. [11] Hu, X., Cercone, N., Han, J., An attribute-oriented rough set approach for knowledge discovery in databases. Rough sets, fuzzy sets and knowledge discovery, 1994, Springer, London, 90–99.
12. [12] Hu, K., Lu, Y., Shi, C., Feature ranking in rough sets. AI Commun 16:1 (2003), 41–50.
13. [13] Mac Parthaláin, N., Shen, Q., Exploring the boundary region of tolerance rough sets for feature selection. Pattern Recognit 42:5 (2009), 655–667.
14. [14] Ślezak, D., Approximate entropy reducts. Fundam Informaticae 53:3-4 (2002), 365–390.
15. [15] Science J. of C, 2006 undefined. A quick attribute reduction algorithm with complexity of max (O (| C || U |), O (| C | 2 | U / C |. Test.scholarmate.com n.d.
16. [16] Wang, X., Yang, J., Teng, X., Xia, W., Jensen, R., Feature selection based on rough sets and particle swarm optimization. Pattern Recognit Lett 28:4 (2007), 459–471.
17. [17] Pawlak, Z., Rough Sets. Int J Comput Inf 11:5 (1982), 341–356.
18. [18] Pawlak, Z, Grzymala-Busse, J, Slowinski, R, Ziarko, W, Rough Sets. Communications of the ACM 38:11 (1995), 88–95.
19. [19] Abraham A., FALC R., Bello R. Rough Set Theory: a true landmark in data analysis. 2009.
20. [20] Berge C., Minieka E. Graphs, and hypergraphs. 1973.
21. [21] Raman, M.G., Kannan, K., Pal, S.K., Sriram, V.S., Rough Set-Hypergraph-based feature selection approach for intrusion detection systems. Def Sci 66:6 (2016), 612–617.
22. [22] Somu, N., Raman, M.R.G., Kirthivasan, K., Sriram, V.S.S., Hypergraph-based feature selection technique for medical diagnosis. J Med Syst, 40, 2016, 239, 10.1007/s10916-016-0600-8.
23. [23] Somu, N., Kirthivasan, K., SS, V.S., A computational model for ranking cloud service providers using hypergraph-based techniques. Futur Gener Comput Syst 68 (2017), 14–30, 10.1016/j.future.2016.08.014.
24. [24] Kannan, K., Kanna, B.R., Aravindan, C., Root mean square filter for noisy images based on hypergraph model. Image Vis Comput 28 (2010), 1329–1338, 10.1016/j.imavis.2010.01.013.
25. [25] Kavvadias, D.J., Stavropoulos, E.C., An efficient algorithm for the transversal hypergraph generation. J Graph Algorithms Appl 9:2 (2005), 239–264.
26. [26] Eiter, T., Gottlob, G., Identifying the minimal transversals of a hypergraph and related problems. SIAM J Comput 24:6 (1995), 1278–1304.
27. [27] Inbarani, H.H., Azar, A.T., Jothi, G., Supervised hybrid feature selection based on PSO and rough sets for medical diagnosis. Comput Methods Programs Biomed 113 (2014), 175–185, 10.1016/j.cmpb.2013.10.007.
28. [28] KDD Cup 99 Dataset, Available online at: 〈http://kdd.ics.uci.edu/databases/ kddcup99/kddcup99.html〉, 1999 n.d.
29. [29] Witten, IH, Frank, E, Hall, MA, Pal, CJ, Data Mining: Practical machine learning tools and techniques. 2016, Morgan Kaufmann.
30. [30] Wang, G., Yu, H., Yang, D., Decision table reduction based on conditional information entropy. Chinese J Comput, 2002.