A heuristic algorithm of reduct computation for feature selection is proposed in the paper, which is a discernibility matrix based method and aims at reducing the number of irrelevant and redundant features in data mining. The method used both significance information of attributes and information of discernibility matrix to define the necessity of heuristic feature selection. The advantage of the algorithm is that it can find an optimal reduct for feature selection in most cases. Experimental results confirmed the above assertion. It also shown that the proposed algorithm is more efficient in time performance comparing with other similar computation methods. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Liu, F., & Lu, S. (2007). A feature selection algorithm based on discernibility matrix. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 259–269). Springer Verlag. https://doi.org/10.1007/978-3-540-74377-4_28
Mendeley helps you to discover research relevant for your work.