A more efficient branch and bound algorithm for feature selection
暂无分享,去创建一个
Baozong Yuan | Bin Yu | Bin Yu | B. Yuan
[1] J. Kittler,et al. Feature Set Search Alborithms , 1978 .
[2] Keinosuke Fukunaga,et al. A Branch and Bound Algorithm for Feature Subset Selection , 1977, IEEE Transactions on Computers.
[3] C. Chang. Dynamic programming as applied to feature subset selection in a pattern recognition system , 1972, ACM Annual Conference.
[4] Jan M. Van Campenhout,et al. On the Possible Orderings in the Measurement Selection Problem , 1977, IEEE Transactions on Systems, Man, and Cybernetics.
[5] Anthony N. Mucciardi,et al. A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties , 1971, IEEE Transactions on Computers.
[6] Thomas M. Cover,et al. The Best Two Independent Measurements Are Not the Two Best , 1974, IEEE Trans. Syst. Man Cybern..
[7] Baozong Yuan,et al. A feature selection method for multi-class-set classification , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.