Referenced Items are not available for this document.
In this paper, a new greedy feature selection algorithm is proposed to detect more precisely informative features. It overcomes the limitation of many existing MI-based gready feature selection algorithms. It is capable of detecting the relation of relevant feature combinations in some degree.In addition, the requirements of the memory storage and computation cost are low. Experimental results for the UCI benchmark dataset demonstrate the good performance of the proposed algorithm on the experimented data sets.
Published in:
Knowledge Acquisition and Modeling, 2008. KAM '08. International Symposium on
Date of Conference: 21-22 Dec. 2008
- Page(s):
- 103 - 107
- Print ISBN:
- 978-0-7695-3488-6
- INSPEC Accession Number:
- 10453422
- Conference Location :
- Wuhan
- Digital Object Identifier :
- 10.1109/KAM.2008.85
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
