DocumentCode
866691
Title
Binary rule generation via Hamming Clustering
Author
Muselli, Marco ; Liberati, Diego
Author_Institution
Ist. per i Circuiti Elettronici, Consiglio Nazionale delle Ricerche, Genova, Italy
Volume
14
Issue
6
fYear
2002
Firstpage
1258
Lastpage
1268
Abstract
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm called Hamming Clustering (HC). It reconstructs the AND-OR expression associated with any Boolean function from a training set of samples. The basic kernel of the method is the generation of clusters of input patterns that belong to the same class and are close to each other according to the Hamming distance. Inputs which do not influence the final output are identified, thus automatically reducing the complexity of the final set of rules. The performance of HC has been evaluated through a variety of artificial and real-world benchmarks. In particular, its application in the diagnosis of breast cancer has led to the derivation of a reduced set of rules solving the associated classification problem.
Keywords
Boolean functions; data mining; generalisation (artificial intelligence); learning (artificial intelligence); medical diagnostic computing; medical expert systems; pattern clustering; AND-OR expression; Boolean function; Hamming Clustering; Hamming distance; benchmarks; binary rule generation; breast cancer diagnosis; classification; generalization; knowledge discovery; medical expert systems; pattern clustering; performance evaluation; rule complexity; sample training set; Boolean functions; Cancer; Circuit synthesis; Clustering algorithms; Decision trees; Digital circuits; Hamming distance; Induction generators; Kernel; Logic programming;
fLanguage
English
Journal_Title
Knowledge and Data Engineering, IEEE Transactions on
Publisher
ieee
ISSN
1041-4347
Type
jour
DOI
10.1109/TKDE.2002.1047766
Filename
1047766
Link To Document