Investigation Open Access

A Conceptualization of Distributed Computation for Machine Learning: The Voting Algorithm

Talal Talib Jameel1
  • 1 Al Yarmouk University College, Iraq

Abstract

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.

American Journal of Engineering and Applied Sciences
Volume 10 No. 1, 2017, 151-155

DOI: https://doi.org/10.3844/ajeassp.2017.151.155

Submitted On: 22 December 2016 Published On: 2 March 2017

How to Cite: Jameel, T. T. (2017). A Conceptualization of Distributed Computation for Machine Learning: The Voting Algorithm. American Journal of Engineering and Applied Sciences, 10(1), 151-155. https://doi.org/10.3844/ajeassp.2017.151.155

  • 3,248 Views
  • 1,736 Downloads
  • 0 Citations

Download

Keywords

  • Machine Learning
  • Cordorcet Method
  • Voting Algorithms
  • Clustering