Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1818
Title: | Comparison of Feature Selection Methods for Supervised Learning |
Authors: | N .Chitra, Dr.Safinaz S |
Issue Date: | 2021 |
Publisher: | Rogers Media Publishing |
Citation: | Design Engineering |
Abstract: | The technology related to the transmission of wireless networks are enhanced and with that many devices are connected to the internet to work consistently among them. Then the utilization of networks multi-folded and unknown persons known as intruders begin to access data without any intimation to the user. To control them the IDS are designed, where the unknown access is detected and prevented from further access. In the pre-processing stage of IDS, the various irrelevant features are identified and eliminated by the process of feature selection of large data stored. The mutual information between features and class is evaluated in the feature selection process which is followed in all the previous proposed papers. But there is weak interaction between features and class which is a common drawback. To overcome this problem various methodologies based on mutual information like JMIM and NJMIM is proposed by Bennaser et.al with a classification accuracy of 90.77% with 8 features using Parkinson's dataset and NJMIM with 83% noted from the graph with sonar dataset which outperformed CMIM, DISR, mRMR, JMI, IG. In Redundant Penalty feature mutual information (RPFMI), the relationship between features and class is given much importance with a classification accuracy of 99.77% using the KDDCUP dataset and in MMIFS the classification accuracy is 94% with the same dataset. So, this study paves the way to develop more techniques in feature selection. |
URI: | http://localhost:8080/xmlui/handle/123456789/1818 |
Appears in Collections: | Electronics and communication Department |
Files in This Item:
File | Size | Format | |
---|---|---|---|
SOE-ECE-14.pdf | 142.81 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.