The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approach
Open accessAbstract
Feature selection is playing an increasingly significant role with respect to many computer vision applications spanning from object recognition to visual object tracking. However, most of the recent solutions in feature selection are not robust across different and heterogeneous set of data. In this paper, we address this issue proposing a robust probabilistic latent graph-based feature selection algorithm that performs the ranking step while considering all the possible subsets of features, as paths on a graph, bypassing the combinatorial problem analytically. An appealing characteristic of the approach is that it aims to discover an abstraction behind low-level sensory data, that is, relevancy. Relevancy is modelled as a latent variable in a PLSA-inspired generative process that allows the investigation of the importance of a feature when injected into an arbitrary set of cues. The proposed method has been tested on ten diverse benchmarks, and compared against eleven state of the art feature selection methods. Results show that the proposed approach attains the highest performance levels across many different scenarios and difficulties, thereby confirming its strong robustness while setting a new state of the art in feature selection domain.
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
Very Deep Convolutional Networks for Large-Scale Image Recognition
Simonyan, K., & Zisserman, A. (2014) · arXiv · doi:10.48550/arxiv.1409.1556 · Cited by 114,148
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
Practical Nonparametric Statistics
Groggel, D. J. (2000) · Technometrics · doi:10.1080/00401706.2000.10486067 · Cited by 11,041
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
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
A sentimental education: sentiment analysis using subjectivity summarization based on minimum cuts
Pang, B., & Lee, L. (2004) · Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04 · doi:10.3115/1218955.1218990 · Cited by 3,301
Gene expression correlates of clinical prostate cancer behavior
Singh, D., Febbo, P. G., Ross, K., Jackson, D. G., Manola, J., Ladd, C., Tamayo, P., Renshaw, A. A., D'Amico, A. V., Richie, J. P., et al. (2002) · Cancer Cell · doi:10.1016/s1535-6108(02)00030-2 · Cited by 2,512
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
Laplacian Score for Feature Selection
He, X., Cai, D., & Niyogi, P. (2005) · Cited by 1,962
A Graph-theoretic perspective on centrality
Borgatti, S. P., & Everett, M. G. (2006) · Social Networks · doi:10.1016/j.socnet.2005.11.005 · Cited by 1,678
Cited by
Wheat yellow rust monitoring by learning from multispectral UAV aerial imagery
Su, J., Liu, C., Coombes, M., Hu, X., Wang, C., Xu, X., Li, Q., Guo, L., & Chen, W.-H. (2018) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2018.10.017 · Cited by 283
Monitoring Methods of Human Body Joints: State-of-the-Art and Research Challenges
Faisal, A. I., Majumder, S., Mondal, T., Cowan, D., Naseh, S., & Deen, M. J. (2019) · Sensors · doi:10.3390/s19112629 · Cited by 187
Mahato, S., & Paul, S. (2020) · Journal of Medical Systems · doi:10.1007/s10916-019-1486-z · Cited by 148
Sopic, D., Aminifar, A., Aminifar, A., & Atienza, D. (2018) · IEEE Transactions on Biomedical Circuits and Systems · doi:10.1109/tbcas.2018.2848477 · Cited by 97
Feature Selection Boosted by Unselected Features
Zheng, W., Chen, S., Fu, Z., Zhu, F., Yan, H., & Yang, J. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3058172 · Cited by 51
Metadata
- Authors
- Roffo, G., Melzi, S., Castellani, U., & Vinciarelli, A.
- Venue
- 2017 IEEE International Conference on Computer Vision (ICCV)
- Publisher
- IEEE
- Published
- 2017-10
- Pages
- 1407-1415
- OpenAlex
- W2737688027
- Cited by
- 257
- References
- 26
- FWCI
- 10.11
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approach. https://app.cochat.ai/papers/10.1109/iccv.2017.156
- The paper
- Roffo, G., Melzi, S., Castellani, U., & Vinciarelli, A. (2017). Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approach. 2017 IEEE International Conference on Computer Vision (ICCV). https://doi.org/10.1109/iccv.2017.156
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.