The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Infinite Feature Selection
Abstract
Filter-based feature selection has become crucial in many classification settings, especially object recognition, recently faced with feature learning strategies that originate thousands of cues. In this paper, we propose a feature selection method exploiting the convergence properties of power series of matrices, and introducing the concept of infinite feature selection (Inf-FS). Considering a selection of features as a path among feature distributions and letting these paths tend to an infinite number permits the investigation of the importance (relevance and redundancy) of a feature when injected into an arbitrary set of cues. Ranking the importance individuates candidate features, which turn out to be effective from a classification point of view, as proved by a thoroughly experimental section. The Inf-FS has been tested on thirteen diverse benchmarks, comparing against filters, embedded methods, and wrappers, in all the cases we achieve top performances, notably on the classification tasks of PASCAL VOC 2007-2012.
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
Visualizing and understanding convolutional networks
Zeiler, M. D., & Fergus, R. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10590-1_53 · Cited by 15,839
Golub, T. R., Slonim, D. K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J. P., Coller, H., Loh, M. L., Downing, J. R., Caligiuri, M. A., et al. (1999) · Science · doi:10.1126/science.286.5439.531 · Cited by 11,516
Gene 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
The Pascal Visual Object Classes Challenge: A Retrospective
Everingham, M., Eslami, S. M. A., Van Gool, L., Williams, C. K. I., Winn, J., & Zisserman, A. (2015) · International Journal of Computer Vision · doi:10.1007/s11263-014-0733-5 · Cited by 7,139
Power and Centrality: A Family of Measures
Bonacich, P. (1987) · American Journal of Sociology · doi:10.1086/228631 · Cited by 5,165
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Alon, U., Barkai, N., Notterman, D. A., Gish, K., Ybarra, S., Mack, D., & Levine, A. J. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.12.6745 · Cited by 4,167
Return of the Devil in the Details: Delving Deep into Convolutional Nets
Chatfield, K., Simonyan, K., Vedaldi, A., & Zisserman, A. (2014) · Proceedings of the British Machine Vision Conference 2014 · doi:10.5244/c.28.6 · Cited by 3,335
Spatial Pyramid Pooling in Deep Convolutional Networks for Visual Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10578-9_23 · Cited by 3,034
One-shot learning of object categories
Fei-Fei, L., Fergus, R., & Perona, P. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.79 · Cited by 3,029
Shipp, M. A., Ross, K. N., Tamayo, P., Weng, A. P., Kutok, J. L., Aguiar, R. C. T., Gaasenbeek, M., Angelo, M., Reich, M., Pinkus, G. S., et al. (2002) · Nature Medicine · doi:10.1038/nm0102-68 · Cited by 2,428
Concrete Mathematics: A Foundation for Computer Science
Graham, R. L., Knuth, D. E., Patashnik, O., & Liu, S. (1989) · Computers in Physics · doi:10.1063/1.4822863 · Cited by 2,407
The PASCAL visual object classes challenge 2006 (VOC2006) results
Everingham, M., Zisserman, A., Williams, C. K. I., & Gool, L. V. (2006) · Cited by 2,079
Feature extraction : foundations and applications
Guyon, I., Gunn, S. R., Nikravesh, M., & zadeh, L. N. (2006) · Cited by 1,658
Concrete Mathematics: A Foundation for Computer Science.
Bender, E. A., Graham, R. L., Knuth, D. E., & Patashnik, O. (1991) · The American Mathematical Monthly · doi:10.2307/2324448 · Cited by 1,368
Computational Methods of Feature Selection
(2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796 · Cited by 1,271
Feature Selection via Concave Minimization and Support Vector Machines
Bradley, P. S., & Mangasarian, O. L. (1998) · Cited by 984
Feature Extraction: Foundations and Applications
(2006) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-35488-8 · Cited by 981
Gordon, G. J., Jensen, R. V., Hsiao, L.-L., Gullans, S. R., Blumenstock, J. E., Ramaswamy, S., Richards, W. G., Sugarbaker, D. J., & Bueno, R. (2002) · PubMed · Cited by 859
The 2005 PASCAL Visual Object Classes Challenge
Everingham, M., Zisserman, A., Williams, C. K. I., Van Gool, L., Allan, M., Bishop, C. M., Chapelle, O., Dalal, N., Deselaers, T., Dorkó, G., et al. (2006) · Lecture Notes in Computer Science · doi:10.1007/11736790_8 · Cited by 765
MatConvNet - Convolutional Neural Networks for MATLAB
Vedaldi, A., & Lenc, K. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1412.4564 · Cited by 578
Result Analysis of the NIPS 2003 Feature Selection Challenge
Guyon, I., Gunn, S., Ben‐Hur, A., & Dror, G. (2004) · Cited by 555
Models of Incremental Concept Formation
Gennari, J. H., Langley, P., & Fisher, D. (1988) · doi:10.21236/ada191597 · Cited by 525
Models of incremental concept formation
Gennari, J. H., Langley, P., & Fisher, D. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90046-5 · Cited by 453
Generalized Fisher Score for Feature Selection
Gu, Q., Li, Z., & Han, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.3725 · Cited by 439
Unsupervised feature selection by regularized self-representation
Zhu, P., Zuo, W., Zhang, L., Hu, Q., & Shiu, S. C. K. (2015) · Pattern Recognition · doi:10.1016/j.patcog.2014.08.006 · Cited by 323
Generalized Fisher score for feature selection
Gu, Q., Li, Z., & Han, J. (2011) · Cited by 220
Improving Diversity in Ranking using Absorbing Random Walks
Zhu, X., Goldberg, A. B., Gael, J. V., & Andrzejewski, D. (2007) · Cited by 215
Stable Gene Selection from Microarray Data via Sample Weighting
Yu, L., Han, Y., & Berens, M. E. (2011) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2011.47 · Cited by 98
Computing matrix inversion with optical networks
Wu, K., Soci, C., Shum, P. P., & Zheludev, N. I. (2014) · Optics Express · doi:10.1364/oe.22.000295 · Cited by 43
Fast and Accurate Digit Classification
Maji, S., & Malik, J. (2009) · Cited by 43
Cyclizing Clusters via Zeta Function of a Graph
Zhao, D., & Tang, X. (2008) · Cited by 33
Feature Selection Stability Assessment Based on the Jensen-Shannon Divergence
Guzmán-Martínez, R., & Aláiz-Rodríguez, R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23780-5_48 · Cited by 27
Cited by
NISP: Pruning Networks Using Neuron Importance Score Propagation
Yu, R., Li, A., Chen, C.-F., Lai, J.-H., Morariu, V. I., Han, X., Gao, M., Lin, C.-Y., & Davis, L. S. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00958 · Cited by 794
The Visual Object Tracking VOT2016 Challenge Results
Kristan, M., Leonardis, A., Matas, J., Felsberg, M., Pflugfelder, R., Čehovin, L., Vojír̃, T., Häger, G., Lukežič, A., Fernández, G., et al. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-48881-3_54 · Cited by 679
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
Feature selection techniques for machine learning: a survey of more than two decades of research
Theng, D., & Bhoyar, K. K. (2024) · Knowledge and Information Systems · doi:10.1007/s10115-023-02010-5 · Cited by 510
Structured Pruning for Deep Convolutional Neural Networks: A Survey
He, Y., & Xiao, L. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3334614 · Cited by 363
Metadata
- Authors
- Roffo, G., Melzi, S., & Cristani, M.
- Venue
- 2015 IEEE International Conference on Computer Vision (ICCV)
- Publisher
- IEEE
- Published
- 2015-12
- Pages
- 4202-4210
- OpenAlex
- W2256782633
- Cited by
- 290
- References
- 33
- FWCI
- 12.47
- Type
- conference paper
- 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
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.