Abstract
The table look-up rule problem can be described by the question: what is a good way for the table to represent the decision regions in the N-dimensional measurement space. This paper describes a quickly implementable table look-up rule based on Ashby’s representation of sets in his constraint analysis. A decision region for category c in the N-dimensional measurement space is considered to be the intersection of the inverse projections of the decision regions determined for category c by Bayes rules in smaller dimensional projection spaces. Error bounds for this composite decision rule are derived: any entry in the confusion matrix for the composite decision rule is bounded above by the minimum of that entry taken over all the confusion matrices of the Bayes decision rules in the smaller dimensional projection spaces. On simulated Gaussian Data, probability of error with the table look-up rule is comparable to the optimum Bayes rule.
Keywords
Table (database)Computer scienceData mining
Affiliated Institutions
Related Publications
Nearest neighbor pattern classification
The nearest neighbor decision rule assigns to an unclassified sample point the classification of the nearest of a set of previously classified points. This rule is independent o...
Computer systems that learn: classification and prediction methods from statistics, neural nets, machine learning, and expert systems
Preface 1 Overview of Learning Systems 1.1 What is a Learning System? 1.2 Motivation for Building Learning Systems 1.3 Types of Practical Empirical Learning Systems 1.3.1 Common...
Automated learning of decision rules for text categorization
We describe the results of extensive experiments using optimized rule-based induction methods on large document collections. The goal of these methods is to discover automatical...
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
We present a new algorithm for manifold learning and nonlinear dimensionality reduction. Based on a set of unorganized data points sampled with noise from a parameterized manifo...
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
We develop a face recognition algorithm which is insensitive to large variation in lighting direction and facial expression. Taking a pattern classification approach, we conside...
Publication Info
- Year
- 1976
- Type
- article
- Volume
- 5
- Issue
- 12
- Pages
- 1163-1191
- Citations
- 34
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
34
OpenAlex
0
Influential
23
CrossRef
Cite This
Robert M. Haralick
(1976).
The table look-up rule.
Communication in Statistics- Theory and Methods
, 5
(12)
, 1163-1191.
https://doi.org/10.1080/03610927608827433
Identifiers
- DOI
- 10.1080/03610927608827433