1 / 9

Hamming Clustering: A New Approach to Rule Extraction

Hamming Clustering: A New Approach to Rule Extraction. Marco Muselli and Diego Liberati In Proceedings of the Third International ICSC Symposia on Soft Computing-SOCO '99, ICSC Academic Press, 499-504. Summarized by HaYoung Jang. Introduction.

barbie
Download Presentation

Hamming Clustering: A New Approach to Rule Extraction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Hamming Clustering: A New Approach to Rule Extraction Marco Muselli and Diego Liberati In Proceedings of the Third International ICSC Symposia on Soft Computing-SOCO '99, ICSC Academic Press, 499-504. Summarized by HaYoung Jang

  2. Introduction • Infer the rules underlying a classification problem starting from a given set of examples. • e.g. character recognition, speech understanding, etc. • Neural networks • Know how to do, but not how to explain.

  3. Introduction • Hamming Clustering • For the solution of classification problems with binary inputs. • Directly infer the explicit rules in if-then form. • Achieve performances comparable to those of artificial neural networks, in terms of both efficiency and efficacy. • Allow a direct implementation on a physical support, since it does not require variable weights with floating point precision.

  4. The procedure of Hamming Clustering • S: a training set containing s samples (xj, yi), j = 1, …, s. • xj : input patterns which have n Boolean components. xji,i = 1, …, n. • x∈ {-1, +1}n

  5. The procedure of Hamming Clustering • Hypercube {-1, +1} • Training set S

  6. The procedure of Hamming Clustering • Minimal Pruning • find a minimum subset of cubes that correctly classify all the input patterns in S. • extracts the clusters with maximum covering one at a time. • Threshold pruning • maintain in C+ and C¡ only the cubes whose covering exceeds a fixed threshold τ. • the value of τis proportional to the maximum covering qmax found in the set of clusters to be pruned.

  7. The procedure of Hamming Clustering

  8. Tests and Results • Monk’s Problem • Winsconsin Breast Cancer Database

  9. Conclusions • In the reconstruction of Boolean functions HC has been able to achieve a simplified and-or expression, partially recovering the action of noise possibly affecting the aquisition of the input-output pairs. • the capability of HC to build the and-or expression of any Boolean function. • As an important byproduct, HC is able to identify inputs which do not influence the final output, thus automatically reducing the complexity of the given classification problem.

More Related