The DOI matches its Crossref record; 44 of the 45 references it cites were found in a registry or an index.
Theoretical and Empirical Analysis of ReliefF and RReliefF
Open accessOverview
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
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,867
(1992) · Cited by 23,431
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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 21,030
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,498
A Practical Approach to Feature Selection
Kira, K., & Rendell, L. A. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50037-1 · Cited by 3,090
Estimating attributes: Analysis and extensions of RELIEF
Kononenko, I. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57868-4_57 · Cited by 3,062
Self-citationAn Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,802
The feature selection problem: traditional methods and a new algorithm
Kira, K., & Rendell, L. A. (1992) · National Conference on Artificial Intelligence · Cited by 1,828
Research works printed but not linked: 6
- Dietterich, T. G. (1997). Machine learning research: Four current directions. AI Magazine, 18:4, 97-136.
- Jovanoski, V., & Lavrač, N. (1999). Feature subset selection in association rules learning systems. In M. Grobelnik, & D. Mladenič (Eds.), Prooceedings of the Conference Analysis, Warehousing and Mining the Data (AWAMIDA'99) (pp. 74-77).
- Robnik, M. (1995). Constructive induction in machine learning. Electrotehnical Review, 62:1, 43-49. (in Slovene).
- Robnik Šikonja, M. (1998). Speeding up relief algorithm with k-d trees. In Proceedings of Electrotehnical and Computer Science Conference (ERK'98) (pp. B:137-140). Portorož, Slovenia.
- Robnik Šikonja, M., & Kononenko, I. (1996). Context sensitive attribute estimation in regression. In M. Kubat, & G. Widmer (Eds.), Proceedings of ICML'96 Workshop on Learning in Context Sensitive Domains (pp. 43-52). Morgan Kaufmann.
- Vilalta, R. (1999). Understanding accuracy performance through concept characterization and algorithm analysis. In Proceedings of the ICML-99 Workshop on Recent Advances in Meta-Learning and Future Work (pp. 3-9).
Cited by
Sorted by citations
Items 501–600 of 1,004
Al-Haddad, L. A., & Jaber, A. A. (2023) · Journal of the Brazilian Society of Mechanical Sciences and Engineering · doi:10.1007/s40430-023-04386-5 · Cited by 51
“While they are typically thought of as feature subset selection approaches used prior to learning a model, they have been utilized successfully in various situations [40].”
Liu, Z.-D., Li, Y., Zhang, Y., Zeng, J., Chen, Z.-X., Liu, J., & Miao, F. (2024) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2024.3395445 · Cited by 52
Machine learning-assisted design of high-entropy alloys with superior mechanical properties
He, J., Li, Z., Zhao, P., Zhang, H., Zhang, F., Wang, L., & Cheng, X. (2024) · Journal of Materials Research and Technology · doi:10.1016/j.jmrt.2024.09.014 · Cited by 52
Research on CBR system based on data mining
Guo, Y., Hu, J., & Peng, Y. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2011.05.057 · Cited by 51
Behnam, M., & Pourghassem, H. (2016) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2016.04.014 · Cited by 51
Driving Maneuver Classification: A Comparison of Feature Extraction Methods
Xie, J., Hilal, A. R., & Kulić, D. (2017) · IEEE Sensors Journal · doi:10.1109/jsen.2017.2780089 · Cited by 51
“The statistical features are normalized to [−1,1] and reduced to three dimensions using the Relief algorithm [21].”
MethodFeature-Ensemble-Based Novelty Detection for Analyzing Plant Hyperspectral Datasets
AlSuwaidi, A., Grieve, B., & Yin, H. (2018) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2017.2788426 · Cited by 51
“[25], relief and its extension [23], [24], and sequential forward generation [59] are examples of feature selection algorithms.”
BackgroundSong, W., Wang, H., Maguire, P. D., & Nibouche, O. (2018) · Analytica Chimica Acta · doi:10.1016/j.aca.2018.01.023 · Cited by 51
“Therefore, ReliefF algorithm [41] is applied only on this dataset to remove 9/10 of the variables.”
MethodShahid, A. H., & Singh, M. P. (2019) · Journal of Applied Biomedicine · doi:10.1016/j.bbe.2019.05.010 · Cited by 51
Deep Fuzzy Neural Networks for Biomarker Selection for Accurate Cancer Detection
Mudiyanselage, T. B., Xiao, X., Zhang, Y., & Pan, Y. F. (2020) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2019.2958295 · Cited by 51
“other well-known feature selection methods for gene selection (Chi-square, f-score [20], t-score [21], and relief [22]).”
MethodSubject-Specific feature selection for near infrared spectroscopy based brain-computer interfaces
Aydın, E. A. (2020) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2020.105535 · Cited by 52
Ji, X., Yang, B., & Tang, Q. (2020) · IEEE Journal of Oceanic Engineering · doi:10.1109/joe.2020.2989853 · Cited by 52
“To remove uncorrelated and redundant image features, reduce the data dimension, and improve the efficiency of the classification algorithm, we use the ReliefF algorithm [45] to select the most accurate 8-D features from A.”
BackgroundMethodAn interactive filter-wrapper multi-objective evolutionary algorithm for feature selection
Liu, Z., Chang, B., & Cheng, F. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100925 · Cited by 51
Quilty, J., & Adamowski, J. (2021) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2021.105119 · Cited by 53
Phonemes based detection of parkinson’s disease for telehealth applications
Pah, N. D., Motin, M. A., & Kumar, D. (2022) · Scientific Reports · doi:10.1038/s41598-022-13865-z · Cited by 51
Algorithms for Drug Sensitivity Prediction
Niz, C. D., Rahman, R., Zhao, X., & Pal, R. (2016) · Algorithms · doi:10.3390/a9040077 · Cited by 50
“Feature selection using ReliefF [33] has been used to reduce the number of gene expression features from 18,988 to 200.”
BackgroundMethodA New Filter Feature Selection Based on Criteria Fusion for Gene Microarray Data
Ke, W., Wu, C., Wu, Y., & Xiong, N. N. (2018) · IEEE Access · doi:10.1109/access.2018.2873634 · Cited by 50
“To date, a large number of literatures on ranking-based feature selection methods have been proposed, such as gini index [32], information gain [33], Chi-square test [34], Fisher score [35], Laplacian score [36] and ReliefF [37], [38].”
BackgroundMethodDeep Belief Networks-based framework for malware detection in Android systems
Saif, D., El-Gokhy, S. M., & Sallam, E. A. (2018) · Alexandria Engineering Journal · doi:10.1016/j.aej.2018.10.008 · Cited by 50
Sleep staging algorithm based on multichannel data adding and multifeature screening
Huang, W. X., Guo, B., Shen, Y., Tang, X., Zhang, T., Li, D., & Jiang, Z. (2019) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2019.105253 · Cited by 51
Singha, M., Wu, B., & Zhang, M. (2016) · Sensors · doi:10.3390/s17010010 · Cited by 50
“The ReliefF algorithm estimates the quality of the features by ranking them according to the distances between the nearest instances, characteristics of data including the multiclass problems, incompleteness and noise [56].”
MethodTogo, R., Hirata, K., Manabe, O., Ohira, H., Tsujino, I., Magota, K., Ogawa, T., Haseyama, M., & Shiga, T. (2018) · SSRN Electronic Journal · doi:10.1016/j.compbiomed.2018.11.008 · Cited by 53
“Hence, we used the ReliefF feature selection algorithm [25] to address this problem.”
MethodSamat, A., Li, E., Du, P., et al. (2021) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2021.3063507 · Cited by 49
“FS (ReliefF) [77], correlation-based FS (CFS) [78], joint MI (JMI) [79], double input symmetrical relevance (DISR) [80], interaction capping (ICAP) [81], Gini index (GiniI) [82], Fisher”
MethodShuzan, M. N. I., Chowdhury, M. H., Chowdhury, M. E. H., Murugappan, M., Bhuiyan, E., Ayari, M. A., & Khandakar, A. A. (2023) · Bioengineering · doi:10.3390/bioengineering10020167 · Cited by 55
Ogaili, A. A. F., Hamzah, M. N., & Jaber, A. A. (2024) · Journal of Failure Analysis and Prevention · doi:10.1007/s11668-024-01894-x · Cited by 49
“As an extension of the original Relief algorithm for binary classification, ReliefF is a supervised, neighbor-based feature selection technique designed for multi-class problems, as noted by [64].”
Jahin, M. A., Shovon, M. S. H., Shin, J., Ridoy, I. A., & Mridha, M. F. (2024) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-024-10092-9 · Cited by 65
“Their proposal MFNN was 15.41% higher than the best result (Logistic Regression) of traditional ML models and 22.41% higher than the statistical approach (Linear Regression) in terms of returns.”
InfluentialAlmaraashi, M. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.02.029 · Cited by 49
Sakib, M. N., Chaspari, T., & Behzadan, A. H. (2020) · Journal of Computing in Civil Engineering · doi:10.1061/(asce)cp.1943-5487.0000941 · Cited by 49
Hsu, C., Chen, X., Lin, W., Jiang, C., Zhang, Y., Hao, Z., & Chung, Y. (2021) · Measurement · doi:10.1016/j.measurement.2021.109145 · Cited by 49
“Alongside the proposed algorithm, the datasets were tested against a few existing feature selection methods such as ReliefF, Recursive Feature Elimination (RFE), and Cuckoo search optimization (CSO) algorithm [54-56].”
MethodSingh, H., Sharma, V., & Singh, D. (2022) · Visual Computing for Industry Biomedicine and Art · doi:10.1186/s42492-021-00100-1 · Cited by 49
“The details of the Relief-F feature selection algorithm can be found in publications [44 – 46].”
MethodmatRadiomics: A Novel and Complete Radiomics Framework, from Image Visualization to Predictive Model
Pasini, G., Bini, F., Russo, G. I., Comelli, A., Marinozzi, F., & Stefano, A. (2022) · Journal of Imaging · doi:10.3390/jimaging8080221 · Cited by 48
“These are the t-test [20], and the Relieff algorithms [21] (see Figure 3).”
MethodGoldman, C. V., Baltaxe, M., Chakraborty, D., Arinez, J. F., & Escobar, C. A. (2023) · Journal of Industrial Information Integration · doi:10.1016/j.jii.2023.100439 · Cited by 48
Data mining for feature selection in gene expression autism data
Latkowski, T., & Osowski, S. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.08.043 · Cited by 48
“The ReliefF algorithm ranks the features according to its the highest correlation with the observed class while taking into account the distances between opposite classes (Robnik-Sikonja & Kononenko, 2003).”
BackgroundMethodFeature selection algorithm for mixed data with both nominal and continuous features
Tang, W. H. S., & Mao, K. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2006.10.008 · Cited by 48
A comparative evaluation of filter-based feature selection methods for hyper-spectral band selection
Wu, B., Chen, C., Kechadi, T., & Sun, L. (2013) · International Journal of Remote Sensing · doi:10.1080/01431161.2013.827815 · Cited by 48
A hybrid-multi filter-wrapper framework to identify run-time behaviour for fast malware detection
Huda, S., Islam, R., Abawajy, J., Yearwood, J. L., Hassan, M. M., & Fortino, G. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2017.12.037 · Cited by 48
Optimised deep learning features for improved melanoma detection
Majtner, T., Yayilgan, S. Y., & Hardeberg, J. Y. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6734-6 · Cited by 49
“This table compares the proposed method with other algorithms traditionally used for this task, namely principal component analysis (PCA) [20] and ReliefF [38].”
MethodRibeiro, M., Neves, L. A., do Nascimento, M. Z., Roberto, G. F., Martins, A. S., & Tosta, T. A. A. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.11.034 · Cited by 49
Damage detection of a cable-stayed bridge using feature extraction and selection methods
Bisheh, H. B., Amiri, G. G., Nekooei, M., & Darvishan, E. (2019) · Structure and Infrastructure Engineering · doi:10.1080/15732479.2019.1599964 · Cited by 48
An artificial neural network model for predicting the performance of thermoacoustic refrigerators
Alamir, M. A. (2020) · International Journal of Heat and Mass Transfer · doi:10.1016/j.ijheatmasstransfer.2020.120551 · Cited by 48
Empirical evaluation of feature selection methods in classification
Zajc, L. Č., & Bosnić, Z. (2010) · Intelligent Data Analysis · doi:10.3233/ida-2010-0421 · Cited by 48
“…set of binary features: each discrete feature A with the set of values {v0, v1 . . . , vn} was transformed to n numerical binary features A1, . . . , An, where Ai = 1 (and Aj = 0 for j = 1, . . . , n; j = i) denotes that the value of the original feature was A = vi (Ai = 0 for i = 1, . . . , n…”
BackgroundForecasting market prices in a supply chain game
Kiekintveld, C. D., Miller, J. W., Jordan, P. R., Callender, L. F., & Wellman, M. P. (2008) · Electronic Commerce Research and Applications · doi:10.1016/j.elerap.2008.11.005 · Cited by 48
Sharma, H., Drukker, L., Chatelain, P., Droste, R., Papageorghiou, A. T., & Noble, J. A. (2021) · Medical Image Analysis · doi:10.1016/j.media.2021.101973 · Cited by 48
Multi-modality of polysomnography signals’ fusion for automatic sleep scoring
Yan, R., Zhang, C., Spruyt, K., Wei, L., Wang, Z., Tian, L., Li, X., Ristaniemi, T., Zhang, J., & Cong, F. (2019) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2018.10.001 · Cited by 49
Luo, S., Jiang, X., He, Y., et al. (2022) · Frontiers in Plant Science · doi:10.3389/fpls.2022.948249 · Cited by 47
“RReliefF algorithm RReliefF algorithm is a feature selection method based on statistical correlation (Robnik-Sikonja and Kononenko, 2003).”
MethodData Readiness for AI: A 360-Degree Survey
Hiniduma, K., Byna, S., & Bez, J. L. (2025) · ACM Computing Surveys · doi:10.1145/3722214 · Cited by 56
“Disguised values can lead to biased outcomes, reduced accuracy, and misinterpretation of AI models.”
Towards statistical modeling and machine learning based energy usage forecasting in smart grid
Yu, W., An, D., GRIFFITH, D. W. T., Yang, Q., & Xu, G. (2015) · ACM SIGAPP Applied Computing Review · doi:10.1145/2753060.2753061 · Cited by 46
“The relieff [30] algorithm was used to determine the importance of features.”
MethodThe effect of combining two echo times in automatic brain tumor classification by MRS
Garcia-Gomez, J. M., Tortajada, S., Vidal, C., et al. (2008) · NMR in Biomedicine · doi:10.1002/nbm.1288 · Cited by 47
Hybridizing relieff, mRMR filters and GA wrapper approaches for gene selection
Shreem, S. S., Abdullah, S., Nazri, M. Z. A., et al. (2012) · Cited by 47
Bandini, A., Green, J. R., Wang, J., Campbell, T. F., Zinman, L. H., & Yunusova, Y. (2018) · Journal of Speech Language and Hearing Research · doi:10.1044/2018_jslhr-s-17-0262 · Cited by 48
“…available and accepted algorithms for feature selection: (a) mutual information (Zaffalon & Hutter, 2002), (b) Fisher criterion (Gu, Li, & Han, 2011), (c) Relief-F algorithm (Robnik-Šikonja & Kononenko, 2003), and (d) minimal redundancy maximal relevance (mRMR) criterion (Peng, Long, & Ding, 2005).”
MethodA novel random multi-subspace based ReliefF for feature selection
Zhang, B., Li, Y., & Chai, Z. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.109400 · Cited by 47
Chen, S.-J., Yu, S., Tzeng, J.-E., et al. (2008) · Ultrasound in Medicine & Biology · doi:10.1016/j.ultrasmedbio.2008.08.017 · Cited by 47
“To estimate the relevance and weight to the classification among the 34 textural features, ReliefF was used as a feature selection method (Robnik-Šikonja and Kononenko 2003) (see Appendix A).”
MethodLocal Kernel Regression Score for Selecting Features of High-Dimensional Data
Cheung, Y., & Zeng, H. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.23 · Cited by 47
“, (2)-test, Fisher score, ReliefF [8], and so forth, but the unsupervised counterparts become more challenging because of no true class labels available in the feature selection.”
BackgroundMethodInfluentialA Survey on EEG-Based Solutions for Emotion Recognition With a Low Number of Channels
Apicella, A., Arpaïa, P., Isgrò, F., Mastrati, G., & Moccaldi, N. (2022) · IEEE Access · doi:10.1109/access.2022.3219844 · Cited by 48
“In [149], ReliefF, a popular filter feature selection method built on top of Relief, is proposed.”
MethodTowards multi-objective high-dimensional feature selection via evolutionary multitasking
Feng, Y., Feng, L., Liu, S., Kwong, S., & Tan, K. C. (2024) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2024.101618 · Cited by 50
Band selection in hyperspectral imagery using spatial cluster mean and genetic algorithms
Paul, A., Bhattacharya, S., Dutta, D., et al. (2015) · GIScience & Remote Sensing · doi:10.1080/15481603.2015.1075180 · Cited by 46
“The first compared method is ReliefF (Robnik-Š ikonja and Kononenko 2003), a supervised feature estimation method, and the second one is WaLuDi (Martinez-Uso et al. 2007), an unsupervised clustering-based method.”
MethodComplement information entropy for uncertainty measure in fuzzy rough set and its applications
Zhao, J., Zhang, Z.-L., Han, C., et al. (2014) · Soft Computing · doi:10.1007/s00500-014-1387-5 · Cited by 46
Feature selection using data envelopment analysis
Zhang, Y., Yang, A., Xiong, C., et al. (2014) · Knowledge-Based Systems · doi:10.1016/j.knosys.2014.03.022 · Cited by 46
Learning to recognize webpage genres
Kanaris, I., & Stamatatos, E. (2009) · Information Processing & Management · doi:10.1016/j.ipm.2009.05.003 · Cited by 46
“Then, the ReliefF algorithm for feature selection (Robnik-Sikonja & Kononenko, 2003) is applied to the produced dataset to reduce the dimensionality.”
MethodA New Feature Selection Approach to Naive Bayes Text Classifiers
Zhang, L., Jiang, L., & Li, C. (2015) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001416500038 · Cited by 46
A New Approach for Feature Selection from Microarray Data Based on Mutual Information
Tang, J., & Zhou, S. (2016) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2016.2515582 · Cited by 46
An Intrusion Detection System Based on Machine Learning for CAN-Bus
Tian, D., Li, Y., Wang, Y., et al. (2018) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-319-74176-5_25 · Cited by 46
Histogram-Based Features Selection and Volume of Interest Ranking for Brain PET Image Classification
Garali, I., Adel, M., Bourennane, S., & Guedj, É. (2018) · IEEE Journal of Translational Engineering in Health and Medicine · doi:10.1109/jtehm.2018.2796600 · Cited by 48
“In order to validate the effectiveness of the proposed method, we performed experiments using a comparison with the state-of-art of Feature Selection methods (FS) including Student’s t-Test analysis [39], Fisher score [86], [87], Support vectorMachine feature elimination (SVM-RFE) [88], feature selection with Random F…”
MethodLohrmann, C., Luukka, P., Jabłońska-Sabuka, M., & Kauranne, T. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.06.002 · Cited by 46
Low-rank matrix regression for image feature extraction and feature selection
Yuan, H., Li, J., Lai, L. L., et al. (2020) · Information Sciences · doi:10.1016/j.ins.2020.02.070 · Cited by 46
Symbolic Modeling of Epistasis
Moore, J. H., Barney, N., Tsai, C., Chiang, F., Gui, J., & White, B. C. (2007) · Human Heredity · doi:10.1159/000099184 · Cited by 46
Benefits and barriers of user evaluation in software engineering research
Buse, R. P. L., Sadowski, C., & Weimer, W. R. (2011) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2048066.2048117 · Cited by 46
“Theoretical and em- Sikonja and I. Kononenko. pirical analysis of ReliefF and RReliefF.”
MethodInfluentialRecognizing induced emotions of movie audiences: Are induced and perceived emotions the same?
Tian, L., Muszyński, M., Lai, C., Moore, J. D., Κωστούλας, Θ., Lombardo, P., Pun, T., & Chanel, G. (2017) · International Conference on Affective Computing and Intelligent Interaction and workshops · doi:10.1109/acii.2017.8273575 · Cited by 45
“To reduce feature dimensionality, we apply the ReliefF algorithm [42] and rank the individual effectiveness of features by performing regression with 20 nearest neighbours.”
MethodIteratively local fisher score for feature selection
Gan, M., & Zhang, L. (2021) · Applied Intelligence · doi:10.1007/s10489-020-02141-0 · Cited by 45
Evolutionary Multitasking Descriptor Optimization for Point Cloud Registration
Wu, Y., Sheng, J., Ding, H., Gong, P., Li, H., Gong, M., Ma, W., & Miao, Q. (2024) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2024.3417416 · Cited by 45
Fractal-Based Intrinsic Dimension Estimation and Its Application in Dimensionality Reduction
Mo, D., & Huang, S. H. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.225 · Cited by 45
“Many ranking criteria for supervised feature selection have been proposed, for instance, mutual information [32], information gain [44], Gini index [31], distance measure [29], j-measure [39], Relief algorithm and its extensions [35], MDL [22], 2 statistic [12], and G statistic [7].”
BackgroundBearing Fault Diagnosis Using Feature Ranking Methods and Fault Identification Algorithms
Vakharia, V., Gupta, V. K., & Kankar, P. K. (2016) · Procedia Engineering · doi:10.1016/j.proeng.2016.05.142 · Cited by 45
Bridging Feature Selection and Extraction: Compound Feature Generation
Sreevani, & Murthy, C. A. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2619712 · Cited by 46
“According to Knn (K=1) classifier, SMPeMR3 obtains 6.9, 11.0, 4.5, 19.0, 6.1, 13.0 percent average improvements in comparison with feature selection methods Fisher, ReliefF, DISR, SPEC, TR and MRSF respectively, and with feature extraction methods LDA, MMC, ALDE, MFA, QMI and SLDA, it obtains 5.8, 2.2, 1.2, 10.0, 10.7…”
BackgroundInfluentialGranger Causality Driven AHP for Feature Weighted kNN
Bhattacharya, G., Ghosh, K., & Chowdhury, A. S. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.01.018 · Cited by 45
“RELIEFF [23], the extended version of RELIEF [22] is robust and efficient to deal with incomplete and noisy data [34].”
BackgroundContext-aware obstacle detection for navigation by visually impaired
Gharani, P., & Karimi, H. A. (2017) · Image and Vision Computing · doi:10.1016/j.imavis.2017.06.002 · Cited by 45
“Generally, feature selection algorithms may use measurement of the various characteristics of the training data such as distance, consistency, dependency, information, and correlation (Kira and Rendell, 1992; Robnik-Siknja and Kononeko, 2003; Tang et al., 2014).”
BackgroundMethodChowdhury, A. S., Call, D. R., & Broschat, S. L. (2019) · Scientific Reports · doi:10.1038/s41598-019-50686-z · Cited by 46
“For RReliefF, we considered 5 neighbors and 30 instances as suggested in a previous study 35 .”
MethodHuang, N., Wang, W., Wang, S., et al. (2020) · IEEE Access · doi:10.1109/access.2020.2971033 · Cited by 45
“The function diff( ) [31] is used for calculating the distance between instances to find the nearest neighbors.”
MethodGharehbaghi, V., Nguyễn, A., Farsangi, E. N., & Yang, T. Y. (2020) · Journal of Building Engineering · doi:10.1016/j.jobe.2020.101292 · Cited by 45
Sharifai, A. G., & Zainol, Z. B. (2020) · Genes · doi:10.3390/genes11070717 · Cited by 45
Supervised feature selection through Deep Neural Networks with pairwise connected structure
Huang, Y., Jin, W., Yu, Z., & Li, B. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.106202 · Cited by 45
Feature selection for high-dimensional data in astronomy
Zheng, H., & Zhang, Y. (2007) · Advances in Space Research · doi:10.1016/j.asr.2007.08.033 · Cited by 45
Driver drowsiness detection in video sequences using hybrid selection of deep features
Bekhouche, S. E., Ruichek, Y., & Dornaika, F. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.109436 · Cited by 44
Mean based relief: An improved feature selection method based on ReliefF
Aggarwal, N., Shukla, U., Saxena, G. J., Rawat, M., Bafila, A. S., Singh, S., & Pundir, A. (2023) · Applied Intelligence · doi:10.1007/s10489-023-04662-w · Cited by 51
“ReliefF variant named RReliefF [24], formulated for regression problems, uses relative distances between the predicted values of pairs of instances and is computationally more expensive than ReliefF.”
MethodA novel caps-EEGNet combined with channel selection for EEG-based emotion recognition
Chen, K., Jing, H., Liu, Q., Ai, Q., & Ma, L. (2023) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2023.105312 · Cited by 45
Feature subset selection with cumulate conditional mutual information minimization
Zhang, Y., & Zhang, Z. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.12.003 · Cited by 44
“In addition, for each of the three classifiers, best results are achieved by applying 1NN, which show that CCM wins in eight cases and only losses in one case in comparison with both CFS and FCBF, and wins in seven cases and losses in two cases in comparison with ReliefF.”
MethodInfluentialScalable Feature Selection via Distributed Diversity Maximization
Zadeh, S. A., Ghadiri, M., Mirrokni, V., et al. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10926 · Cited by 44
“…(Nguyen et al. 2014), Quadratic Programming Feature Selection (QPFS) (Rodriguez-Lujan et al. 2010), and Conditional Mutual Information (CMI)(Cheng et al. 2008) as baselines as well as non MI-based methods, fisher score (Duda, Hart, and Stork 2001) and reliefF (Robnik-Šikonja and Kononenko 2003).”
MethodMultiple features extraction and selection for detection and classification of stator winding faults
Haroun, S., Seghir, A. N., & Touati, S. (2017) · IET Electric Power Applications · doi:10.1049/iet-epa.2017.0457 · Cited by 44
Murthy, Y. V. S., & Koolagudi, S. G. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.04.005 · Cited by 44
Machine learning technology in the application of genome analysis: A systematic review
Wu, J., & Zhao, Y. (2019) · Gene · doi:10.1016/j.gene.2019.04.062 · Cited by 47
Naik, D. L., Sajid, H. U., & Kiran, R. (2019) · Metals · doi:10.3390/met9050546 · Cited by 44
“A more detailed description of the algorithm can be found elsewhere [44,46].”
BackgroundMethodRobust Flexible Feature Selection via Exclusive L21 Regularization
Ming, D., & Ding, C. H. Q. (2019) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/438 · Cited by 45
Khan, A. H., Eker, A., Chefranov, A. G., & Demirel, H. (2021) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2021.102932 · Cited by 45
Setsirichok, D., Piroonratana, T., Wongseree, W., et al. (2011) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2011.03.007 · Cited by 44
Multi-test decision tree and its application to microarray data classification
Czajkowski, M., Grześ, M., & Krętowski, M. (2014) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2014.01.005 · Cited by 45
Manipulating Data and Dimension Reduction Methods: Feature Selection
Liu, H., & Zhao, Z. (2009) · Encyclopedia of Complexity and Systems Science · doi:10.1007/978-0-387-30440-3_317 · Cited by 44
Malware Dataset Generation and Evaluation
Borah, P., Bhattacharyya, D., & Kalita, J. K. (2020) · doi:10.1109/cict51604.2020.9312053 · Cited by 43
“The ranks are calculated using three feature selectors [7] [8] [9].”
MethodGong, D., Gao, Y., Kou, Y., & Wang, Y. (2022) · Journal of Energy Storage · doi:10.1016/j.est.2022.104376 · Cited by 44
Niu, T., Li, J., Wei, W., et al. (2022) · Applied Energy · doi:10.1016/j.apenergy.2022.119964 · Cited by 43
Greene, C. S., Himmelstein, D., Kiralis, J., & Moore, J. H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12211-8_16 · Cited by 43
“In 2003 Robnik-Sikonja and Kononenko [27] performed a comprehensive analysis and determined that ten neighbors was an appropriate number for ReliefF, so we use ten neighbors here.”
BackgroundMethodPivard, S., Demšar, D., Lecomte, J., et al. (2008) · Ecological Modelling · doi:10.1016/j.ecolmodel.2007.10.012 · Cited by 43
Mapping microarray gene expression data into dissimilarity spaces for tumor classification
García, V., & Sánchez, J. S. (2014) · Information Sciences · doi:10.1016/j.ins.2014.09.064 · Cited by 43
“Gene selection with ReliefF ReliefF is an improved version of the Relief procedure to estimate the quality of features in problems with strong dependencies between features [18,33].”
Method
Metadata
- Authors
- Robnik-Šikonja, M., & Kononenko, I.
- Affiliations
- University of Ljubljana (SI)
- ORCID
- Kononenko, Igor
- Venue
- Machine Learning
- Published
- 2003-10
- Volume
- 53
- Issue
- 1-2
- Pages
- 23-69
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1500895378
- Semantic Scholar
- d398ad942320c1c2cf64da23ba519870f9f1d67d
- Cited by
- 3,025
- References
- 45
- Citations by year
- 2026: 125 · 2025: 186 · 2024: 192 · 2023: 209 · 2022: 223 · 2021: 246 · 2020: 237 · 2019: 212 · 2018: 216 · 2017: 150 · 2016: 158 · 2015: 166 · 2014: 143 · 2013: 91 · 2012: 105
- FWCI
- 44.71
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Machine Learning (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Rough Sets and Fuzzy Logic
- Keywords
- Relief algorithm, RReliefF, feature selection, feature weighting, decision tree splitting, inductive logic programming, noise robustness, scalability, data sampling
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