The synthesis of digital circuits for the solution of binary classification problems is performed by employing a new learning method, named Hamming Clustering: it proceeds by generating clusters of input patterns that belong to the same class and are close each other according to the Hamming distance. In polynomial time, a digital circuit is obtained, neglecting redundant inputs irrelevant to the classification process, exhibiting generalization ability and allowing a direct extraction of the underlying rules.

Logic synthesis via Hamming Clustering

M Muselli;D Liberati
1999

Abstract

The synthesis of digital circuits for the solution of binary classification problems is performed by employing a new learning method, named Hamming Clustering: it proceeds by generating clusters of input patterns that belong to the same class and are close each other according to the Hamming distance. In polynomial time, a digital circuit is obtained, neglecting redundant inputs irrelevant to the classification process, exhibiting generalization ability and allowing a direct extraction of the underlying rules.
1999
Istituto di Elettronica e di Ingegneria dell'Informazione e delle Telecomunicazioni - IEIIT
Inglese
Proceedings of the 11th European Conference on Circuit Theory and Design (ECCTD '99)
11th European Conference on Circuit Theory and Design (ECCTD '99)
1095
1098
Sì, ma tipo non specificato
29 August - 2 September 1999
Stresa, Italy
2
none
Muselli, M; Liberati, D
273
info:eu-repo/semantics/conferenceObject
04 Contributo in convegno::04.01 Contributo in Atti di convegno
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/221017
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact