Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Complexity of the consistency problem for certain post classes
Autore:
Shmulevich, I; Gabbouj, M; Astola, J;
Indirizzi:
Tampere Univ Technol, Tampere Int Ctr Signal Proc, Tampere, Finland Tampere Univ Technol Tampere Finland Ctr Signal Proc, Tampere, Finland
Titolo Testata:
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
fascicolo: 2, volume: 31, anno: 2001,
pagine: 251 - 253
SICI:
1083-4419(200104)31:2<251:COTCPF>2.0.ZU;2-C
Fonte:
ISI
Lingua:
ENG
Keywords:
computational complexity; computational learning theory; consistency problem; monotone Boolean function; post class;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
15
Recensione:
Indirizzi per estratti:
Indirizzo: Shmulevich, I Tampere Univ Technol, Tampere Int Ctr Signal Proc, Tampere, Finland Tampere Univ Technol Tampere Finland oc, Tampere, Finland
Citazione:
I. Shmulevich et al., "Complexity of the consistency problem for certain post classes", IEEE SYST B, 31(2), 2001, pp. 251-253

Abstract

The complexity of the consistency problem for several important classes ofBoolean functions is analyzed. The classes of functions under investigation are those which are closed under function composition or superposition. Several of these so-called Post classes are considered within the context ofmachine learning with an application to breast cancer diagnosis. The considered Post classes furnish a user-selectable measure of reliability. It is shown that for realistic situations which may arise in practice, the consistency problem for these classes of functions is polynomial-time solvable.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 21/01/20 alle ore 07:05:37