Algorithms for identification key generation and optimization with application to yeast identification

Authors:
Alan P. Reynolds;Jo L. Dicks;Ian N. Roberts;Jan-Jap Wesselink;Beatriz de la Iglesia;Vincent Robert;Teun Boekhout;Victor J. Rayward-Smith
Affiliations:
School of Information Systems, University of East Anglia, Norwich, UK;John Innes Centre, Norwich, UK;National Collection of Yeast Cultures, Institute of Food Research, Norwich, UK;School of Information Systems, University of East Anglia, Norwich, UK;School of Information Systems, University of East Anglia, Norwich, UK;Centraalbureau voor Schimmelcultures, Utrecht, The Netherlands;Centraalbureau voor Schimmelcultures, Utrecht, The Netherlands;School of Information Systems, University of East Anglia, Norwich, UK
Venue:
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Year:
2003

Citing 1
Cited 3

C4.5: programs for machine learning

C4.5: programs for machine learning

Developing classification techniques from biological databases using simulated annealing

Metaheuristics
Decision trees for entity identification: approximation algorithms and hardness results

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Decision trees for entity identification: Approximation algorithms and hardness results

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithms for the automated creation of low cost identification keys are described and theoretical and empirical justifications are provided. The algorithms are shown to handle differing test costs, prior probabilities for each potential diagnosis and tests that produce uncertain results. The approach is then extended to cover situations where more than one measure of cost is of importance, by allowing tests to be performed in batches. Experiments are performed on a real-world case study involving the identification of yeasts.