The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Iterative RELIEF for Feature Weighting: Algorithms, Theories, and Applications
Abstract
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform significantly better than RELIEF, without introducing a large increase in computational complexity. Our work starts from a mathematical interpretation of the seemingly heuristic RELIEF algorithm as an online method solving a convex optimization problem with a margin-based objective function. This interpretation explains the success of RELIEF in real application and enables us to identify and address its following weaknesses. RELIEF makes an implicit assumption that the nearest neighbors found in the original feature space are the ones in the weighted space and RELIEF lacks a mechanism to deal with outlier data. We propose an iterative RELIEF (I-RELIEF) algorithm to alleviate the deficiencies of RELIEF by exploring the framework of the Expectation-Maximization algorithm. We extend I-RELIEF to multiclass settings by using a new multiclass margin definition. To reduce computational costs, an online learning algorithm is also developed. Convergence analysis of the proposed algorithms is presented. The results of large-scale experiments on the UCI and microarray data sets are reported, which demonstrate the effectiveness of the proposed algorithms, and verify the presented theoretical results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
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
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Chiang, L. H., Russell, E. L., & Braatz, R. D. (2001) · Advanced Textbooks in Control and Signal Processing · doi:10.1007/978-1-4471-0347-9_3 · Cited by 5,003
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753616 · Cited by 3,502
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
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 2,958
Solving Multiclass Learning Problems via Error-Correcting Output Codes
Dietterich, T. G., & Bakiri, G. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.105 · Cited by 2,739
Khan, J., Wei, J. S., Ringnér, M., Saal, L. H., Ladanyi, M., Westermann, F., Berthold, F., Schwab, M., Antonescu, C. R., Peterson, C., et al. (2001) · Nature Medicine · doi:10.1038/89044 · Cited by 2,644
Gene 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
Shipp, M. A., Ross, K. N., Tamayo, P., Weng, A. P., Kutok, J. L., Aguiar, R. C. T., Gaasenbeek, M., Angelo, M., Reich, M., Pinkus, G. S., et al. (2002) · Nature Medicine · doi:10.1038/nm0102-68 · Cited by 2,428
Feature 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
Multiclass cancer diagnosis using tumor gene expression signatures
Ramaswamy, S., Tamayo, P., Rifkin, R., Mukherjee, S., Yeang, C.-H., Angelo, M., Ladd, C., Reich, M., Latulippe, E., Mesirov, J. P., et al. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.211566398 · Cited by 2,023
Stochastic Approximation and Recursive Algorithms and Applications
(2003) · Stochastic Modelling and Applied Probability · doi:10.1007/b97441 · Cited by 1,838
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006559212014 · Cited by 1,671
Weston, J., Mukherjee, S., Chapelle, O., Pontil, M., Poggio, T., & Vapnik, V. N. (2000) · Cited by 988
Nutt, C. L., Mani, D. R., Betensky, R. A., Tamayo, P., Cairncross, J. G., Ladd, C., Pohl, U., Hartmann, C. J., McLaughlin, M. E., Batchelor, T. T., et al. (2003) · PubMed · Cited by 959
An Introduction to Optimization
Chong, E. K. P., & Zak, S. H. (1996) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.1996.500234 · Cited by 875
Wettschereck, D., Aha, D. W., & Mohri, T. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006593614256 · Cited by 717
Chemosensitivity prediction by transcriptional profiling
Staunton, J. E., Slonim, D. K., Coller, H. A., Tamayo, P., Angelo, M. J., Park, J., Scherf, U., Lee, J. K., Reinhold, W. O., Weinstein, J. N., et al. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.191368598 · Cited by 684
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5348 · Cited by 677
Margin based feature selection - theory and algorithms
Gilad-Bachrach, R., Navot, A., & Tishby, N. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015352 · Cited by 414
Linear Programming Boosting via Column Generation
Demiriz, A., Bennett, K. P., & Shawe-Taylor, J. (2002) · Machine Learning · doi:10.1023/a:1012470815092 · Cited by 413
On-line EM Algorithm for the Normalized Gaussian Network
Sato, M.-A., & Ishii, S. (2000) · Neural Computation · doi:10.1162/089976600300015853 · Cited by 276
Kreß, R., & Kreß, R. (1998) · Cited by 273
Kress, R. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0599-9 · Cited by 233
Margin Analysis of the LVQ Algorithm
Crammer, K., Gilad-Bachrach, R., Navot, A., & Tishby, N. (2002) · Cited by 212
Improved breast cancer prognosis through the combination of clinical and genetic markers
Sun, Y., Goodison, S., Li, J., Liu, L., & Farmerie, W. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl543 · Cited by 188
Self-citationA protocol for building and evaluating predictors of disease state based on microarray data
Wessels, L. F. A., Reinders, M. J. T., Hart, A. A. M., Veenman, C. J., Dai, H., He, Y. D., & Veer, L. V. ‘. (2005) · Computer applications in the biosciences · doi:10.1093/bioinformatics/bti429 · Cited by 144
Iterative RELIEF for feature weighting
Sun, Y., & Li, J. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143959 · Cited by 134
Self-citationGene-expression profiling in breast cancer
Jenssen, T.-K., & Hovig, E. J. (2005) · The Lancet · doi:10.1016/s0140-6736(05)70911-9 · Cited by 40
Cited by
Investigating the impact of data normalization on classification performance
Singh, D., & Singh, B. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2019.105524 · Cited by 1,726
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 on synthetic data
Bolón-Canedo, V., Sánchez-Maroño, N., & Alonso-Betanzos, A. (2013) · Knowledge and Information Systems · doi:10.1007/s10115-012-0487-8 · Cited by 830
Neighborhood Component Feature Selection for High-Dimensional Data
Yang, W., Wang, K., & Zuo, W. (2012) · Journal of Computers · doi:10.4304/jcp.7.1.161-168 · Cited by 540
Moradi, P., & Gholampour, M. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.01.044 · Cited by 372
Metadata
- Authors
- Sun, Y.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2007-06
- Volume
- 29
- Issue
- 6
- Pages
- 1035-1051
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2107014760
- Cited by
- 342
- References
- 38
- FWCI
- 24.03
- 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.