Abstract
At present, some static feature subset selection algorithms are computationally time-consuming when decision table often change, facing such situations, in fact, the feature subset selection can be computed by utilizing the original decision table. Thus an incremental computation feature subset selection algorithm is provided in this paper, which originated from Boolean matrix technique, to select useful features for the given data objective efficiently. At first, the simplified decision table is introduced. Then using the simplified decision table to design Boolean matrix, the simplified Boolean matrix is constructed. Meanwhile, it is proved that the feature subset selection of the simplified Boolean matrix as the same to that of Boolean matrix. At last, the results on an example show that the efficiency and feasibility of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.