| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 393476 | Information Sciences | 2014 | 11 Pages |
Abstract
Moving least-squares method is investigated with samples drawn from unbounded sampling processes. Convergence analysis is established by imposing incremental conditions on moments of sample output and window width. Satisfied convergence rates are derived by means of projection operator and some concentration inequalities.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Fangchao He, Hong Chen, Luoqing Li,