alexa Effective global approaches for mutual information based feature selection
Biomedical Sciences

Biomedical Sciences

International Journal of Biomedical Data Mining

Author(s): Xuan Vinh Nguyen, Jeffrey Chan, Simone Romano, James Bailey

Abstract Share this page

Most current mutual information (MI) based feature selection techniques are greedy in nature thus are prone to sub-optimal decisions. Potential performance improvements could be gained by systematically posing MI-based feature selection as a global optimization problem. A rare attempt at providing a global solution for the MI-based feature selection is the recently proposed Quadratic Programming Feature Selection (QPFS) approach. We point out that the QPFS formulation faces several non-trivial issues, in particular, how to properly treat feature `self-redundancy' while ensuring the convexity of the objective function. In this paper, we take a systematic approach to the problem of global MI-based feature selection. We show how the resulting NP-hard global optimization problem could be efficiently approximately solved via spectral relaxation and semi-definite programming techniques. We experimentally demonstrate the efficiency and effectiveness of these novel feature selection frameworks.

  • To read the full article Visit
  • Subscription
This article was published in InProceedingsof the20th ACM SIGKDDinternationalconferenceon Knowledgediscoveryand datamining and referenced in International Journal of Biomedical Data Mining

Relevant Expert PPTs

Recommended Conferences

Peer Reviewed Journals
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version