期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
An Intrusion Detection System for SDN Using Machine Learning
1
作者 G.Logeswari S.Bose t.anitha 《Intelligent Automation & Soft Computing》 SCIE 2023年第1期867-880,共14页
Software Defined Networking(SDN)has emerged as a promising and exciting option for the future growth of the internet.SDN has increased the flexibility and transparency of the managed,centralized,and controlled network... Software Defined Networking(SDN)has emerged as a promising and exciting option for the future growth of the internet.SDN has increased the flexibility and transparency of the managed,centralized,and controlled network.On the other hand,these advantages create a more vulnerable environment with substantial risks,culminating in network difficulties,system paralysis,online banking frauds,and robberies.These issues have a significant detrimental impact on organizations,enterprises,and even economies.Accuracy,high performance,and real-time systems are necessary to achieve this goal.Using a SDN to extend intelligent machine learning methodologies in an Intrusion Detection System(IDS)has stimulated the interest of numerous research investigators over the last decade.In this paper,a novel HFS-LGBM IDS is proposed for SDN.First,the Hybrid Feature Selection algorithm consisting of two phases is applied to reduce the data dimension and to obtain an optimal feature subset.In thefirst phase,the Correlation based Feature Selection(CFS)algorithm is used to obtain the feature subset.The optimal feature set is obtained by applying the Random Forest Recursive Feature Elimination(RF-RFE)in the second phase.A LightGBM algorithm is then used to detect and classify different types of attacks.The experimental results based on NSL-KDD dataset show that the proposed system produces outstanding results compared to the existing methods in terms of accuracy,precision,recall and f-measure. 展开更多
关键词 Intrusion detection system light gradient boosting machine correlation based feature selection random forest recursive feature elimination software defined networks
在线阅读 下载PDF
Adjacency Spectrum of Reduced Power Graphs of Finite Groups
2
作者 R.Rajkumar t.anitha 《Algebra Colloquium》 SCIE CSCD 2024年第4期661-674,共14页
The reduced power graph of a group G,denoted by RP(G),is the graph whose vertex set is the set of all elements of G and two vertices u and u are adjacent in RP(G)if and only if(u)C(u)or(u)C(u).In this paper,we study t... The reduced power graph of a group G,denoted by RP(G),is the graph whose vertex set is the set of all elements of G and two vertices u and u are adjacent in RP(G)if and only if(u)C(u)or(u)C(u).In this paper,we study the adjacency spectrum of the reduced power graph of Z_(n),Z^(n)_(p2),Z_(p2) x Z_(p),dihedral group,quaternion group and semi-dihedral group. 展开更多
关键词 reduced power graph finite group adjacency spectrum
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部