The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso
Open accessAbstract
The goal of supervised feature selection is to find a subset of input features that are responsible for predicting output values. The least absolute shrinkage and selection operator (Lasso) allows computationally efficient feature selection based on linear dependency between input features and output values. In this letter, we consider a feature-wise kernelized Lasso for capturing nonlinear input-output dependency. We first show that with particular choices of kernel functions, nonredundant features with strong statistical dependence on output values can be found in terms of kernel-based independence measures such as the Hilbert-Schmidt independence criterion. We then show that the globally optimal solution can be efficiently computed; this makes the approach scalable to high-dimensional problems. The effectiveness of the proposed method is demonstrated through feature selection experiments for classification and regression with thousands of features.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
Peng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
MINIMUM REDUNDANCY FEATURE SELECTION FROM MICROARRAY GENE EXPRESSION DATA
DING, C., & PENG, H. (2005) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720005001004 · Cited by 2,751
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
Meinshausen, N., & Bühlmann, P. (2010) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00740.x · Cited by 2,215
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
The Group Lasso for Logistic Regression
Meier, L., Van De Geer, S., & Bühlmann, P. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00627.x · Cited by 1,674
Measuring 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
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
NOTES ON THE HISTORY OF CORRELATION
PEARSON, K. (1920) · Biometrika · doi:10.1093/biomet/13.1.25 · Cited by 918
Variable selection in nonparametric additive models
Huang, J., Horowitz, J. L., & Wei, F. (2010) · The Annals of Statistics · doi:10.1214/09-aos781 · Cited by 537
Ravikumar, P., Lafferty, J., Liu, H., & Wasserman, L. (2009) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2009.00718.x · Cited by 535
Bolasso: model consistent Lasso estimation through the bootstrap
Bach, F. R. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390161 · Cited by 387
Roth, V. (2004) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2003.809398 · Cited by 322
Regulation of gene expression in the mammalian eye and its relevance to eye disease
Scheetz, T. E., Kim, K.-Y. A., Swiderski, R. E., Philp, A. R., Braun, T. A., Knudtson, K. L., Dorrance, A. M., DiBona, G. F., Huang, J., Casavant, T. L., et al. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0602562103 · Cited by 291
Online Electromyographic Control of a Robotic Prosthesis
Shenoy, P., Miller, K. J., Crawford, B., & Rao, R. P. N. (2008) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2007.909536 · Cited by 285
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244302760185252 · Cited by 212
Forman, G. (2008) · doi:10.1145/1458082.1458119 · Cited by 134
Mutual information estimation reveals global associations between stimuli and biological processes
Suzuki, T., Sugiyama, M., Kanamori, T., & Sese, J. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-s1-s52 · Cited by 116
Self-citationFast learning rate of multiple kernel learning: Trade-off between sparsity and smoothness
Suzuki, T., & Sugiyama, M. (2013) · The Annals of Statistics · doi:10.1214/13-aos1095 · Cited by 60
Self-citationSemi-supervised speaker identification under covariate shift
Yamada, M., Sugiyama, M., & Matsui, T. (2009) · Signal Processing · doi:10.1016/j.sigpro.2009.06.001 · Cited by 47
Self-citation
Cited by
Explainability in Graph Neural Networks: A Taxonomic Survey
Yuan, H., Yu, H., Gui, S., & Ji, S. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3204236 · Cited by 583
A comprehensive survey on feature selection in the various fields of machine learning
Dhal, P., & Azad, C. (2022) · Applied Intelligence · doi:10.1007/s10489-021-02550-9 · Cited by 495
Review of swarm intelligence-based feature selection methods
Rostami, M., Berahmand, K., Nasiri, E., & Forouzandeh, S. (2021) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2021.104210 · Cited by 451
GraphLIME: Local Interpretable Model Explanations for Graph Neural Networks
Huang, Q., Yamada, M., Tian, Y., Singh, D., & Chang, Y. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3187455 · Cited by 424
Self-citationLin, W., Tong, T., Gao, Q., Guo, D., Du, X., Yang, Y., Guo, G., Xiao, M., Du, M., Qu, X., et al. (2018) · Frontiers in Neuroscience · doi:10.3389/fnins.2018.00777 · Cited by 390
Metadata
- Authors
- Yamada, M., Jitkrittum, W., Sigal, L., Xing, E. P., & Sugiyama, M.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 2014-01
- Volume
- 26
- Issue
- 1
- Pages
- 185-207
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2105465844
- Cited by
- 304
- References
- 26
- FWCI
- 5.45
- Type
- journal article
- 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.