The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Online Feature Selection with Streaming Features
Abstract
We propose a new online feature selection framework for applications with streaming features where the knowledge of the full feature space is unknown in advance. We define streaming features as features that flow in one by one over time whereas the number of training examples remains fixed. This is in contrast with traditional online learning methods that only deal with sequentially added observations, with little attention being paid to streaming features. The critical challenges for Online Streaming Feature Selection (OSFS) include 1) the continuous growth of feature volumes over time, 2) a large feature space, possibly of unknown or infinite size, and 3) the unavailability of the entire feature set before learning starts. In the paper, we present a novel Online Streaming Feature Selection method to select strongly relevant and nonredundant features on the fly. An efficient Fast-OSFS algorithm is proposed to improve feature selection performance. The proposed algorithms are evaluated extensively on high-dimensional datasets and also with a real-world case study on impact crater detection. Experimental results demonstrate that the algorithms achieve better compactness and higher prediction accuracy than existing streaming feature selection algorithms.
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
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
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
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
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
Rosenwald, A., Wright, G., Chan, W. C., Connors, J. M., Campo, E., Fisher, R. I., Gascoyne, R. D., Muller-Hermelink, H. K., Smeland, E. B., Giltnane, J. M., et al. (2002) · New England Journal of Medicine · doi:10.1056/nejmoa012914 · Cited by 3,829
Gene-expression profiles to predict distant metastasis of lymph-node-negative primary breast cancer
Wang, Y., Klijn, J. G., Zhang, Y., Sieuwerts, A. M., Look, M. P., Yang, F., Talantov, D., Timmermans, M., Meijer-van Gelder, M. E., Yu, J., et al. (2005) · The Lancet · doi:10.1016/s0140-6736(05)17947-1 · Cited by 2,846
Fleiss, J. L., & Agresti, A. (1991) · Journal of the American Statistical Association · doi:10.2307/2290537 · Cited by 2,641
An extensive empirical study of feature selection metrics for text classification
Forman, G. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944974 · Cited by 2,394
Irrelevant Features and the Subset Selection Problem
John, G. H., Kohavi, R., & Pfleger, K. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50023-4 · Cited by 2,368
Efficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100245 · Cited by 1,424
Learning to Classify Text Using Support Vector Machines
Joachims, T. (2002) · Springer eBooks · doi:10.1007/978-1-4615-0907-3 · Cited by 1,366
Conditional Likelihood Maximisation: A Unifying Framework for Mutual Information Feature Selection
Gavin Brown, B., Pocock, A., Zhao, M., & Luján, M. (2012) · Research Explorer (The University of Manchester) · Cited by 1,031
On Model Selection Consistency of Lasso
ZhaoPeng, & Yubin, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248637 · Cited by 996
Weston, J., Mukherjee, S., Chapelle, O., Pontil, M., Poggio, T., & Vapnik, V. N. (2000) · Cited by 988
Consistency-based search in feature selection
Dash, M., & Liu, H. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(03)00079-1 · Cited by 889
Selection of Relevant Features in Machine Learning.
Langley, P. (1994) · doi:10.21236/ada292575 · Cited by 709
Aliferis, C., Statnikov, A., Tsamardinos, I., Mani, S., & Koutsoukos, X. (2010) · doi:10.5555/1756006.1756013 · Cited by 469
Vagis, A. A. (2002) · Journal of Automation and Information Sciences · doi:10.1615/jautomatinfscien.v34.i6.40 · Cited by 404
Supervised feature selection via dependence estimation
Song, L., Smola, A., Gretton, A., Borgwardt, K. M., & Bedo, J. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273600 · Cited by 379
Feature selection via dependence maximization
Song, L., Smola, A. J., Gretton, A., Bedő, J., & Borgwardt, K. M. (2012) · Journal of Machine Learning Research · doi:10.5555/2188385.2343691 · Cited by 346
Feature Selection with Ensembles, Artificial Variables, and Redundancy Elimination
Tuv, E., Borisov, A., Runger, G. C., & Torkkola, K. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1755828 · Cited by 280
High-resolution serum proteomic features for ovarian cancer detection.
Conrads, T. P., Fusaro, V. A., Ross, S., Johann, D., Rajapakse, V, Hitt, B. A., Steinberg, S. M., Kohn, E. C., Fishman, D. A., Whitely, G., et al. (2004) · Endocrine-related cancer · doi:10.1677/erc.0.0110163 · Cited by 260
Feature Selection and Kernel Learning for Local Learning-Based Clustering
Zeng, H., & Cheung, Y.-M. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.215 · Cited by 234
Causation, Prediction, and Search, 2nd Edition
Spirtes, P., Glymour, C., & Scheines, R. (2001) · MIT Press Books · Cited by 212
Quadratic Programming Feature Selection
Rodríguez-Luján, I., Huerta, R., Elkan, C., Cruz, C. S., & Ungar, L. (2010) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 207
Online feature selection using grafting
Perkins, S. J., & Theiler, J. P. (2003) · Cited by 206
Stable feature selection via dense feature groups
Yu, L., Ding, C., & Loscalzo, S. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401986 · Cited by 178
A two-stage gene selection scheme utilizing MRMR filter and GA wrapper
El Akadi, A., Amine, A., El Ouardighi, A., & Aboutajdine, D. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-010-0288-x · Cited by 168
On the Consistency of Feature Selection using Greedy Least Squares Regression
Zhang, T. (2009) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 160
Online Streaming Feature Selection
Wu, X., Yu, K., Wang, H., & Ding, W. (2010) · Adelaide Research & Scholarship (AR&S) (University of Adelaide) · Cited by 141
Self-citationConsensus group stable feature selection
Loscalzo, S., Yu, L., & Ding, C. H. Q. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557084 · Cited by 138
Zhou, J., Foster, D. P., Stine, R. A., & Ungar, L. (2006) · doi:10.5555/1248547.1248614 · Cited by 131
Searching for interacting features in subset selection1
Zhao, Z., & Liu, H. (2009) · Intelligent Data Analysis · doi:10.3233/ida-2009-0364 · Cited by 107
Streaming feature selection using alpha-investing
Zhou, J., Foster, D. P., Stine, R. A., & Ungar, L. (2005) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1081870.1081914 · Cited by 101
A Variance Minimization Criterion to Feature Selection Using Laplacian Regularization
He, X., Ji, M., Zhang, C., & Bao, H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.44 · Cited by 87
Guyon, C. A. I. (2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796-11 · Cited by 80
Subkilometer crater discovery with boosting and transfer learning
Ding, W., Stepinski, T. F., Mu, Y., Bandeira, L., Ricardo, R., Wu, Y., Lu, Z., Cao, T., & Wu, X. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1989734.1989743 · Cited by 76
Self-citationMaximal Linear Embedding for Dimensionality Reduction
Wang, R., Shan, S., Chen, X., Chen, J., & Gao, W. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.39 · Cited by 63
Feature Selection with Conjunctions of Decision Stumps and Learning from Microarray Data
Shah, M., Marchand, M., & Corbeil, J. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.82 · Cited by 61
A countably infinite mixture model for clustering and feature selection
Bouguila, N., & Ziou, D. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-011-0467-4 · Cited by 52
Causal filter selection in microarray data
Bontempi, G., & Meyer, P. E. (2010) · Cited by 42
One-class learning and concept summarization for data streams
Xingquan Zhu, A., Ding, W., Yu, P. S., & Chengqi Zhang, B. (2010) · Knowledge and Information Systems · doi:10.1007/s10115-010-0331-y · Cited by 34
Self-citationAphinyanaphongs, Y., Statnikov, A., & Aliferis, C. (2006) · Journal of the American Medical Informatics Association · doi:10.1197/jamia.m2031 · Cited by 25
Streaming Feature Selection using IIC.
Ungar, L., Zhou, J., Foster, D. P., & Stine, B. A. (2005) · Cited by 21
A study in causal discovery from population-based infant birth and death records.
Mani, S., & Cooper, G. F. (1999) · PubMed · Cited by 20
Cited by
Wu, X., Zhu, X., Wu, G.-Q., & Ding, W. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.109 · Cited by 2,410
Self-citationFeature 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
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Treviño, R. P., Tang, J., & Liu, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.07996 · Cited by 739
A survey on data preprocessing for data stream mining: Current status and future directions
Ramírez-Gallego, S., Krawczyk, B., García, S., Woźniak, M., & Herrera, F. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.01.078 · Cited by 502
Feature selection for text classification: A review
Deng, X., Li, Y., Weng, J., & Zhang, J. (2019) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6083-5 · Cited by 351
Metadata
- Authors
- Wu, X., Yu, K., Ding, W., Wang, H., & Zhu, X.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2013-05
- Volume
- 35
- Issue
- 5
- Pages
- 1178-1192
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2153338628
- Cited by
- 283
- References
- 51
- FWCI
- 11.39
- 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
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.