Experimental Investigation of Three Machine Learning Algorithms for ITS Dataset

  • J. L. Yearwood
  • B. H. Kang
  • A. V. Kelarev
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5899)

Abstract

The present article is devoted to experimental investigation of the performance of three machine learning algorithms for ITS dataset in their ability to achieve agreement with classes published in the biologi cal literature before. The ITS dataset consists of nuclear ribosomal DNA sequences, where rather sophisticated alignment scores have to be used as a measure of distance. These scores do not form a Minkowski metric and the sequences cannot be regarded as points in a finite dimensional space. This is why it is necessary to develop novel machine learning ap proaches to the analysis of datasets of this sort. This paper introduces a k-committees classifier and compares it with the discrete k-means and Nearest Neighbour classifiers. It turns out that all three machine learning algorithms are efficient and can be used to automate future biologically significant classifications for datasets of this kind. A simplified version of a synthetic dataset, where the k-committees classifier outperforms k-means and Nearest Neighbour classifiers, is also presented.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • J. L. Yearwood
    • 1
  • B. H. Kang
    • 2
  • A. V. Kelarev
    • 1
  1. 1.School of Information Technology and Mathematical SciencesUniversity of BallaratBallarat, VictoriaAustralia
  2. 2.School of Computing and Information SystemsUniversity of TasmaniaTasmaniaAustralia

Personalised recommendations