Improving the performance of 1D object classification by using the Electoral College

摘要

It has been proven that districted matching schemes (e.g., the US presidential election scheme, also called the Electoral College) are more stable than undistricted matching schemes (e.g., the popular voting scheme for selecting a governor in California), and that the theory can be used in pattern classification applications, such as image classification, where by its nature an object to be classified consists of elements distributed in a bounded 2D space. However, the objects of some pattern classification applications consist of features/values of elements lying on a limited 1D line segment. This paper will prove that districted matching scheme can still outperform undistricted matching scheme in these applications, and the improved performance of districted vote scheme is even more substantial for these 1D objects than for 2D objects. The theoretical result suggests the use of districted matching schemes for pattern recognition of 1D objects. We verified the theoretical analysis through artificial neural network-based approaches for the prediction of start codons of nucleotide sequences.