The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Supervised feature selection via dependence estimation
Open accessAbstract
We introduce a framework for filtering features that employs the Hilbert-Schmidt Independence Criterion (HSIC) as a measure of dependence between the features and the labels. The key idea is that good features should maximise such dependence. Feature selection for various supervised learning problems (including classification and regression) is unified under this framework, and the solutions can be approximated using a backward-elimination algorithm. We demonstrate the usefulness of our method on both artificial and real world datasets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Smyth, G. K. (2004) · Statistical Applications in Genetics and Molecular Biology · doi:10.2202/1544-6115.1027 · Cited by 11,829
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Self-citationGene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954 · cited 3×
“Forward selection tries to increase Q ( T ) as much as possible for each inclusion of features, and backward elimination tries to achieve this for each deletion of features (Guyon et al., 2002).”
BackgroundGene expression profiling predicts clinical outcome of breast cancer
van 't Veer, L. J., Dai, H., van de Vijver, M. J., He, Y. D., Hart, A. A. M., Mao, M., Peterse, H. L., van der Kooy, K., Marton, M. J., Witteveen, A. T., et al. (2002) · Nature · doi:10.1038/415530a · Cited by 9,536 · cited 1×
“Pearson’s correlation is commonly used in microarray analysis [ 13 , 14], and is defined as rxy = ( Pm i=1 (xi ¯x)(yi ¯ y))/(sxsy), for each column x of X (scores are computed separately for each feature).”
MethodAn introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
Approximation Theorems of Mathematical Statistics
Serfling, R. J. (1980) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316481 · Cited by 5,851
A Practical Approach to Feature Selection
Kira, K., & Rendell, L. A. (1992) · Machine Learning Proceedings 1992 · doi:10.1016/b978-1-55860-247-2.50037-1 · Cited by 2,978
Diagnosis of multiple cancer types by shrunken centroids of gene expression
Tibshirani, R., Hastie, T., Narasimhan, B., & Chu, G. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.082099299 · Cited by 2,930
Integrating structured biological data by Kernel Maximum Mean Discrepancy
Borgwardt, K. M., Gretton, A., Rasch, M. J., Kriegel, H.-P., Schölkopf, B., & Smola, A. J. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl242 · Cited by 1,674
Self-citationMeasuring Statistical Dependence with Hilbert-Schmidt Norms
Gretton, A., Bousquet, O., Smola, A., & Schölkopf, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564089_7 · Cited by 1,560
Self-citationToward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Kernel Methods in Computational Biology
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/4057.001.0001 · Cited by 1,032
Weston, J., Mukherjee, S., Chapelle, O., Pontil, M., Poggio, T., & Vapnik, V. N. (2000) · Cited by 988
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P., & Wrobel, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_11 · Cited by 879
Cristianini, N., Kandola, J., Elisseeff, A., & Shawe-Taylor, J. (2006) · Studies in Fuzziness and Soft Computing · doi:10.1007/3-540-33486-6_8 · Cited by 837
Dimensionality Reduction for Supervised Learning With Reproducing Kernel Hilbert Spaces
Fukumizu, K., Bach, F. R., & Jordan, M. I. (2003) · doi:10.21236/ada446572 · Cited by 723
Thousands of samples are needed to generate a robust gene list for predicting outcome in cancer
Ein-Dor, L., Zuk, O., & Domany, E. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601231103 · Cited by 689
Use of the zero norm with linear models and kernel methods
Weston, J., Elisseeff, A., Schölkopf, B., & Tipping, M. (2003) · MPG.PuRe (Max Planck Society) · doi:10.5555/944919.944982 · Cited by 688
Spatio-spectral filters for improving the classification of single trial EEG
Lemm, S., Blankertz, B., Curio, G., & Muller, K.-R. (2005) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2005.851521 · Cited by 643
Dornhege, G., Blankertz, B., Curio, G., & Muller, K.-R. (2004) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2004.827088 · Cited by 631
Class Prediction by Nearest Shrunken Centroids, with Applications to DNA Microarrays
Tibshirani, R., Hastie, T., Narasimhan, B., & Chu, G. (2003) · Statistical Science · doi:10.1214/ss/1056397488 · Cited by 410
Combined SVM-Based Feature Selection and Classification
Neumann, J., Schnörr, C., & Steidl, G. (2005) · Machine Learning · doi:10.1007/s10994-005-1505-9 · Cited by 248
Joint measures and cross-covariance operators
Baker, C. R. (1973) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1973-0336795-3 · Cited by 226
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244302760185252 · Cited by 212
Entropy and Inference, Revisited
Nemenman, I., Shafee, F., & Bialek, W. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0065 · Cited by 211
A Consistent Test for Bivariate Dependence
Feuerverger, A. (1993) · International Statistical Review · doi:10.2307/1403753 · Cited by 118
Optimizing spatio-temporal filters for improving Brain-Computer Interfacing
Dornhege, G., Blankertz, B., Krauledat, M., Losch, F., Curio, G., & Müller, K. (2005) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 69
Bedő, J., Sanderson, C., & Kowalczyk, A. (2006) · Lecture notes in computer science · doi:10.1007/11941439_21 · Cited by 39
Cited by
Feature selection in machine learning: A new perspective
Cai, J., Luo, J., Wang, S., & Yang, S. (2018) · Neurocomputing · doi:10.1016/j.neucom.2017.11.077 · Cited by 2,061
Steganalysis by subtractive pixel adjacency matrix
Pevný, T., Bas, P., & Fridrich, J. (2009) · Proceedings of the 11th ACM workshop on Multimedia and security · doi:10.1145/1597817.1597831 · Cited by 769
Feature selection for classification: A review
Tang, J., Alelyani, S., & Liu, H. (2014) · doi:10.1201/b17320-7 · Cited by 757
A Hilbert Space Embedding for Distributions
Smola, A., Gretton, A., Song, L., & Schölkopf, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75225-7_5 · Cited by 706
Self-citationA Review of Feature Selection and Its Methods
Venkatesh, B., & Anuradha, J. (2019) · Cybernetics and Information Technologies · doi:10.2478/cait-2019-0001 · Cited by 631
Metadata
- Authors
- Song, L., Smola, A., Gretton, A., Borgwardt, K. M., & Bedo, J.
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 823-830
- OpenAlex
- W2101267652
- Cited by
- 379
- References
- 30
- FWCI
- 35.36
- Type
- conference paper
- Language
- en
- Open access
- green
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
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.