ebooks logo journals logo reference works logo abstract databases logo
bullet  SIGN IN Register | Why Register? | Got a Voucher? alerts   marked lists   shopping cart 

informaworld

HOME   |   SEARCH   |   BROWSE
    Issues List       Latest Issue       Subscribe       Article       References       Related articles      
<< firstfirst   < prevprev   Table of contentstoc   next >next   last >>last
Publisher Logo Publication Cover
Search within this journal

AN EFFECTIVE ATTRIBUTE CLUSTERING APPROACH FOR FEATURE SELECTION AND REPLACEMENT 

Authors: Tzung-Pei Hong ab;  Po-Cheng Wang b; Yeong-Chyi Lee c
Affiliations:   a Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan
b Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan
c Department of Information Management, Cheng Shiu University, Kaohsiung, Taiwan
DOI: 10.1080/01969720903294585
Publication Frequency: 8 issues per year
Published in: journal Cybernetics and Systems, Volume 40, Issue 8 November 2009 , pages 657 - 669
Formats available: HTML (English) : PDF (English)
Article Requests: Order Reprints : Request Permissions


Abstract

Feature selection is an important preprocessing step in mining and learning. A good set of features cannot only improve the accuracy of classification, but can also reduce the time to derive rules. It is executed especially when the amount of attributes in a given training data is very large. In this article, an attribute clustering method based on genetic algorithms is proposed for feature selection and feature replacement. It combines both the average accuracy of attribute substitution in clusters and the cluster balance as the fitness function. Experimental comparison with the k-means clustering approach and all combinations of attributes also shows the proposed approach can get a good trade-off between accuracy and time complexity. Besides, after feature selection, the rules derived from only the selected features may usually be hard to use if some values of the selected features cannot be obtained in current environments. This problem can be easily solved in our proposed approach. The attributes with missing values can be replaced by other attributes in the same clusters. The proposed approach is thus more flexible than the previous feature-selection techniques.
Keywords: Feature clustering; Feature selection; Genetic algorithms; k-Means; Reduct
view references (22)
Bookmark with:
  • CiteULike
  • Del.icio.us
  • BibSonomy
  • Connotea
  • More bookmarks
Privacy Policy | Terms & Conditions | Accessibility | RSS
FAQs in: English . Français . Español . 中文(简体和繁體)
© 2009 Informa plc