Name
Abstract | ||
|---|---|---|
This paper concerns classification by Boolean functions. We investigate the classification accuracy obtained by standard classification techniques on unseen points (elements of the domain, {0,1}^n, for some n) that are similar, in particular senses, to the points that have been observed as training observations. Explicitly, we use a new measure of how similar a point x@?{0,1}^n is to a set of such points to restrict the domain of points on which we offer a classification. For points sufficiently dissimilar, no classification is given. We report on experimental results which indicate that the classification accuracies obtained on the resulting restricted domains are better than those obtained without restriction. These experiments involve a number of standard data-sets and classification techniques. We also compare the classification accuracies with those obtained by restricting the domain on which classification is given by using the Hamming distance. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.dam.2008.04.007 | Discrete Applied Mathematics |
Keywords | Field | DocType |
boolean functions,hamming distance,boolean function,classification | Boolean function,Similitude,Combinatorics,One-class classification,Classification rule,Similarity measure,Computer science,Algorithm,Hamming distance | Journal |
Volume | Issue | ISSN |
157 | 5 | 0166-218X |
Citations | PageRank | References |
2 | 0.50 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Munevver Mine Subasi | 1 | 2 | 0.50 |
| Ersoy Subasi | 2 | 7 | 3.40 |
| Martin Anthony | 3 | 329 | 141.99 |
| Peter L. Hammer | 4 | 1996 | 288.93 |