http://www.cnr.it/ontology/cnr/individuo/prodotto/ID77579
Optimal Subset Selection for Classification through SAT Encodings (Contributo in atti di convegno)
- Type
- Label
- Optimal Subset Selection for Classification through SAT Encodings (Contributo in atti di convegno) (literal)
- Anno
- 2008-01-01T00:00:00+01:00 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
- 10.1007/978-0-387-09695-7_30 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Angiulli Fabrizio; Basta Stefano (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume
- ARTIFICIAL INTELLIGENCE IN THEORY AND PRACTICE II (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#volumeInCollana
- Note
- ISI Web of Science (WOS) (literal)
- Google Scholar (literal)
- Scopu (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- DEIS-UNICAL; ICAR-CNR (literal)
- Titolo
- Optimal Subset Selection for Classification through SAT Encodings (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
- 978-0-387-09694-0 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#curatoriVolume
- Abstract
- In this work we propose a method for computing a minimum size training set consistent subset for the Nearest Neighbor rule (also said CNN problem) via SAT encodings. We introduce the SAT-CNN algorithm, which exploits a suitable encoding of the CNN problem in a sequence of SAT problems in order to exactly solve it, provided that enough computational resources are available. Comparison of SAT-CNN with well-known greedy methods shows that SAT-CNN is able to return a better solution. The proposed approach can be extended to several hard subset selection classification problems. (literal)
- Prodotto di
- Autore CNR
Incoming links:
- Prodotto
- Autore CNR di