Journal article
Membership set estimators: size, optimal inputs, complexity and relations with least squares
IEEE transactions on circuits and systems. 1, Fundamental theory and applications, Vol.42(5), pp.266-277
1995
DOI: 10.1109/81.386160
Abstract
In this paper, we study some fundamental properties of the membership set estimators. First, the size of the membership set S/sup N/ is derived if the noise is bounded by /spl epsiv/ but otherwise unknown. Second, in the case when the noise is an independent and identically distributed random variable in the interval [-/spl epsiv/,/spl epsiv/], the probability distribution of the size of S/sup N/ is also obtained. We then derive optimality conditions on the input in order to minimize the size of this set. Finally, we study the relations between least squares and membership set estimators and we obtain necessary and sufficient conditions under which the least squares estimate lies in S/sup N/
Details
- Title: Subtitle
- Membership set estimators: size, optimal inputs, complexity and relations with least squares
- Creators
- ER-WEI BAI - Univ. Iowa, dep. electrical computer eng., Iowa City IA 52242, United StatesR TEMPO - Univ. Iowa, dep. electrical computer eng., Iowa City IA 52242, United StatesHYONYONG CHO - Univ. Iowa, dep. electrical computer eng., Iowa City IA 52242, United States
- Resource Type
- Journal article
- Publication Details
- IEEE transactions on circuits and systems. 1, Fundamental theory and applications, Vol.42(5), pp.266-277
- Publisher
- Institute of Electrical and Electronics Engineers
- DOI
- 10.1109/81.386160
- ISSN
- 1057-7122
- eISSN
- 1558-1268
- Language
- English
- Date published
- 1995
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984083234802771
Metrics
14 Record Views