4.5 Article

A novel feature selection method based on normalized mutual information

Journal

APPLIED INTELLIGENCE
Volume 37, Issue 1, Pages 100-120

Publisher

SPRINGER
DOI: 10.1007/s10489-011-0315-y

Keywords

Feature selection; Mutual information; Minimal redundancy; Maximal relevance

Ask authors/readers for more resources

In this paper, a novel feature selection method based on the normalization of the well-known mutual information measurement is presented. Our method is derived from an existing approach, the max-relevance and min-redundancy (mRMR) approach. We, however, propose to normalize the mutual information used in the method so that the domination of the relevance or of the redundancy can be eliminated. We borrow some commonly used recognition models including Support Vector Machine (SVM), k-Nearest-Neighbor (kNN), and Linear Discriminant Analysis (LDA) to compare our algorithm with the original (mRMR) and a recently improved version of the mRMR, the Normalized Mutual Information Feature Selection (NMIFS) algorithm. To avoid data-specific statements, we conduct our classification experiments using various datasets from the UCI machine learning repository. The results confirm that our feature selection method is more robust than the others with regard to classification accuracy.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Computer Science, Hardware & Architecture

All-optical Linear Array with a Reconfigurable Pipelined Bus System (OLARPBS) optical bus parallel computing model

Brian J. d'Auriol

JOURNAL OF SUPERCOMPUTING (2016)

Article Computer Science, Software Engineering

Engineering insightful visualizations

Brian J. d'Auriol

JOURNAL OF VISUAL LANGUAGES AND COMPUTING (2016)

Article Engineering, Electrical & Electronic

Optical Pipelined Multi-bus Interconnection Network Intrinsic Topologies

Brian Joseph d'Auriol

ETRI JOURNAL (2017)

Article Computer Science, Theory & Methods

Group-Based Trust Management Scheme for Clustered Wireless Sensor Networks

Riaz Ahmed Shaikh, Hassan Jameel, Brian J. d'Auriol, Heejo Lee, Sungyoung Lee, Young-Jae Song

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2009)

Article Engineering, Electrical & Electronic

Multi-Floor Semantically Meaningful Localization Using IEEE 802.11 Network Beacons

Uzair Ahmad, Brian J. D'Auriol, Young-Koo Lee, Sungyoung Lee

IEICE TRANSACTIONS ON COMMUNICATIONS (2008)

Article Computer Science, Theory & Methods

An optical power budget model for the Parameterized Linear Array with a Reconfigurable Pipelined Bus System (LARPBS(p)) model

Brian J. d'Auriol, Juan Rene Roldan

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2009)

Article Computer Science, Hardware & Architecture

General criteria-based clustering method for multi-node computing system

Yu Niu, Brian J. d'Auriol, Sungyoung Lee

JOURNAL OF SUPERCOMPUTING (2012)

Article Computer Science, Hardware & Architecture

Serviceable visualizations

Brian J. d'Auriol

JOURNAL OF SUPERCOMPUTING (2012)

Article Computer Science, Software Engineering

Visualization experience and related process modeling

Ilya Malyanov, Brian J. d'Auriol, Sungyoung Lee

JOURNAL OF VISUAL LANGUAGES AND COMPUTING (2013)

Article Chemistry, Analytical

Intrusion-Aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks

Riaz Ahmed Shaikh, Hassan Jameel, Brian J. d'Auriol, Heejo Lee, Sungyoung Lee, Young-Jae Song

SENSORS (2009)

Article Chemistry, Analytical

Achieving Network Level Privacy in Wireless Sensor Networks

Riaz Ahmed Shaikh, Hassan Jameel, Brian J. d'Auriol, Heejo Lee, Sungyoung Lee, Young-Jae Song

SENSORS (2010)

Article Computer Science, Software Engineering

Open our visualization eyes, individualization: On Albrecht Durer's 1515 wood cut celestial charts

Brian J. d'Auriol

INFORMATION VISUALIZATION (2020)

No Data Available