Heuristics for efficient classification

Kathryn Fraughnaugh, Jennifer Ryan, Holly Zullo and Louis Cox

Annals of Operations Research, 1998, vol. 78, issue 0, 189-200

Abstract: The classification problem is to determine the class of an object when it is costly to observe the values of its attributes. This type of problem arises in fault diagnosis, in the desig- of interactive expert systems, in reliability analysis of coherent systems, in discriminant analysis of test data, and in many other applications. We introduce a generic decision rule that specifies the next attribute to test at any location in a decision tree. Random searches and tabu searches are applied to determine the best specific form of the rule. The most successful heuristics that we developed are based on the tabu search paradigm. We present computational results for problems with a variety of characteristics and compare our heuristics to an exact dynamic programming algorithm. Copyright Kluwer Academic Publishers 1998

Keywords: classification; tabu search; heuristics (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018997900011 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:78:y:1998:i:0:p:189-200:10.1023/a:1018997900011

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018997900011

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().