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.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.


