A novel hybrid feature selection via Symmetrical Uncertainty ranking based local memetic search algorithm
The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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 1×
“Feature selection algorithms can broadly fall into the filter model or the wrapper model [4,2].”
BackgroundAn 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
(1998) · Cited by 3,476
Feature selection for high-dimensional data: a fast correlation-based filter solution
Yu, L., & Liu, H. (2003) · Cited by 2,305
Feature Selection for Knowledge Discovery and Data Mining
Liu, H., & Motoda, H. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5689-3 · Cited by 2,198
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
Benchmarking attribute selection techniques for discrete class data mining
Hall, M. A., & Holmes, G. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1245283 · Cited by 1,232 · cited 1×
“Feature selection generally involves a combination of search and attributes utility estimation plus evaluation with respect to specific learning schemes [19].”
BackgroundIshibuchi, H., Yoshida, T., & Murata, T. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810752 · Cited by 773 · cited 1×
“Results of the computational experiments proposed in [14] clearly show the importance of striking a balance between genetic search and local search.”
BackgroundMeta-Lamarckian Learning in Memetic Algorithms
Ong, Y. S., & Keane, A. J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819944 · Cited by 657
Feature 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
Markov blanket-embedded genetic algorithm for gene selection
Zhu, Z., Ong, Y.-S., & Dash, M. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.02.007 · Cited by 494 · cited 1×
“In this paper, we propose a novel correlation based memetic framework [5,6,27], i.”
MethodA hybrid genetic algorithm and bacterial foraging approach for global optimization
Kim, D. H., Abraham, A., & Cho, J. H. (2007) · Information Sciences · doi:10.1016/j.ins.2007.04.002 · Cited by 469 · cited 1×
“A hybrid approach involving genetic algorithms (GA) and bacterial foraging (BF) algorithms for function optimization problems [16] is illustrated using four test functions and the performance of the algorithm is studied with an emphasis on mutation, crossover, variation of step sizes, chemotactic…”
MethodMemetic algorithms: a short introduction
Moscato, P. (1999) · McGraw-Hill Ltd., UK eBooks · Cited by 455
Wrapper–Filter Feature Selection Algorithm Using a Memetic Framework
Zhu, Z., Ong, Y.-S., & Dash, M. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.883267 · Cited by 443 · cited 2×
“In this paper, we propose a novel correlation based memetic framework [5,6,27], i.”
MethodA genetic algorithm-based method for feature subset selection
Tan, F., Fu, X., Zhang, Y., & Bourgeois, A. G. (2007) · Soft Computing · doi:10.1007/s00500-007-0193-8 · Cited by 251
A decision tree-based attribute weighting filter for naive Bayes
Hall, M. (2007) · Knowledge-Based Systems · doi:10.1016/j.knosys.2006.11.008 · Cited by 169 · cited 1×
“A simple filter method for setting attribute weights for use with naive Bayes has been experimented in [30] to show that naive Bayes with attribute weights rarely degrades the quality of the model compared to standard naive Bayes and, in many cases, improves it dramatically.”
MethodA Genetic Algorithm-Based, Hybrid Machine Learning Approach to Model Selection
Bies, R. R., Muldoon, M. F., Pollock, B. G., Manuck, S. B., Smith, G. S., & Sale, M. E. (2006) · Journal of Pharmacokinetics and Pharmacodynamics · doi:10.1007/s10928-006-9004-6 · Cited by 132
A filter model for feature subset selection based on genetic algorithm
ElAlami, M. E. (2009) · Knowledge-Based Systems · doi:10.1016/j.knosys.2009.02.006 · Cited by 105 · cited 1×
“A novel feature subset selection algorithm, which utilizes a genetic algorithm (GA) to optimize the output nodes of trained artificial neural network (ANN) has been presented in [29].”
MethodAnalysis of the KDD cup 2009: Fast scoring on a large orange customer database
Guyon, I., Boullé, M., Dror, G., & Vogel, D. S. (n.d.) · Cited by 53
An optimization of ReliefF for classification in large datasets
Huang, Y., McCullagh, P. J., & Black, N. D. (2009) · Data & Knowledge Engineering · doi:10.1016/j.datak.2009.07.011 · Cited by 40 · cited 1×
“ReliefF [17] has proved to be a successful feature selector but when handling a large dataset, it is computationally expensive.”
BackgroundDesign and analysis of the KDD cup 2009: fast scoring on a large orange customer database
Guyon, I., Lemaire, V., Boullé, M., Dror, G., & Vogel, D. S. (2010) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1809400.1809414 · Cited by 33
Memetic Algorithms for Feature Selection on Microarray Data
Zhu, Z., & Ong, Y.-S. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72383-7_155 · Cited by 25
Kannan, S., & Ramaraj, N. (2009) · Data Science Journal · doi:10.2481/dsj.007-044 · Cited by 5 · cited 1×
“A new algorithm of data reduction based on a correlation model with data discretization named FCBF is proposed in [31] which perform the discretization of continuous attributes in an efficient manner.”
MethodSelf-citation
Cited by
A Survey on Evolutionary Computation Approaches to Feature Selection
Xue, B., Zhang, M., Browne, W. N., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504420 · Cited by 1,841
Dou, J., Yunus, A. P., Bui, D. T., Merghadi, A., Sahana, M., Zhu, Z., Chen, C.-W., Han, Z., & Pham, B. T. (2020) · Landslides · doi:10.1007/s10346-019-01286-5 · Cited by 519
Differential evolution for filter feature selection based on information theory and feature ranking
Hancer, E., Xue, B., & Zhang, M. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.10.028 · Cited by 394
Tien Bui, D., Ho, T.-C., Pradhan, B., Pham, B.-T., Nhu, V.-H., & Revhaug, I. (2016) · Environmental Earth Sciences · doi:10.1007/s12665-016-5919-4 · Cited by 320
Khan, N., Shahid, S., Ahmed, K., Ismail, T., Nawaz, N., & Son, M. (2018) · Water · doi:10.3390/w10121793 · Cited by 183
“If p(A) and p(B) are the probability density functions and p(A, B) is the joint probability density function of A and B, then MI between A and B is [47,48], MI(A, B) = p(A, B) log p(A, B) p(A).”
Background
Metadata
- Authors
- Senthamarai Kannan, S., & Ramaraj, N.
- Venue
- Knowledge-Based Systems
- Publisher
- Elsevier BV
- Published
- 2010-08
- Volume
- 23
- Issue
- 6
- Pages
- 580-585
- ISSN
- 0950-7051 (ISSN-L)
- OpenAlex
- W2160011548
- Cited by
- 209
- References
- 24
- FWCI
- 2.95
- 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.