The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Diversity in search strategies for ensemble feature selection
Open accessAbstract
Ensembles of learnt models constitute one of the main current directions in machine learning and data mining. Ensembles allow us to achieve higher accuracy, which is often not achievable with single models. It was shown theoretically and experimentally that in order for an ensemble to be effective, it should consist of base classifiers that have diversity in their predictions. One technique, which proved to be effective for constructing an ensemble of diverse base classifiers, is the use of different feature subsets, or so-called ensemble feature selection. Many ensemble feature selection strategies incorporate diversity as an objective in the search for the best collection of feature subsets. A number of ways are known to quantify diversity in ensembles of classifiers, and little research has been done about their appropriateness to ensemble feature selection. In this paper, we compare five measures of diversity with regard to their possible use in ensemble feature selection. We conduct experiments on 21 data sets from the UCI machine learning repository, comparing the ensemble accuracy and other characteristics for the ensembles built with ensemble feature selection based on the considered measures of diversity. We consider four search strategies for ensemble feature selection together with the simple random subspacing: genetic search, hill-climbing, and ensemble forward and backward sequential selection. In the experiments, we show that, in some cases, the ensemble feature selection process can be sensitive to the choice of the diversity measure, and that the question of the superiority of a particular measure depends on the context of the use of diversity and on the data being processed. In many cases and on average, the plain disagreement measure is the best. Genetic search, kappa, and dynamic voting with selection form the best combination of a search strategy, diversity measure and integration method.
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
A Coefficient of Agreement for Nominal Scales
Cohen, J. (1960) · Educational and Psychological Measurement · doi:10.1177/001316446002000104 · Cited by 42,398
The random subspace method for constructing decision forests
Ho, T. K. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.709601 · Cited by 6,842
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Dietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
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
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
Measures of Diversity in Classifier Ensembles and Their Relationship with the Ensemble Accuracy
Kuncheva, L. I., & Whitaker, C. J. (2003) · Machine Learning · doi:10.1023/a:1022859003006 · Cited by 2,335
Comparison of algorithms that select features for pattern classifiers
Kudo, M., & Sklansky, J. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00041-2 · Cited by 905
Margineantu, D. D., & Dietterich, T. G. (1997) · Cited by 553
On Combining Artificial Neural Nets
SHARKEY, A. J. C. (1996) · Connection Science · doi:10.1080/095400996116785 · Cited by 513
Selecting a classification method by cross-validation
Schaffer, C. (1993) · Machine Learning · doi:10.1007/bf00993106 · Cited by 442
Wrappers for Performance Enhancements and Oblivious Decision Graphs.
Kohavi, R. (1995) · Cited by 248
Designing classifier fusion systems by genetic algorithms
Jain, L. C., & Kuncheva, L. I. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.887233 · Cited by 241
Diversity versus Quality in Classification Ensembles Based on Feature Selection
Cunningham, P., & Carney, J. G. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45164-1_12 · Cited by 219
Self-citationOverfitting in making comparisons between variable selection methods
ReunanenJuha (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944978 · Cited by 205
Zenobi, G., & Cunningham, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44795-4_49 · Cited by 183
Self-citationEnsemble feature selection with the simple Bayesian classification
Tsymbal, A., Puuronen, S., & Patterson, D. W. (2003) · Information Fusion · doi:10.1016/s1566-2535(03)00004-6 · Cited by 161
Self-citationOliveira, L. S., Sabourin, R., Bortolozzi, F., & Suen, C. Y. (2003) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s021800140300271x · Cited by 157
Data mining using /spl Mscr/ℒ/spl Cscr/++ a machine learning library in C++
Kohavi, R., Sommerfield, D. A., & Dougherty, J. (2005) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/tai.1996.560457 · Cited by 146
Methods for dynamic classifier selection
Giacinto, G., & Roli, F. (2003) · International Conference on Image Analysis and Processing · doi:10.1109/iciap.1999.797670 · Cited by 104
A New Ensemble Diversity Measure Applied to Thinning Ensembles
Banfield, R. E., Hall, L., Bowyer, K. W., & Kegelmeyer, W. P. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44938-8_31 · Cited by 86
Reliability Parameters to Improve Combination Strategies in Multi-Expert Systems
Cordella, L. P., Foggia, P., Sansone, C., Tortorella, F., & Vento, M. (1999) · Pattern Analysis and Applications · doi:10.1007/s100440050029 · Cited by 86
A dynamic integration algorithm for an ensemble of classifiers
Puuronen, S. J., Terziyan, V. Y., & Tsymbal, A. (1999) · Lecture notes in computer science · doi:10.1007/bfb0095148 · Cited by 59
Self-citationGenetic algorithm for feature selection for parallel classifiers
Kuncheva, L. I. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90021-z · Cited by 36
Dimensionality Reduction Through Classifier Ensembles
Oza, N. C., Tumer, K., & Norwig, P. (1999) · NASA Technical Reports Server (NASA) · Cited by 33
From Ensemble Methods to Comprehensible Models
Ferri, C., Hernández‐Orallo, J., & Ramírez-Quintana, M. J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36182-0_16 · Cited by 29
Cited by
Survey on speech emotion recognition: Features, classification schemes, and databases
El Ayadi, M., Kamel, M. S., & Karray, F. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.020 · Cited by 2,073
Ensembles for feature selection: A review and future trends
Bolón-Canedo, V., & Alonso-Betanzos, A. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.008 · Cited by 541
A Review of Ensemble Methods in Bioinformatics
Yang, P., Hwa Yang, Y., B. Zhou, B., & Y. Zomaya, A. (2010) · Current Bioinformatics · doi:10.2174/157489310794072508 · Cited by 503
Series in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
An Analysis of Ensemble Pruning Techniques Based on Ordered Aggregation
Martinez-Munoz, G., Hernandez-Lobato, D., & Suarez, A. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.78 · Cited by 315
Metadata
- Authors
- Tsymbal, A., Pechenizkiy, M., & Cunningham, P.
- Venue
- Information Fusion
- Publisher
- Elsevier BV
- Published
- 2005-03
- Volume
- 6
- Issue
- 1
- Pages
- 83-98
- ISSN
- 1566-2535 (ISSN-L)
- OpenAlex
- W1992018127
- Cited by
- 321
- References
- 26
- FWCI
- 13.90
- Type
- journal article
- Language
- en
- Open access
- green
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.