A review of feature selection methods on synthetic data
The DOI matches its Crossref record; 81 of the 81 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
(1992) · Cited by 23,431
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855 · cited 1×
“5 [66], naive Bayes (NB) [67], IB1 [68] and SVM [69].”
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 · cited 1×
“– The mRMR (minimum Redundancy Maximum Relevance) method [60] selects features that have the highest relevance with the target class and are also minimally redundant, i.”
MethodGene 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
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 · cited 3×
“There exist numerous papers and books proving the benefits of the feature selection process [5,15,77].”
BackgroundA Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
Feature 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×
“There exist numerous papers and books proving the benefits of the feature selection process [5,15,77].”
Background(1998) · Cited by 3,476
An Introduction to Support Vector Machines and Other Kernel‐based Learning Methods
(2001) · Kybernetes · doi:10.1108/k.2001.30.1.103.6 · Cited by 3,308
A Practical Approach to Feature Selection
Kira, K., & Rendell, L. A. (1992) · Machine Learning Proceedings 1992 · doi:10.1016/b978-1-55860-247-2.50037-1 · Cited by 2,978 · cited 1×
“– ReliefF [58] is an extension of the original Relief algorithm [59].”
MethodEstimating attributes: Analysis and extensions of RELIEF
Kononenko, I. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-57868-4_57 · Cited by 2,958 · cited 1×
“– ReliefF [58] is an extension of the original Relief algorithm [59].”
MethodGene selection and classification of microarray data using random forest
Díaz-Uriarte, R., & Alvarez de Andrés, S. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-3 · Cited by 2,929 · cited 1×
“SD1, SD2 and SD3 are three-class datasets with 75 samples (each class containing 25 samples) generated based on the approach described in [76].”
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 · cited 1×
“Finally, from a theoretical perspective, in [42], a survey of feature selection methods was presented, providing some guidelines in selecting feature selection algorithms, paving the way to build an integrated system for intelligent feature selection.”
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
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 · cited 1×
“The CorrAL dataset [72] has six binary features (i.”
BackgroundKnowledge-based analysis of microarray gene expression data by using support vector machines
Brown, M. P. S., Grundy, W. N., Lin, D., Cristianini, N., Sugnet, C. W., Furey, T. S., Ares, M., & Haussler, D. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.1.262 · Cited by 2,308 · cited 1×
“attractive for gene expression analysis, including their flexibility in choosing a similarity function, sparseness of solution when dealing with large datasets, the ability to handle large feature spaces, and the ability to identify outliers [78].”
BackgroundFeature selection: evaluation, application, and small sample performance
Jain, A., & Zongker, D. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.574797 · Cited by 2,171 · cited 1×
“More experimental work on feature selection algorithms for comparative purposes can be found in [43–47], some of which were performed over artificially generated data, like the widely used Parity, LED or Monks problems [48].”
Instance-based learning algorithms
Aha, D. W., Kibler, D., & Albert, M. K. (1991) · Machine Learning · doi:10.1007/bf00153759 · Cited by 2,163 · cited 15×
“FS-P was the only method that selected the four relevant features and discarded the irrelevant and correlated ones; IB1 was able to achieve a 100 % of classification accuracy, while the other methods were not.”
InfluentialEfficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
Feature 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
Feature extraction : foundations and applications
Guyon, I., Gunn, S. R., Nikravesh, M., & zadeh, L. N. (2006) · Cited by 1,658
Weston, J., Mukherjee, S., Chapelle, O., Pontil, M., Poggio, T., & Vapnik, V. N. (2000) · UCL Discovery (University College London) · Cited by 1,148
Feature Extraction: Foundations and Applications
(2006) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-35488-8 · Cited by 981
Chi2: feature selection and discretization of numeric attributes
Liu, H., & Setiono, R. (2002) · Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/tai.1995.479783 · Cited by 933 · cited 1×
“Although works studying some of these problems [50,51] can be found, up to the authors’ knowledge a complete”
BackgroundConsistency-based search in feature selection
Dash, M., & Liu, H. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(03)00079-1 · Cited by 889 · cited 2×
“The Consistency-based Filter [55] evaluates the worth of a subset of features by the level of consistency in the class values when the training instances are projected onto the subset of attributes.”
BackgroundVariable selection using svm based criteria
Rakotomamonjy, A. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944977 · Cited by 712
Robust 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 1×
“Therefore, new feature selection methods are constantly appearing using different strategies: a) combining several feature selection methods, which could be done by using algorithms from the same approach, such as two filters [16], or coordinating algorithms from two different approaches, usually filters and wrappers…”
MethodFeature selection algorithms: a survey and experimental evaluation
Molina, L. C., Belanche, L., & Àngela Nebot, B. (2003) · Proceedings · doi:10.1109/icdm.2002.1183917 · Cited by 653 · cited 1×
“More experimental work on feature selection algorithms for comparative purposes can be found in [43–47], some of which were performed over artificially generated data, like the widely used Parity, LED or Monks problems [48].”
MethodLi, T., Zhang, C., & Ogihara, M. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth267 · Cited by 648 · cited 1×
“, a high number of features versus low number of samples; most of these studies also tackle with the multiple class problems [24,35–38].”
BackgroundStability of feature selection algorithms: a study on high-dimensional spaces
Kalousis, A., Prados, J., & Hilario, M. (2007) · Knowledge and Information Systems · doi:10.1007/s10115-006-0040-8 · Cited by 614
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Hamady, M., Peden, E., Knight, R., & Singh, R. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-1 · Cited by 543
Feature selection for multi-label naive Bayes classification
Zhang, M.-L., Peña, J. M., & Robles, V. (2009) · Information Sciences · doi:10.1016/j.ins.2009.06.010 · Cited by 505 · cited 1×
“Similarly, there are works examining different FS methods to obtain good performance results using a specific classifier (naive Bayes in [32], C4.”
MethodPractical feature subset selection for machine learning
Hall, M. A., & Smith, L. A. (1998) · Research Commons (University of Waikato) · Cited by 500
Aliferis, C., Statnikov, A., Tsamardinos, I., Mani, S., & Koutsoukos, X. (2010) · doi:10.5555/1756006.1756013 · Cited by 469 · cited 1×
“, a high number of features versus low number of samples; most of these studies also tackle with the multiple class problems [24,35–38].”
BackgroundThe MONK's problems: A Performance Comparison of Different Learning Algorithms
Thrun, S., Bala, J. W., Bloedorn, E., Bratko, I., Cestnik, B., Cheng, J. Q., Jong, K. A. D., Džeroski, S., Fisher, D., Fahlman, S. E., et al. (1991) · doi:10.13021/mars/3370 · Cited by 445
Filter Methods for Feature Selection – A Comparative Study
Sánchez-Maroño, N., Alonso-Betanzos, A., & Tombilla-Sanromán, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77226-2_19 · Cited by 425 · cited 2×
“[64] use a threshold defined by the largest gap between two consecutive ranked attributes, and other authors [51] just studied the whole ranking paying more attention to the first ranked features.”
BackgroundSelf-citationPerformance of feature-selection methods in the classification of high-dimension data
Hua, J., Tembe, W. D., & Dougherty, E. R. (2009) · Pattern Recognition · doi:10.1016/j.patcog.2008.08.001 · Cited by 395 · cited 1×
“, a high number of features versus low number of samples; most of these studies also tackle with the multiple class problems [24,35–38].”
BackgroundFeature 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 386 · cited 1×
“Therefore, new feature selection methods are constantly appearing using different strategies: a) combining several feature selection methods, which could be done by using algorithms from the same approach, such as two filters [16], or coordinating algorithms from two different approaches, usually filters and wrappers…”
MethodAdaptive Intrusion Detection: A Data Mining Approach
Lee, W., Stolfo, S. J., & Mok, K. W. (2000) · Artificial Intelligence Review · doi:10.1023/a:1006624031083 · Cited by 347 · cited 1×
“This technique has found success in many different real-world applications like DNA microarray analysis [7], intrusion detection [8,9], text categorization [10,11] or information retrieval [12], including image retrieval [13] or music information retrieval [14].”
Iterative RELIEF for Feature Weighting: Algorithms, Theories, and Applications
Sun, Y. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1093 · Cited by 342
Searching for interacting features
Zhao, Z., & Liu, H. (2007) · International Joint Conference on Artificial Intelligence · Cited by 270
A novel feature selection approach for biomedical data classification
Peng, Y., Wu, Z., & Jiang, J. (2010) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2009.07.008 · Cited by 257
Unsupervised feature selection applied to content-based retrieval of lung images
Dy, J. G., Brodley, C. E., Kak, A., Broderick, L. S., & Aisen, A. M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1182100 · Cited by 255 · cited 1×
“This technique has found success in many different real-world applications like DNA microarray analysis [7], intrusion detection [8,9], text categorization [10,11] or information retrieval [12], including image retrieval [13] or music information retrieval [14].”
Redundancy based feature selection for microarray data
Yu, L., & Liu, H. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014149 · Cited by 244 · cited 1×
“This technique has found success in many different real-world applications like DNA microarray analysis [7], intrusion detection [8,9], text categorization [10,11] or information retrieval [12], including image retrieval [13] or music information retrieval [14].”
Bolón-Canedo, V., Sánchez-Maroño, N., & Alonso-Betanzos, A. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.11.028 · Cited by 208 · cited 1×
“This technique has found success in many different real-world applications like DNA microarray analysis [7], intrusion detection [8,9], text categorization [10,11] or information retrieval [12], including image retrieval [13] or music information retrieval [14].”
Self-citationGene selection algorithm by combining reliefF and mRMR
Zhang, Y., Ding, C., & Li, T. (2008) · BMC Genomics · doi:10.1186/1471-2164-9-s2-s27 · Cited by 199
An ensemble of filters and classifiers for microarray data classification
Bolón-Canedo, V., Sánchez-Maroño, N., & Alonso-Betanzos, A. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2011.06.006 · Cited by 183
Self-citationA 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
A Study on Feature Selection Techniques in Educational Data MiningPreprint
Ramaswami, M., & Bhaskaran, R. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.3924 · Cited by 155 · cited 1×
“So, for example, the work in [10] presents an empirical comparison of twelve feature selection methods evaluated on a benchmark of 229 text classification problem instances; the comparative study in [28] is used for the detection of breast cancers in mammograms; recent works analyze the application of FS in growing re…”
MethodConsensus 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
Iterative RELIEF for feature weighting
Sun, Y., & Li, J. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143959 · Cited by 134 · cited 1×
“Therefore, new feature selection methods are constantly appearing using different strategies: a) combining several feature selection methods, which could be done by using algorithms from the same approach, such as two filters [16], or coordinating algorithms from two different approaches, usually filters and wrappers…”
MethodAverage-case analysis of a nearest neighbor algorthim
Langley, P., & Iba, W. (1993) · International Joint Conference on Artificial Intelligence · Cited by 86
George, V. S., & Raj, C. (2011) · International Journal of Computer Science & Engineering Survey · doi:10.5121/ijcses.2011.2302 · Cited by 81 · cited 1×
“5 in [33] or the theoretical review for SVM in [34]).”
BackgroundConcept-based feature generation and selection for information retrieval
Egozi, O., Gabrilovich, E., & Markovitch, S. (2008) · Cited by 77
Saari, P., Eerola, T., & Lartillot, O. (2011) · IEEE Transactions on Audio Speech and Language Processing · doi:10.1109/tasl.2010.2101596 · Cited by 73 · cited 1×
“This technique has found success in many different real-world applications like DNA microarray analysis [7], intrusion detection [8,9], text categorization [10,11] or information retrieval [12], including image retrieval [13] or music information retrieval [14].”
Sun, Y., Babbs, C. F., & Delp, E. J. (2005) · Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC) · doi:10.1109/iembs.2005.1615996 · Cited by 66 · cited 1×
“So, for example, the work in [10] presents an empirical comparison of twelve feature selection methods evaluated on a benchmark of 229 text classification problem instances; the comparative study in [28] is used for the detection of breast cancers in mammograms; recent works analyze the application of FS in growing re…”
MethodHighly discriminative statistical features for email classification
Gómez, J. C., Boiy, E., & Moens, M. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-011-0403-7 · Cited by 65 · cited 1×
“This technique has found success in many different real-world applications like DNA microarray analysis [7], intrusion detection [8,9], text categorization [10,11] or information retrieval [12], including image retrieval [13] or music information retrieval [14].”
Identification of Full and Partial Class Relevant Genes
Zhu, Z., Ong, Y.-S., & Żurada, J. M. (2008) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2008.105 · Cited by 61 · cited 16×
“For these datasets, besides of using the index of success and classification accuracy, we will use the measures employed in [75], which are more specific for this problem.”
BackgroundMethodInfluentialReview and Evaluation of Feature Selection Algorithms in Synthetic ProblemsPreprint
Belanche, L., & González, F. F. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1101.2320 · Cited by 54 · cited 1×
“[49] opted for discarding those weights associated to the ranking which were further than two variances from the mean.”
BackgroundCSE-92-18 - An Evaluation of Feature Selection Methodsand Their Application to Computer Security
Doak, J. (1992) · eScholarship (California Digital Library) · Cited by 54
Feature Selection Using Mutual Information: An Experimental Study
Liu, H., Liu, L., & Zhang, H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89197-0_24 · Cited by 48 · cited 1×
“Other comparative studies are devoted to a specific approach such as in [30] where an experimental study of eight typical filter mutual information-based feature selection algorithms on thirty-three datasets is presented; or in [31] that evaluates the capability of the survival ReliefF algorithm (sReliefF) and of a tu…”
BackgroundCausal filter selection in microarray data
Bontempi, G., & Meyer, P. E. (2010) · Cited by 42
An MLP-based feature subset selection for HIV-1 protease cleavage site analysis
Kim, G., Kim, Y.-J., Lim, H., & Kim, H. (2009) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2009.07.010 · Cited by 39 · cited 18×
“The ability of feature selection methods to deal with relevance, irrelevance and redundancy will be checked over two nonlinear scenarios, in the case of XOR-100 with the added handicap of a small ratio between number of samples and number of features.”
BackgroundMethodInfluentialA COMPARATIVE EVALUATION OF MEDIUM-AND LARGE-SCALE FEATURE SELECTORS FOR PATTERN CLASSIFIERS
Kudo, M., & Sklansky, J. (1998) · Czech digital mathematics library · Cited by 33
Implementing ReliefF filters to extract meaningful features from genetic lifetime datasets
Beretta, L., & Santaniello, A. (2010) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2010.12.003 · Cited by 26 · cited 1×
“Other comparative studies are devoted to a specific approach such as in [30] where an experimental study of eight typical filter mutual information-based feature selection algorithms on thirty-three datasets is presented; or in [31] that evaluates the capability of the survival ReliefF algorithm (sReliefF) and of a tu…”
BackgroundA Feature Selection Algorithm Capable of Handling Extremely Large Data Dimensionality
Sun, Y., Todorović, S., & Goodison, S. (2008) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972788.48 · Cited by 26 · cited 1×
“Therefore, new feature selection methods are constantly appearing using different strategies: a) combining several feature selection methods, which could be done by using algorithms from the same approach, such as two filters [16], or coordinating algorithms from two different approaches, usually filters and wrappers…”
MethodScalable Feature Selection for Multi-class Problems
Chidlovskii, B., & Lecerf, L. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87479-9_33 · Cited by 20 · cited 1×
“Therefore, new feature selection methods are constantly appearing using different strategies: a) combining several feature selection methods, which could be done by using algorithms from the same approach, such as two filters [16], or coordinating algorithms from two different approaches, usually filters and wrappers…”
MethodVariable Selection: A Statistical Dependence Perspective
Seth, S., & Príncipe, J. C. (2010) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2010.148 · Cited by 19 · cited 2×
“Also, the authors [61] state that λ = 1 performs better than other λ values.”
BackgroundMethodObtaining scalable and accurate classification in large-scale spatio-temporal domains
Vainer, I., Kraus, S., Kaminka, G. A., & Slovin, H. (2010) · Knowledge and Information Systems · doi:10.1007/s10115-010-0348-2 · Cited by 18 · cited 1×
“Therefore, new feature selection methods are constantly appearing using different strategies: a) combining several feature selection methods, which could be done by using algorithms from the same approach, such as two filters [16], or coordinating algorithms from two different approaches, usually filters and wrappers…”
MethodMachine learning and applications (icmla), 2010 ninth international conference on
Seth, S., & Príncipe, J. C. (2010) · International Conference on Machine Learning and Applications · Cited by 18
Empirical Evaluation of Feature Subset Selection Based on a Real-World Data Set
Perner, P., & Apte, C. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45372-5_68 · Cited by 15
Multivariate Non-Linear Feature Selection with Kernel Methods
Guyon, I., Bitter, H.-M., Ahmed, Z., Brown, M., & Heller, J. (2006) · Springer eBooks · doi:10.1007/3-540-32365-1_12 · Cited by 12 · cited 1×
“[41].”
Simultaneously Removing Noise and Selecting Relevant Features for High Dimensional Noisy Data
Byeon, B., & Rasheed, K. (2008) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2008.87 · Cited by 12 · cited 1×
“) also present noisy data; however, no specific FS comparative studies dealing with this complex problem were found in the literature, although some interesting works have been proposed, see for example [16,39,40].”
BackgroundQuery-learning-based iterative feature-subset selection for learning from high-dimensional data sets
Mamitsuka, H. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-005-0199-4 · Cited by 5 · cited 1×
“However, it is also interesting and a common practice in the literature [65] to see the classification accuracy obtained in a 10-fold crossvalidation, in order to check if the true model (that is, the one with an index of success of 100) is also unique (that is, if is the only one that can achieve the best percentage…”
BackgroundEfficient Feature Selection in the Presence of Outliers and Noises?
Yang, S.-H., & Hu, B.-G. (2016) · Cited by 4
Efficient Feature Selection in the Presence of Outliers and Noises
Yang, S.-H., & Hu, B.-G. (2008) · Springer eBooks · doi:10.1007/978-3-540-68636-1_18 · Cited by 2 · cited 1×
“) also present noisy data; however, no specific FS comparative studies dealing with this complex problem were found in the literature, although some interesting works have been proposed, see for example [16,39,40].”
Background(2001)
Research works printed but not linked: 4
- Provost F (2000) Distributed data mining: scaling up and beyond. In: Kargupta H, Chan P (eds) Advances in distributed data mining. Morgan Kaufmann, San Francisco
- Guyon I, Elisseeff A (2003) An introduction to variable and feature selection. J Mach Learn Res 3: 1157–1182
- Liu H, Setiono R (1998) Scalable feature selection for large sized databases. In: Proceedings of the 4th world conference on machine learning, pp 101–106
- Mejía-Lavalle M, Sucar E, Arroyo G (2006) Feature selection with a perceptron neural net. In: Proceedings of the international workshop on feature selection for data mining, pp 131–135
Cited by
Applications of machine learning to machine fault diagnosis: A review and roadmap
Lei, Y., Yang, B., Jiang, X., Jia, F., Li, N., & Nandi, A. K. (2020) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2019.106587 · Cited by 2,997
Relief-based feature selection: Introduction and review
Urbanowicz, R. J., Meeker, M., La Cava, W., Olson, R. S., & Moore, J. H. (2018) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2018.07.014 · Cited by 1,311
A Review of Feature Selection Methods for Machine Learning-Based Disease Risk Prediction
Pudjihartono, N., Fadason, T., Kempa-Liehr, A. W., & O'Sullivan, J. M. (2022) · Frontiers in Bioinformatics · doi:10.3389/fbinf.2022.927312 · Cited by 880
A review of feature selection methods in medical applications
Remeseiro, B., & Bolon-Canedo, V. (2019) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2019.103375 · Cited by 804
Self-citationBenchmark for filter methods for feature selection in high-dimensional classification data
Bommert, A., Sun, X., Bischl, B., Rahnenführer, J., & Lang, M. (2020) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2019.106839 · Cited by 725
Metadata
- Authors
- Bolón-Canedo, V., Sánchez-Maroño, N., & Alonso-Betanzos, A.
- Venue
- Knowledge and Information Systems
- Published
- 2012-03-30
- Volume
- 34
- Issue
- 3
- Pages
- 483-519
- ISSN
- 0219-1377 (ISSN-L)
- 0219-3116
- OpenAlex
- W2056168656
- Semantic Scholar
- 80f9e9009c550eff90f3d3de6ad85c28397280e0
- Cited by
- 830
- References
- 81
- Citations by year
- 2026: 39 · 2025: 78 · 2024: 75 · 2023: 87 · 2022: 88 · 2021: 91 · 2020: 63 · 2019: 64 · 2018: 61 · 2017: 56 · 2016: 44 · 2015: 45 · 2014: 24 · 2013: 11 · 2012: 3
- FWCI
- 25.77
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Knowledge and Information Systems (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Keywords
- feature selection, synthetic data, high-dimensional data, filter methods, embedded methods, wrapper methods, feature redundancy, feature interaction, noise, small sample size, classification performance
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.