Contrivedness: The boundary between pattern recognition and numerology

The irreducible informational loss expended in a pattern search procedure is quantified using the concept of contrived entropy. In multivariate analysis this quantity is of value in distinguishing true patterns from statistical noise and in deciding to what depth a search procedure should be conduct...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition 1982, Vol.15 (3), p.253-261
Main Authors: Eilbert, R.F., Christensen, R.A.
Format: Article
Language:English
Subjects:
Chance correlations
Contrived entropy
Contrivedness
Entropy
Information theory
Multivariate statistics
Pattern recognition
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The irreducible informational loss expended in a pattern search procedure is quantified using the concept of contrived entropy. In multivariate analysis this quantity is of value in distinguishing true patterns from statistical noise and in deciding to what depth a search procedure should be conducted. For a specific partition, the contrived entropy is defined as the partition entropy averaged over all possible permutations of event outcomes. The contrived entropy associated with a search procedure or set of attempted partitions is taken to be the expectation value of the minimized partition entropy for each permutation. The behavior of the contrived entropy is illustrated for a simple univariate case.
ISSN:0031-3203
1873-5142
DOI:10.1016/0031-3203(82)90076-0