Some refinements of the quasi-quantiles
โ Scribed by Govind S. Mudholkar; Alan D. Hutson
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 346 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
โฆ Synopsis
R.D. Reiss's (1980) proposal of quasi-quantiles, i.e. certain kernel estimators of population quantiles Q(u), is extended using a mixing function h(u) and an asymmetric bandwidth function defined by endpoints ~,(u) and 6(u). The second order terms in the expansions of the expected value and variance are used to determine h(u), y(u) and 6(u) and thus refine quasi-quantiles.
๐ SIMILAR VOLUMES
Lingras et al. proposed a rough cluster algorithm and successfully applied it to web mining. In this paper we analyze their algorithm with respect to its objective function, numerical stability, the stability of the clusters and others. Based on this analysis a refined rough cluster algorithm is pre
This paper contains a link between Probability Proportional to Size (PPS) sampling and interpolations of the classical Jensen inequality. We show that these interpolating inequalities are, in fact, special cases of the conditional Jensen inequality when applied over an appropriate probability space.