Abstract

When there are numerous possible solutions for a given class in a given problem, majority voting or plurality voting is typically employed. One common technique for improving classification accuracy is bagging, which involves training many classifiers on slightly different datasets and then voting on the combined results. In this research, we examine how alternative voting procedures affect the efficiency of two distinct classification algorithms applied to datasets of varying complexity. Despite the increased computing cost associated with determining preference order, the results show that the single transferable vote can be a suitable alternative to plurality voting.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.