Voting with Random Classifiers (VORACE): Theoretical and Experimental Analysis
Not on the map. Why?
Abstract (arXiv)
In many machine learning scenarios, looking for the best classifier that fits a particular dataset can be very costly in terms of time and resources. Moreover, it can require deep knowledge of the specific domain. We propose a new technique which does not require profound expertise in the domain and avoids the commonly used strategy of hyper-parameter tuning and model selection. Our method is an innovative ensemble technique that uses voting rules over a set of randomly-generated classifiers. Given a new input sample, we interpret the output of each classifier as a ranking over the set of possible classes. We then aggregate these output rankings using a voting rule, which treats them as preferences over the classes. We show that our approach obtains good results compared to the state-of-the-art, both providing a theoretical analysis and an empirical evaluation of the approach on several datasets.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 2.
5 papers.
- 2022When Is It Acceptable to Break the Rules? Knowledge Representation of Moral Judgement Based on Empirical Datacited by 5
- 2021Deep ensembles in bioimage segmentationcited by 1
- 2021SenTag: a Web-based Tool for Semantic Annotation of Textual Documentscited by 0
- 2024Liquid Democracy for Low-Cost Ensemble Pruningcited by 0
- 2024Liquid Ensemble Selection for Continual Learningcited by 0
- 2024Liquid Ensemble Selection for Continual Learning12 May 2024
- 2024Liquid Democracy for Low-Cost Ensemble Pruning30 Jan 2024
- 2022When Is It Acceptable to Break the Rules? Knowledge Representation of Moral Judgement Based on Empirical Data19 Jan 2022
- 2021Deep ensembles in bioimage segmentation24 Dec 2021
- 2021SenTag: a Web-based Tool for Semantic Annotation of Textual Documents16 Sep 2021