Recent advances in feature selection and its applications
The DOI matches its Crossref record; 113 of the 115 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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 · cited 1×
“The L1-norm (namely Lasso, least absolution shrinkage and selection operator) [39] is effectively implemented to make the learning model both sparse and interpretable.”
BackgroundUCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,370
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439 · cited 1×
“Then, after the data transformation step, many single-label feature selection techniques can be used, for example, information gain [62], Chi-square statistic [63], and Orthogonal Centroid Feature Selection (OCFS) [64].”
MethodRegularization 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
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476 · cited 1×
“Solution For a central data repository, efficient distributed programming models and protocols, such as MPI [50] and Google’s MapReduce [51], are resorted.”
MethodFinding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 1×
“The social dimension is extracted based on Modularity Maximization [98].”
MethodProceedings of the 24th international conference on Machine learning
(2007) · doi:10.1145/1273496 · Cited by 11,630
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 · cited 1×
“In addition, some microarray data, such as Leukemia [11], Prostate [12], Lung [13], and Colon [14], are often used to evaluate the performance of feature selection algorithms on the high dimensionality small sample size (HDSSS) problem.”
MethodPeng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544 · cited 1×
“The most well-known feature selection algorithms under this framework are mRMR [21], Mitra’s [22], CFS [23], and FCBF [24,25].”
MethodA tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
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 · cited 1×
“Taking into account the latent interactions among views in [56], tensor product is used to organize multi-view features, and [56] studies the problem of multi-view feature selection based on SVM-RFE [59] and tensor techniques.”
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388 · cited 1×
“Such as Wright [102] transform the face recognition problem into a linear regression problem with sparse constraints for regression coefficients.”
MethodWrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947 · cited 2×
“As of 1997, several papers on variable and feature selection were published [5,6]; however, few papers dealt with data sets with more than 40 features [1].”
BackgroundModel Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261 · cited 1×
“Group Lasso [42] and elastic net [43], and even the tree-guided group Lasso [44] are under the setting of structured sparsity-inducing norm.”
BackgroundFriedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 1×
“For the optimization of evaluation criterion with privacy constraint, in the [78], a variant of the gentleBoost algorithm [79] is adopted to find a greedy solution to constrained objective function for privacy-preserving feature selection.”
MethodDwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
A review of feature selection techniques in bioinformatics
Saeys, Y., Inza, I., & Larrañaga, P. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm344 · Cited by 5,244
A survey on feature selection methods
Chandrashekar, G., & Sahin, F. (2014) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2013.11.024 · Cited by 5,189
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 · cited 1×
“In addition, some microarray data, such as Leukemia [11], Prostate [12], Lung [13], and Colon [14], are often used to evaluate the performance of feature selection algorithms on the high dimensionality small sample size (HDSSS) problem.”
MethodFeature selection for classification
DASH, M., & LIU, H. (1997) · Intelligent Data Analysis · doi:10.1016/s1088-467x(97)00008-5 · Cited by 3,574 · cited 1×
“The [18] still focuses on the traditional feature selection similar to [2,17] besides the comparison of some classical feature selection algorithms on some real-world data sets.”
BackgroundSelf-citationSelection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298 · cited 1×
“As of 1997, several papers on variable and feature selection were published [5,6]; however, few papers dealt with data sets with more than 40 features [1].”
BackgroundAn exploratory technique for investigating large quantities of categorical data
Kass, G. V. (1980) · Applied Statistics · doi:10.2307/2986296 · Cited by 2,880 · cited 1×
“Then, after the data transformation step, many single-label feature selection techniques can be used, for example, information gain [62], Chi-square statistic [63], and Orthogonal Centroid Feature Selection (OCFS) [64].”
MethodOn the mean accuracy of statistical pattern recognizers
Hughes, G. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054102 · Cited by 2,859 · cited 1×
“Hughes used a general parametric model to study the accuracy of a Bayesian classifier as a function of the number of features [3].”
MethodProceedings of the International Joint Conference on Artificial Intelligence 2007
Bundy, A. (2007) · International Joint Conference on Artificial Intelligence · Cited by 2,761
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Self-citationBhattacharjee, A., Richards, W. G., Staunton, J., Li, C., Monti, S., Vasa, P., Ladd, C., Beheshti, J., Bueno, R., Gillette, M., et al. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.191502998 · Cited by 2,576 · cited 1×
“In addition, some microarray data, such as Leukemia [11], Prostate [12], Lung [13], and Colon [14], are often used to evaluate the performance of feature selection algorithms on the high dimensionality small sample size (HDSSS) problem.”
MethodGene 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 · cited 1×
“In addition, some microarray data, such as Leukemia [11], Prostate [12], Lung [13], and Colon [14], are often used to evaluate the performance of feature selection algorithms on the high dimensionality small sample size (HDSSS) problem.”
MethodWu, 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 · cited 1×
“…When data are distributed across a large number of nodes in a network, a distributed feature selection algorithm has to enable an information exchange and fusion mechanism to ensure that all distributed sites (or information sources) can work together to achieve a global optimization goal [55].”
BackgroundAn 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
Feature selection for high-dimensional data: a fast correlation-based filter solution
Yu, L., & Liu, H. (2003) · Cited by 2,305
Self-citationEfficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization
Nie, F., Huang, H., Cai, X., & Ding, C. H. Q. (2010) · neural information processing systems · Cited by 2,231
Snir, M., Otto, S. W., WALKER, D. W., Dongarra, J. J., & Huss‐Lederman, S. (1996) · Cited by 2,152
Proceedings of The 32nd International Conference on Machine Learning
Germain, M., Gregor, K., Murray, I., & Larochelle, H. (2015) · Cited by 2,020
Efficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
Self-citationFeature Extraction: Foundations and Applications (Studies in Fuzziness and Soft Computing)
Guyon, I., Gunn, S., Nikravesh, M., & Zadeh, L. A. (2006) · Springer eBooks · Cited by 1,845
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning
Hall, M. A. (2000) · Cited by 1,715
Feature extraction : foundations and applications
Guyon, I., Gunn, S. R., Nikravesh, M., & zadeh, L. N. (2006) · Cited by 1,658
Feature selection, L 1 vs. L 2 regularization, and rotational invariance
Ng, A. Y. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015435 · Cited by 1,572 · cited 1×
“Feature selection with L1-norm has been fully analyzed in [40].”
BackgroundUnsupervised feature selection using feature similarity
Mitra, P., Murthy, C. A., & Pal, S. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990133 · Cited by 1,460 · cited 1×
“The most well-known feature selection algorithms under this framework are mRMR [21], Mitra’s [22], CFS [23], and FCBF [24,25].”
MethodA Kernel Method for Multi-Labelled Classification
Elisseeff, A., & Weston, J. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0092 · Cited by 1,342 · cited 1×
“Moreover, a multi-label feature selection method is also described in [67], which is based on the minimization of correlation regularized loss of label ranking [68].”
MethodMap-Reduce for Machine Learning on Multicore
Chu, C.-T., Kim, S. K., Lin, Y.-A., Yu, Y., Bradski, G., Ng, A. Y., & Olukotun, K. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0040 · Cited by 1,229 · cited 2×
“Studies also showed that when the data size is large enough, parallelization based on data partition can result in linear speedup as computing resources increase [49].”
MethodHuang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D. (2011) · Proceedings of the 4th ACM workshop on Security and artificial intelligence · doi:10.1145/2046684.2046692 · Cited by 1,194 · cited 1×
“Adversarial machine learning is the design of machine learning algorithms that can resist some sophisticated attacks, and the study of the capabilities and limitationsofattackers[86].”
BackgroundFeature Extraction: Foundations and Applications
(2006) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-35488-8 · Cited by 981
Feature hashing for large scale multitask learning
Weinberger, K., Dasgupta, A., Langford, J., Smola, A., & Attenberg, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553516 · Cited by 906 · cited 1×
“For instance, Weinberger et al. [48] have studied a collaborative spam email filtering task with 16 trillion (10 13 ) unique features.”
BackgroundData Classification: Algorithms and Applications
Aggarwal, C. C. (2014) · doi:10.1201/b17320?locatt=mode:legacy · Cited by 879
The security of machine learning
Barreno, M., Nelson, B., Joseph, A. D., & Tygar, J. D. (2010) · Machine Learning · doi:10.1007/s10994-010-5188-5 · Cited by 817
Feature selection for classification: A review
Tang, J., Alelyani, S., & Liu, H. (2014) · doi:10.1201/b17320-7 · Cited by 757
Self-citationA review of microarray datasets and applied feature selection methods
Bolón-Canedo, V., Sánchez-Maroño, N., Alonso-Betanzos, A., Benítez, J. M., & Herrera, F. (2014) · Information Sciences · doi:10.1016/j.ins.2014.05.042 · Cited by 666 · cited 1×
“A comprehensive survey of earlier work can be found in [91,92].”
BackgroundRobust Feature Selection Using Ensemble Feature Selection Techniques
Saeys, Y., Abeel, T., & Van de Peer, Y. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-87481-2_21 · Cited by 663 · cited 3×
“The stability [26–28].”
MethodRobust biomarker identification for cancer diagnosis with ensemble feature selection methods
Abeel, T., Helleputte, T., Van de Peer, Y., Dupont, P., & Saeys, Y. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btp630 · Cited by 574 · cited 1×
“For example, in [29], an ensemble feature selection method is adopted to identify biomarker for cancer diagnosis.”
MethodTraining a 3-node neural network is NP-complete
Blum, A. L., & Rivest, R. L. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80010-3 · Cited by 543
Filter versus wrapper gene selection approaches in DNA microarray domains
Inza, I., Larrañaga, P., Blanco, R., & Cerrolaza, A. J. (2004) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2004.01.007 · Cited by 425 · cited 1×
“Nowadays, it has enjoyed increased attention due to the massive growth of data across many scientific disciplines, such as in genomic analysis [7], text mining [8], to name a few.”
BackgroundSecurity Evaluation of Pattern Classifiers under Attack
Biggio, B., Fumera, G., & Roli, F. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.57 · Cited by 411 · cited 1×
“Problem The previous works focus on adversarial classification and clustering [87]; only few authors have considered the adversarial feature selection.”
BackgroundLearning from labeled and unlabeled data on a directed graph
Zhou, D., Huang, J., & Schölkopf, B. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102482 · Cited by 403
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
Kim, S., & Xing, E. P. (2018) · Figshare · doi:10.1184/r1/6476414 · Cited by 374
Local-Learning-Based Feature Selection for High-Dimensional Data Analysis
Sun, Y., Todorovic, S., & Goodison, S. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.190 · Cited by 347
Moro, S., Cortez, P., & Rita, P. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.09.024 · Cited by 331
Stable feature selection for biomarker discovery
He, Z., & Yu, W. (2010) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2010.07.002 · Cited by 309
Structured Sparse Principal Component Analysis
Jenatton, R., Obozinski, G., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.1440 · Cited by 277 · cited 1×
“Solution 1 In order to remedy the deficiency of Lasso and due to the importance of structural information, such as group, recently a general definition of the structured sparsity-inducing norm is proposed to incorporate the prior knowledge or structural constraints to find the suitable linear features [41].”
BackgroundOnline Feature Selection and Its Applications
Wang, J., Zhao, P., Hoi, S. C. H., & Jin, R. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.32 · Cited by 275 · cited 1×
“Solution Take this problem into account, an approach for this online feature selection is proposed in [76].”
BackgroundIs feature selection secure against training data poisoning?
Huang, X. X., Biggio, B., Brown, G., Fumera, G., Eckert, C. M., & Roli, F. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.07933 · Cited by 269 · cited 1×
“To explore the vulnerability of some classical feature selection algorithms under attacks [89], sheds light on the issue whether feature selection may be beneficial or even counterproductive when training data are poisoned by intelligent attackers.”
BackgroundOnline feature selection using grafting
Perkins, S. J., & Theiler, J. P. (2003) · International Conference on Machine Learning · Cited by 254
Adversarial Feature Selection Against Evasion Attacks
Zhang, F., Chan, P. P. K., Biggio, B., Yeung, D. S., & Roli, F. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2415032 · Cited by 243 · cited 1×
“Another issue discussed in [90] is to analyze the impact of feature selection result on classifier security against the evasion attack where the attackers goal is to manipulate malicious data at test time to evade detection.”
BackgroundMargin Analysis of the LVQ Algorithm
Crammer, K., Gilad-Bachrach, R., Navot, A., & Tishby, N. (2002) · Cited by 212
Zhou, Q., Zhou, H., & Li, T. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.11.010 · Cited by 199 · cited 1×
“In this aspect, it is similar to cost-sensitive feature selection where the cost of each feature also should be given by domain knowledge or experts [80].”
BackgroundSelf-citationUnsupervised feature selection for linked social media data
Tang, J., & Liu, H. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339673 · Cited by 195 · cited 2×
“Another line of feature selection in social media is unsupervised one in [95,97].”
BackgroundSelf-citationLiu, H., & Motoda, H. (2007) · Chapman & Hall/CRC eBooks · Cited by 182
Self-citationStable 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 · cited 2×
“In consideration of the importance of stability in applications, several stable feature selection algorithms have been proposed, such as ensemble methods [26,29–31], samples weighting [27,32], and feature grouping [28,33], to name a few.”
BackgroundMethodBag Constrained Structure Pattern Mining for Multi-Graph Classification
Wu, J., Zhu, X., Zhang, C., & Yu, P. S. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.2297923 · Cited by 168
A discretization algorithm based on a heterogeneity criterion
Liu, X., & Wang, H. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.135 · Cited by 144
Online Streaming Feature Selection
Wu, X., Yu, K., Wang, H., & Ding, W. (2010) · Adelaide Research & Scholarship (AR&S) (University of Adelaide) · Cited by 141
Document Transformation for Multi-label Feature Selection in Text Categorization
Chen, W., Yan, J., Zhang, B., Chen, Z., & Yang, Q. (2007) · Proceedings · doi:10.1109/icdm.2007.18 · Cited by 140 · cited 1×
“Besides the classic transformations above, a new transformation based on the entropy measure is presented in [61], where an instance is assigned to a label according to a certain probability.”
BackgroundConsensus group stable feature selection
Loscalzo, S., Yu, L., & Ding, C. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557084 · Cited by 138 · cited 4×
“The stability [26–28].”
MethodInfluentialSpectral Feature Selection for Data Mining
Zhao, Z., & Liu, H. (2011) · Chapman & Hall/CRC eBooks · doi:10.1201/b11426 · Cited by 133 · cited 1×
“For example, the spectral feature selection is parallelized on MPI as described in [52].”
MethodSelf-citationHeterogeneous Feature Selection With Multi-Modal Deep Neural Networks and Sparse Group LASSO
Zhao, L., Hu, Q., & Wang, W. (2015) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2015.2477058 · Cited by 132 · cited 1×
“Finally, these selected features are used in the final recognition task [107].”
MethodSimilarity-based online feature selection in content-based image retrieval
Jiang, W., Er, G., Dai, Q., & Gu, J. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.863105 · Cited by 131 · cited 1×
“For example, in the paper [103], Jiang et al.”
MethodUnsupervised Feature Selection for Multi-View Data in Social Media
Tang, J., Hu, X., Gao, H., & Liu, H. (2013) · Proceedings of the 2013 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.30 · Cited by 121 · cited 1×
“Tang et al. [58] study multi-view feature selection in the unsupervised setting.”
BackgroundSelf-citationUnsupervised Streaming Feature Selection in Social Media
Li, J., Hu, X., Tang, J., & Liu, H. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806501 · Cited by 114 · cited 1×
“On the other hand, to address some issues, such as the dynamic feature generation, high label cost and the utilization of ubiquitous link information in social media, the unsupervised online feature selection framework—USFS—is proposed and applied into social media in [100].”
BackgroundSelf-citationFeature Cross-Substitution in Adversarial Classification
Li, B., & Vorobeychik, Y. (2014) · neural information processing systems · Cited by 111
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 104 · cited 4×
“Besides the ensemble feature selection, other stable feature selection methods, such as sample weighting [32], are also used in bioinformatics.”
BackgroundMethodInfluentialTowards Scalable and Accurate Online Feature Selection for Big Data
Yu, K., Wu, X., Ding, W., & Pei, J. (2014) · 2014 IEEE International Conference on Data Mining · doi:10.1109/icdm.2014.63 · Cited by 101
Correlated multi-label feature selection
Gu, Q., Li, Z., & Han, J. (2011) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2063576.2063734 · Cited by 99 · cited 1×
“Moreover, a multi-label feature selection method is also described in [67], which is based on the minimization of correlation regularized loss of label ranking [68].”
MethodYan, J., Liu, N., Zhang, B., Yan, S., Chen, Z., Cheng, Q., Fan, W., & Ma, W. (2005) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1076034.1076058 · Cited by 94 · cited 1×
“Then, after the data transformation step, many single-label feature selection techniques can be used, for example, information gain [62], Chi-square statistic [63], and Orthogonal Centroid Feature Selection (OCFS) [64].”
MethodA Safe Screening Rule for Sparse Logistic RegressionPreprint
Wang, J., Zhou, J.-Y., Liu, J., Wonka, P., & Ye, J. (2013) · Neural Information Processing Systems · doi:10.48550/arxiv.1307.4145 · Cited by 91 · cited 1×
“A fast and effective sparse logistic regression screening rule (Slores) to identify the “inactive” features is proposed in [45].”
Massively parallel feature selection: an approach based on variance preservation
Zhao, Z., Zhang, R., Cox, J., Duling, D., & Sarle, W. (2013) · Machine Learning · doi:10.1007/s10994-013-5373-4 · Cited by 85 · cited 1×
“In addition, a novel large-scale feature selection algorithm is proposed in [53].”
BackgroundKhoshgoftaar, T. M., Gao, K., Napolitano, A., & Wald, R. (2013) · Information Systems Frontiers · doi:10.1007/s10796-013-9430-0 · Cited by 80 · cited 1×
“At the same time, many new applications are emerging, such as software defect prediction [105].”
BackgroundTensor-Based Multi-view Feature Selection with Applications to Brain Diseases
Cao, B., He, L., Kong, X., Yu, P. S., Hao, Z., & Ragin, A. B. (2014) · Proceedings · doi:10.1109/icdm.2014.26 · Cited by 71 · cited 2×
“Solutions Three strategies of multi-view feature selection are summarized in [56]: (1) con-catenates features from all views in the input space, and then a traditional feature selection method is adopted; (2) converts multiple views into a tensor and directly performs feature selection in the…”
MethodYu, Z., Li, L., You, J., Wong, H., & Han, G. (2012) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2012.108 · Cited by 69
FREL: A Stable Feature Selection Algorithm
Li, Y., Si, J., Zhou, G., Huang, S., & Chen, S. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2341627 · Cited by 67 · cited 2×
“The theoretical analysis and experimental results about the stability of ensemble feature weighting are presented in our work [35,36].”
BackgroundSelf-citationgMLC: a multi-label feature selection framework for graph classification
Kong, X., & Yu, P. S. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-011-0407-3 · Cited by 64
An Unsupervised Feature Selection Framework for Social Media Data
Tang, J., & Liu, H. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2320728 · Cited by 61
Self-citationA Variance Reduction Framework for Stable Feature Selection
Yue, H., & Yu, L. (2010) · Proceedings · doi:10.1109/icdm.2010.144 · Cited by 43
Graphical Feature Selection for Multilabel Classification Tasks
Ames, G., Luaces, O., Quevedo, J. R., & Bahamonde, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24800-9_24 · Cited by 39 · cited 1×
“For example, in [65], the well-known algorithm Fast Correlation-Based Filter (FCBF) [24,25] is extended to handle multi-label data through graphical model to represent the relationships among labels and features.”
MethodThe 30th Anniversary of the IEEE Transactions on Pattern Analysis and Machine Intelligence
Zabih, R. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.8 · Cited by 36
Model mining for robust feature selection
Woźnica, A., Nguyen, P., & Kalousis, A. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339674 · Cited by 35 · cited 1×
“In consideration of the importance of stability in applications, several stable feature selection algorithms have been proposed, such as ensemble methods [26,29–31], samples weighting [27,32], and feature grouping [28,33], to name a few.”
MethodDas, K., Bhaduri, K., & Kargupta, H. (2009) · Knowledge and Information Systems · doi:10.1007/s10115-009-0274-3 · Cited by 35
Efficient Methods for Privacy Preserving Face Detection
Avidan, S., & Butman, M. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7503.003.0012 · Cited by 33 · cited 4×
“…selection Problem 1 The goal of privacy-preserving feature selection is to find a feature subset that a classifier will minimize the classification error in the selected feature space, and the sum of privacy degree of features in the selected subset will not beyond the predefined threshold [78].”
BackgroundMethodInfluentialTowards Mining Trapezoidal Data Streams
Zhang, Q., Zhang, P., Long, G., Ding, W., Chengqi Zhang, B., & Wu, X. (2015) · Proceedings · doi:10.1109/icdm.2015.42 · Cited by 32 · cited 1×
“Solution AnewSparseTrapezoidalStreamingDataminingalgorithm(STSD)thatcombining online learning and online feature selection to enable learning trapezoidal data streams with infinite training instances and features is introduced in [77].”
BackgroundFeature Selection for Social Media Data
Tang, J., & Liu, H. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2629587 · Cited by 31 · cited 1×
“One approach to reduce the dimensionality of social media data is still feature selection [94–96].”
BackgroundSelf-citationOnline Group Feature SelectionPreprint
Jing, W., Zhao, Z., Hu, X., Cheung, Y., Wang, M., & Wu, X. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.4774 · Cited by 28
Wu, F. Q., Han, Y., Liu, X., Shao, J., Zhuang, Y., & Zhang, Z. M. (2012) · International Journal of Multimedia Information Retrieval · doi:10.1007/s13735-012-0001-9 · Cited by 24 · cited 3×
“Therefore, the selection of limited discriminative features for certain semantics is hence crucial to make the understanding of multimedia more interpretable [101].”
BackgroundMethodInfluentialSafe Screening for Multi-Task Feature Learning with Multiple Data MatricesPreprint
Wang, J., & Ye, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.04073 · Cited by 24 · cited 1×
“The safe screening rule has been applied into multi-task feature learning [46].”
MethodDiscriminative feature selection for multi-view cross-domain learning
Fang, Z., & Zhang, Z. M. (2013) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2505515.2505532 · Cited by 22 · cited 1×
“Then, multi-view feature selection can be applied into transfer learning by taking advantage of the typically available multiple views of the data in domains [60].”
BackgroundAn Integrative Approach to Identifying Biologically Relevant Genes
Zhao, Z., Wang, J., Sharma, S., Agarwal, N., Liu, H., & Chang, Y. (2010) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.58 · Cited by 21 · cited 3×
“As summarized in [15,47], the knowledge used in feature selection usually can be categorized into two kinds: the knowledge about features and the knowledge about samples.”
BackgroundSelf-citationEnsemble Feature Weighting Based on Local Learning and Diversity
Li, Y., Gao, S., & Chen, S. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8275 · Cited by 19
Self-citationGraph-Margin Based Multi-label Feature Selection
Yan, P., & Li, Y. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-46128-1_34 · Cited by 19 · cited 1×
“In our recent work [69], we adopted the graph model to capture the label correlation, and propose a multi-label feature selection algorithm based on graph and large margin theory.”
MethodSelf-citationLocal learning-based feature weighting with privacy preservation
Li, Y., Yang, J., & Ji, W. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.10.038 · Cited by 15 · cited 2×
“Based on the privacy model above, two privacy-preserving feature selection algorithms are proposed in our recent work [82,83].”
BackgroundMethodSelf-citationFeature Selection in the Tensor Product Feature Space
Smalter, A., Huan, J., & Lushington, G. H. (2009) · Proceedings · doi:10.1109/icdm.2009.101 · Cited by 13 · cited 1×
“The problem of feature selection in the tensor product space is formulated as an integer quadratic programming problem in [57].”
BackgroundDifferentially private feature selection
Yang, J. H., & Li, Y. (2014) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2014.6889613 · Cited by 12
Self-citationSpectral feature selection for mining ultrahigh dimensional data
Liu, H., & Zhao, Z. (2010) · Cited by 11
Self-citationA Scoring Scheme for Online Feature Selection: Simulating Model Performance Without Retraining
Sengupta, D., Bandyopadhyay, S., & Sinha, D. (2016) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2514270 · Cited by 10
Stable L2-Regularized Ensemble Feature Weighting
Li, Y., Huang, S., Chen, S., & Si, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38067-9_15 · Cited by 3 · cited 1×
“The theoretical analysis and experimental results about the stability of ensemble feature weighting are presented in our work [35,36].”
BackgroundSelf-citation
Research works printed but not linked: 8
- Guyon I, Elisseeff A (2003) An introduction to variable and feature selection. J Mach Learn Res 31:1157–1182
- Miller AJ (1984) Selection of subsets of regression variables. J R Stat Soc 147:389–425
- Li JD, Cheng KW, Wang SH, Morstatter F, Trevino RP, Tang JL, Liu H (2016) Feature selection: a data perspective, vol 3, pp 1–73. arXiv:1601.07996 · arXiv
- Strehl A, Ghosh J (2002) Cluster ensembles—a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583–617
- Zhao ZA, Liu H (2012) Spectral feature selection for data mining. Taylor and Francis Group, London
- Yang J, Li Y (2014) Differential privacy feature selection. In: Proceedings of international joint conference on neural networks, pp 4182–4189
- Tang JL, Liu H (2012) Unsupervised feature selection for linked social media data. In: Eighteenth ACM SIGKDD international conference on knowledge discovery and data mining · DOI · Paper page
- Friedman J, Hastie T, Tibshirani R (2000) Additive logistic regression: a statistical view of boosting. Ann Stat 38:337–374 · DOI · Paper page
Cited by
Small data machine learning in materials science
Xu, P., Ji, X., Li, M., & Lu, W. (2023) · npj Computational Materials · doi:10.1038/s41524-023-01000-z · Cited by 866
“According to the relationship between the feature selection algorithms and modeling algorithms, the commonly used feature selection methods can be divided into fi ltered, wrapped and embedded 33,34 .”
MethodStability of feature selection algorithm: A review
Khaire, U. M., & Dhanalakshmi, R. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2019.06.012 · Cited by 630
Heart Disease Identification Method Using Machine Learning Classification in E-Healthcare
Li, J. P., Haq, A. U., Din, S. U., Khan, J., Khan, A., & Saboor, A. (2020) · IEEE Access · doi:10.1109/access.2020.3001149 · Cited by 652
“[13] presented different techniques for different type of feature selection, such as feature selection for high-dimensional small sample size data, large-scale data, and secure feature selection.”
MethodFeature 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
Binary grasshopper optimisation algorithm approaches for feature selection problems
Mafarja, M., Aljarah, I., Faris, H., Hammouri, A. I., Al-Zoubi, A. M., & Mirjalili, S. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.09.015 · Cited by 397
Metadata
- Authors
- Li, Y., Li, T., & Liu, H.
- Affiliations
- Nanjing University of Posts and Telecommunications (CN)
- Florida International University (US)
- Arizona State University (US)
- Corresponding author
- Li, Yun
- Venue
- Knowledge and Information Systems
- Published
- 2017-05-05
- Volume
- 53
- Issue
- 3
- Pages
- 551-577
- ISSN
- 0219-1377 (ISSN-L)
- 0219-3116
- OpenAlex
- W2611743072
- Cited by
- 400
- References
- 115
- Citations by year
- 2026: 31 · 2025: 43 · 2024: 61 · 2023: 56 · 2022: 67 · 2021: 54 · 2020: 34 · 2019: 30 · 2018: 22 · 2017: 2
- FWCI
- 16.12
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Knowledge and Information Systems (publishedVersion)
- Funders
- Natural Science Foundation of Jiangsu Province (BK20131378)
- Scientific, Technological Support Project (Society) of Jiangsu Province (BE2016776)
- National Natural Science Foundation of China (91646116)
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Keywords
- feature selection, high-dimensional small-sample data, large-scale data, multi-view feature selection, multi-label feature selection, online feature selection, bioinformatics applications, social media applications, multimedia retrieval
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.