Title :
Filtering: the case for "noisier" data
Author :
Lucena, B. ; Kontoyiannis, I.
Author_Institution :
Div. of Comput. Sci., California Univ., Berkeley, CA, USA
fDate :
29 Aug.-1 Sept. 2005
Abstract :
Suppose there is some discrete variable X of interest, which can only be observed after passing through 2 channels (Q and R). You are limited to n noisy observations of X and then must estimate the value of X. Your one control is a parameter k which determines the level of correlation in your observed data. Specifically, X is first transmitted through the channel Q n/k times to yield variables Y1,..., Ynk/ and then each Yi is transmitted through channel R k times to yield variables Zi,1,..., ZI,k. How should k be chosen to maximize the probability of successfully guessing the correct value of X? While k ≡ 1 yields data points Zi,1 which are conditionally independent given the value of X, we find that this does not always mean that k ≡ 1 is the optimal choice. In fact, many simple situations yield cases where the optimal value of k is greater than 1. We explore this phenomenon and present both theoretical and empirical results.
Keywords :
filtering theory; maximum likelihood decoding; memoryless systems; noise; Potts channel; Z-channel; binary symmetric channel; discrete memoryless channels; filtering; maximum likelihood; mutual information; noisier data; Character generation; Computer aided software engineering; Computer science; Electronic mail; Filtering; Mathematics; Maximum likelihood estimation; Memoryless systems; Mutual information; Testing;
Conference_Titel :
Information Theory Workshop, 2005 IEEE
Print_ISBN :
0-7803-9480-1
DOI :
10.1109/ITW.2005.1531872