2009
DOI: 10.1016/j.csda.2009.06.014
|View full text |Cite
|
Sign up to set email alerts
|

Nonparametric density estimation of streaming data using orthogonal series

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 6 publications
0
5
0
Order By: Relevance
“…For the density estimation of streaming data of a nonstationary process in [Caudle & Wegman, 2009], the simple idea introduced by Cencov [1962] was used to find the coefficients of the orthogonal series from expectations of basis functions. We have also used this simple idea to determine the unknown coefficients a i s of the estimated PDF in terms of the nonorthogonal B-splines as: multiplying both sides of Eq.…”
Section: One-dimensional (1d) Density Estimation Using B-splinesmentioning
confidence: 99%
“…For the density estimation of streaming data of a nonstationary process in [Caudle & Wegman, 2009], the simple idea introduced by Cencov [1962] was used to find the coefficients of the orthogonal series from expectations of basis functions. We have also used this simple idea to determine the unknown coefficients a i s of the estimated PDF in terms of the nonorthogonal B-splines as: multiplying both sides of Eq.…”
Section: One-dimensional (1d) Density Estimation Using B-splinesmentioning
confidence: 99%
“…The main downfall of these bases is their infinite support, demanding a large number of terms in the series expansion to accurately approximate complex densities containing multiple modes and abrupt variations. With the advent and growing use of wavelets, we are now seeing more uses of OSE [15,30,7,5]. In fact, Peter and Rangarajan [28] show wavelet density estimators (WDE) often outperform many other nonparametric density estimators.…”
Section: Relevant Workmentioning
confidence: 99%
“…If data arrive in batches, where there is no particular ordering within a batch, it may be advantageous to weight each data element within a batch equally, but exponentially weight the batches themselves. Extending the above methodology to k batches of size p (with kp = n ) results in the following updating algorithm2 For example, consider a data stream of 1000 observations that has been obtained in four batches of 250 observations. Further assume that within each batch there is no specific ordering.…”
Section: Discounting Old Datamentioning
confidence: 99%