The DOI matches its Crossref record.
10.1162/153244303322753616
Abstract
Variable and feature selection have become the focus of much research in areas of application for which datasets with tens or hundreds of thousands of variables are available. These areas include text processing of internet documents, gene expression array analysis, and combinatorial chemistry. The objective of variable selection is three-fold: improving the prediction performance of the predictors, providing faster and more cost-effective predictors, and providing a better understanding of the underlying process that generated the data. The contributions of this special issue cover a wide range of aspects of such problems: providing a better definition of the objective function, feature construction, feature ranking, multivariate feature selection, efficient search methods, and feature validity assessment methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 44
- Amaldi E., 1998, Theoretical Computer Science, 209, 237, 10.1016/S0304-3975(97)00115-1 · DOI · Paper page
- 10.1162/153244303322753625 · doi:10.1162/153244303322753625
- A. Ben-Hur and I. Guyon. Detecting stable clusters using principal component analysis. In M.J. Brownstein and A. Kohodursky, editors, Methods In Molecular Biology, pages 159-182. Humana Press, 2003. · DOI · Paper page
- 10.1162/153244303322753634 · doi:10.1162/153244303322753634
- 10.1162/153244303322753643 · doi:10.1162/153244303322753643
- 10.1016/S0004-3702(97)00063-5 · DOI · Paper page
- B. Boser, I. Guyon, and V. Vapnik. A training algorithm for optimal margin classifiers. In Fifth Annual Workshop on Computational Learning Theory, pages 144-152, Pittsburgh, 1992. ACM. · DOI · Paper page
- 10.1162/153244303322753652 · doi:10.1162/153244303322753652
- 10.1162/153244303322753661 · doi:10.1162/153244303322753661
- Dietterich T. G., 1895, Neural Computation, 10, 1924
- R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. John Wiley & Sons, USA, 2nd edition, 2001.
- 10.1126/science.286.5439.531 · DOI · Paper page
- 10.1162/153244303322753670 · DOI · Paper page
- 10.1093/bioinformatics/16.10.906 · DOI · Paper page
- 10.1162/153244303322753689 · doi:10.1162/153244303322753689
- Y. Grandvalet and S. Canu. Adaptive scaling for feature selection in SVMs. In NIPS 15, 2002.
- 10.1023/A:1012487302797 · DOI · Paper page
- T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer series in statistics. Springer, New York, 2001. · DOI · Paper page
- T. Jebara and T. Jaakkola. Feature selection and dualities in maximum entropy discrimination. In 16th Annual Conference on Uncertainty in Artificial Intelligence, 2000.
- K. Kira and L. Rendell. A practical approach to feature selection. In D. Sleeman and P. Edwards, editors, International Conference on Machine Learning, pages 368-377, Aberdeen, July 1992. Morgan Kaufmann. · DOI · Paper page
- 10.1016/S0004-3702(97)00043-X · DOI · Paper page
- D. Koller and M. Sahami. Toward optimal feature selection. In 13th International Conference on Machine Learning, pages 284-292, July 1996.
- Y. LeCun, J. Denker, S. Solla, R. E. Howard, and L. D. Jackel. Optimal brain damage. In D. S. Touretzky, editor, Advances in Neural Information Processing Systems II, San Mateo, CA, 1990. Morgan Kaufmann.
- 10.1016/S0925-2312(00)00325-8 · DOI
- A. Y. Ng. On feature selection: learning with exponentially many irrelevant features as training examples. In 15th International Conference on Machine Learning, pages 404- 412. Morgan Kaufmann, San Francisco, CA, 1998.
- A. Y. Ng and M. Jordan. Convergence rates of the voting Gibbs classifier, with application to Bayesian feature selection. In 18th International Conference on Machine Learning, 2001.
- J. Pearl. Causality. Cambridge University Press, 2000.
- F. Pereira, N. Tishby, and L. Lee. Distributional clustering of English words. In Proc. Meeting of the Association for Computational Linguistics, pages 183-190, 1993. · DOI · Paper page
- 10.1162/153244303322753698 · DOI
- 10.1162/153244303322753706 · DOI
- 10.1162/153244303322753715 · DOI
- 10.1162/153244303322753724 · DOI
- B. Schoelkopf and A. Smola. Learning with Kernels. MIT Press, Cambridge MA, 2002.
- D. Schuurmans. A new metric-based approach to model selection. In 9th Innovative Applications of Artificial Intelligence Conference, pages 552-558, 1997.
- 10.1162/153244303322753733 · DOI
- N. Tishby, F. C. Pereira, and W. Bialek. The information bottleneck method. In Proc. of the 37th Annual Allerton Conference on Communication, Control and Computing, pages 368-377, 1999.
- 10.1162/153244303322753742 · DOI
- 10.1073/pnas.091062498 · DOI · Paper page
- V. Vapnik. Estimation of dependencies based on empirical data. Springer series in statistics. Springer, 1982.
- V. Vapnik. Statistical Learning Theory. John Wiley & Sons, N.Y., 1998.
- Vehtari A., 2002, Report, B31
- 10.1162/153244303322753751 · doi:10.1162/153244303322753751
- J. Weston, S. Mukherjee, O. Chapelle, M. Pontil, T. Poggio, and V. Vapnik. Feature selection for SVMs. In NIPS 13, 2000.
- E.P. Xing and R.M. Karp. Cliff: Clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts. In 9th International Conference on Intelligence Systems for Molecular Biology, 2001. · DOI · Paper page
Cited by
Purposeful selection of variables in logistic regression
Bursac, Z., Gauss, C. H., Williams, D. K., & Hosmer, D. W. (2008) · Source Code for Biology and Medicine · doi:10.1186/1751-0473-3-17 · Cited by 4,035
(2015) · Cited by 2,857
Machine learning classifiers and fMRI: A tutorial overview
Pereira, F., Mitchell, T., & Botvinick, M. (2009) · NeuroImage · doi:10.1016/j.neuroimage.2008.11.007 · Cited by 1,624
Menze, B. H., Kelm, B. M., Masuch, R., Himmelreich, U., Bachert, P., Petrich, W., & Hamprecht, F. A. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-213 · Cited by 1,308
Particle swarm optimization for feature selection in classification: a multi-objective approach
Xue, B., Zhang, M., & Browne, W. N. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2227469 · Cited by 1,282
Metadata
- Venue
- CrossRef Listing of Deleted DOIs
- Publisher
- Unmaintained records
- Published
- 2000
- Volume
- 1
- ISSN
- 0003-6951 (ISSN-L)
- OpenAlex
- W2119479037
- Cited by
- 3,502
- References
- 0
- FWCI
- 2.25
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: 10.1162/153244303322753616. https://app.cochat.ai/papers/10.1162/153244303322753616
- The paper
- 10.1162/153244303322753616. (2000). CrossRef Listing of Deleted DOIs. https://doi.org/10.1162/153244303322753616
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.