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.
KeywordsDistricted voting Undistricted voting Start codon Stability
Unable to display preview. Download preview PDF.
- 5.Kohonen T (1997) Self-organizing maps, In: Series in information sciences, vol. 30, 2nd edn. Springer, HeidelbergGoogle Scholar
- 6.Langley P, Iba W, Thompson K (1996) Machine leaning in prognosis of the femoral neck fracture recovery. Artif Intell Med 431–451Google Scholar
- 9.Mu X (2004) Automated human face recognition: A weighted voting method. PhD thesis, Wayne State University, MIGoogle Scholar
- 10.Pedersen AG, Nielsen H (1997) Neural network prediction of translation initiation sites in eukaryotes: Perspectives for EST and genome analysis. In: Gasterland T, Kark P, Karplus K, Ouzounis C, Sander C, Valencia A (eds) Proceedings of the Fifth International Conference on Intelligent Systems for Molecular Biology, Vol. 5, AAAI Press, Menlo Park, CA, pp 226–233Google Scholar
- 11.Quinlan JR (1993) C4.5: Program for machine learning. Morgan Kaufmann, San Francisco, CAGoogle Scholar
- 14.Zien A, Raatsch G, Mika S, Schoelkopf B, Lemmem C, Smola A, Lengauer T, Mueller KR (1999) Engineering support vector machine kernels that reconize translation initiation sites. In: Proceedings of the German Conference on Bioinformatics, pp 37–43Google Scholar