Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

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

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Benson DA, Boguski MS, Lipman DJ, Ostell J (1997) Genbank. Nucleic Acids Res 25(1):1–6

    Article  PubMed  Google Scholar 

  2. Chen L, Tokuda N (2003) Robustness of regional matching scheme over globe matching scheme. Artif Intell 144(1–2):213–232

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen L, Tokuda N (2003) Stability analysis of regional and national voting schemes by a continuous model. IEEE Trans Knowledge Data Eng 15(4):1037–1042

    Article  Google Scholar 

  4. Keren D (2003) Recognizing image “style” and activities in video using local features and naive bayes. Pattern Recognit Lett 24(16):2913–2922

    Article  Google Scholar 

  5. Kohonen T (1997) Self-organizing maps, In: Series in information sciences, vol. 30, 2nd edn. Springer, Heidelberg

    Google Scholar 

  6. Langley P, Iba W, Thompson K (1996) Machine leaning in prognosis of the femoral neck fracture recovery. Artif Intell Med 431–451

  7. Liu H, Wong L (2003) Data mining tools for biological sequences. J Bioinformat Comput Biol 1(1):139–167

    Article  Google Scholar 

  8. Matthews B (1975) Comparison of the predicted and observed secondary structure of T4 phage lysozyme. Biochim Biophys Acta 405:442–451

    PubMed  Google Scholar 

  9. Mu X (2004) Automated human face recognition: A weighted voting method. PhD thesis, Wayne State University, MI

    Google 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–233

  11. Quinlan JR (1993) C4.5: Program for machine learning. Morgan Kaufmann, San Francisco, CA

    Google Scholar 

  12. Turk M, Pentland A (1991) Eigenfaces for recognition. J Cognit Neurosci 3(1):71–86

    Article  Google Scholar 

  13. Vapnik VN (1995) The nature of statistical learning theory. Springer-Verlag, Berlin

    MATH  Google 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–43

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liang Chen.

Additional information

Liang Chen received his Doctor' degree in Computer Science from the Institute of Software, Chinese Academy of Sciences, Beijing, China, in 1994. He is currently Associate Professor and Chair of Computer Science Department, University of Northern British Columbia, Prince George, BC, Canada. His research interests include general artificial intelligence, image processing, bioinformatics, intelligent language tutoring system, computational intelligence, and fast approximate practical algorithms for solving some NP hard problems.

Ruoyu Chen is now an undergraduate student (Class 2, Grade 2002) in Computer Science and Technology College at Jilin University, China, majoring Computer Science and Technology. He started to work with Dr. L. Chen in voting theory from 2003. He holds one Chinese Patent. His main research interests include artificial intelligence, natural language tutoring systems, data mining, and networks.

Sharmin Nilufar received an MSc degree in Computer Science from Rajshahi University, Bangladesh. She is now a graduate student at University of Northern British Columbia, Prince George, BC, Canada. Her research interests include information retrieval, image retrieval, and bioinformatics.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, L., Chen, R. & Nilufar, S. Improving the performance of 1D object classification by using the Electoral College. Knowl Inf Syst 10, 41–56 (2006). https://doi.org/10.1007/s10115-005-0232-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-005-0232-7

Keywords

Navigation