DocumentCode
925667
Title
Mode identification with finite statistics (Corresp.)
Author
Samaniego, Francisco J.
Volume
22
Issue
5
fYear
1976
fDate
9/1/1976 12:00:00 AM
Firstpage
588
Lastpage
590
Abstract
The multiple decision problem of identifying the mode of a discrete (
-valued) random variable is examined under a time-varying finite memory constraint. Under the assumption that the distribution of the observed random variable has a unique mode, the partial information model, in which it is assumed that the two largest probabilities can be separated by a known number, is shown to be
state perfectly achievable. The general model, in which no assumptions are made on the distribution save the fact that the mode is unique, is shown to be
state perfectly achievable.
-valued) random variable is examined under a time-varying finite memory constraint. Under the assumption that the distribution of the observed random variable has a unique mode, the partial information model, in which it is assumed that the two largest probabilities can be separated by a known number, is shown to be
state perfectly achievable. The general model, in which no assumptions are made on the distribution save the fact that the mode is unique, is shown to be
state perfectly achievable.Keywords
Decision procedures; Finite-memory methods; Automata; Clocks; Data processing; Mathematics; Memory management; Random variables; Statistical distributions; Statistics; Testing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1976.1055605
Filename
1055605
Link To Document