On the Possible Orderings in the Measurement Selection Problem
From MaRDI portal
Publication:4147429
DOI10.1109/TSMC.1977.4309803zbMATH Open0371.62036OpenAlexW1974542028MaRDI QIDQ4147429FDOQ4147429
Authors: Thomas M. Cover, Jan Van Campenhout
Publication date: 1977
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsmc.1977.4309803
Cited In (9)
- Feature selection using tabu search method
- Title not available (Why is that?)
- Decision-level fusion in fingerprint verification
- Complete search for feature selection in decision trees
- A discrete particle swarm optimization method for feature selection in binary classification problems
- Determination of the optimal number of features for quadratic discriminant analysis via the normal approximation to the discriminant distribution
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- Wrappers for feature subset selection
- Feature selection toolbox
This page was built for publication: On the Possible Orderings in the Measurement Selection Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4147429)