Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David M. Green

dblp:54/76 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1963
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
statistical pattern recognition
0.011960
Statistical Recognition Functions and the Design of Pattern Recognizers · IRE Trans. Electron. Comput. 1960

Methods — techniques the papers use, named apart from their topics

probability distribution estimation · 0.0
YearPublicationVenuePosition
1963 On the effectiveness of receptors in recognition systems
abstract
In the type of recognition system under discussion, the physical sample to be recognized is first subjected to a battery of tests; on the basis of the test results, the sample is then assigned to one of a number of prespecified categories. The theory of how test results should be combined to yield an optimal assignment has been discussed in an earlier paper. Here, attention is focused on the tests themselves. At present, we usually measure the effectiveness of a set of tests empirically, i.e., by determining the percentage of correct recognitions made by some recognition device which uses these tests. In this paper, we discuss some of the theoretical problems encountered in trying to determine a more formal measure of the effectiveness of a set of tests; a measure which might be a practical substitute for the empirical evaluation. Specifically, the following question is considered: What constitutes an effective set of tests, and how is this effectiveness dependent on the correlations among, and the properties of, the individual tests in the set? Specific suggestions are considered for the case in which the test results are normally distributed, but arbitrarily correlated. The discussion is supported by the results of experiments dealing with automatic recognition of hand-printed characters.
Thomas Marill, David M. Green
IEEE Trans. Inf. Theory2
1960 Statistical Recognition Functions and the Design of Pattern Recognizers
abstract
According to the model discussed in this paper, a pattern recognizer is said to consist of two parts: a receptor, which generates a set of measurements of the physical sample to be recognized, and a categorizer, which assigns each set of measurements to one of a finite number of categories. The rule of operation of the categorizer is called the ``recognition function.'' The optimization of the recognition function is discussed, and the form of the optimal function is derived. In practice, a prohibitively large sample is required to provide a basis for estimating the optimal recognition function. If, however, certain assumptions about the probability distributions of the measurements are warranted, recognition functions that are asymptotically optimal may be obtained readily. A small numerical example, involving the recognition of the hand-printed characters A, B, and C is solved by means of the techiques described. The recognition accuracy is found to be 95 per cent.
Thomas Marill, David M. Green
IRE Trans. Electron. Comput.2