A Conceptualization of Distributed Computation for Machine Learning: The Voting Algorithm
Talal Talib Jameel
DOI : 10.3844/ajeassp.2017.151.155
American Journal of Engineering and Applied Sciences
Volume 10, Issue 1
This paper describes a voting algorithm that can be used to find the most optimal solution to clustering problems in machine learning. As part of the family of algorithms known as Condorcet methods, the voting algorithm is used to choose a particular candidate, even in the absence of a definitive majority. The algorithm proceeds in two steps: Renormalization and reconciliation. In the renormalization step all probability measure are reset so that the ensemble probability is always unity. In the reconciliation step a best choice is made based on the renormalized data. The result showed an excellent performance due to the use of linear time computations.
© 2017 Talal Talib Jameel. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.