ojs Open Journal of Statistics 2161-7198 2161-718X Scientific Research Publishing 10.4236/ojs.2026.162006 ojs-150723 Article Physics Mathematics Kumaraswamy-Adaptive Normal Kernel Densities for Robust Smoothing of Skewed, Outlier-Contaminated Data Adepoju Kazeem A. 1 Jones Galin L. 1 School of Statistics, University of Minnesota, Minneapolis, USA

The authors declare no conflicts of interest regarding the publication of this paper.

 08 04 2026 04 2026 16 02 107 120 08 02 2026 11 04 2026 14 04 2026 © 2026 by the authors and Scientific Research Publishing Inc. 2026 This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( https://creativecommons.org/licenses/by/4.0/ ). https://doi.org/10.4236/ojs.2026.162006

Kernel Density Estimation (KDE) is widely used for estimating unknown probability densities. Classical kernel forms are fixed-shape smoothers that may degrade under skewness and contamination. This study evaluates a Kumaraswamy-transformed Normal kernel (KwNormal) against standard kernels via Monte-Carlo replication and Integrated Squared Error (ISE). Results confirm the consistent dominance and stability of KwNormal across sample sizes.

 Kernel Density Estimation Density Smoothing Integrated Squared Error Skewed Distributions Kernel Adaptation Kumaraswamy Transformation Monte-Carlo Kernel Comparison 1. Introduction

Kernel Density Estimation (KDE) is a fundamental non-parametric method for smoothing and estimating unknown probability density functions. KDE constructs a continuous density approximation by averaging localized kernel contributions scaled by a bandwidth parameter ℎ. The statistical foundations of KDE originate in Rosenblatt [1] and Parzen [2].

The Epanechnikov kernel, introduced by Epanechnikov [3], is known to be optimal in a mean squared error (MSE) sense among compact-support kernels. Subsequent work by Silverman [4] and Scott [5] established KDE as a central tool in applied statistics. Further refinements in bandwidth selection were developed by Jones, Marron, and Sheather [6], and later expanded by Sheather [7].

Despite these advances, classical kernels remain fixed-shape smoothers and may perform poorly in the presence of skewness and outlier contamination. This limitation motivates the development of flexible kernel constructions capable of adapting to non-standard data features.

The present work builds upon earlier contributions by Adepoju et al.[8], where transformation-based approaches and robustness under contamination were explored. In particular, the development of exponentiated test statistics in the presence of outliers [8] and the introduction of the Kumaraswamy Fisher-Snedecor distribution [9] provide a conceptual foundation for incorporating Kumaraswamy-based transformations into kernel density estimation. These prior studies motivate the current proposal of a Kumaraswamy-Adaptive Normal kernel designed to enhance robustness and flexibility in density smoothing.

 2. Literature Review of Existing Kernel Densities

Before introducing the proposed adaptive kernel, it is important to situate the work within the broader framework of classical kernel density estimation. Over the years, several kernel functions have been developed and studied extensively, each possessing distinct smoothness, support, and efficiency characteristics. Although many kernels share similar asymptotic properties, their finite-sample performance may differ, particularly under skewness and contamination.

This section briefly reviews the most commonly used kernel functions in the literature. These standard kernels serve as benchmarks for comparison with the proposed Kumaraswamy-Normal kernel and provide a foundation for understanding its relative advantages.

Let u = x − X i h denote the standardized distance between the evaluation point x and the observation X i , where h > 0 is the bandwidth parameter. The general kernel density estimator is given by

f ^ h ( x ) = 1 n h ∑ i = 1 n   K ( x − X i h ) 2.1. Gaussian Kernel K ( u ) = 1 2 π exp ( − u 2 2 ) 2.2. Epanechnikov Kernel K ( u ) = { 3 4 ( 1 − u 2 ) , | u | ≤ 1 , 0 , | u | > 1 2.3. Uniform Kernel K ( u ) = { 1 2 , | u | ≤ 1 , 0 , | u | > 1 2.4. Triangular Kernel K ( u ) = { 1 − | u | , | u | ≤ 1 , 0 , | u | > 1 2.5. Biweight Kernel K ( u ) = { 15 16 ( 1 − u 2 ) 2 , | u | ≤ 1 , 0 , | u | > 1 2.6. Triweight Kernel K ( u ) = { 35 32 ( 1 − u 2 ) 3 , | u | ≤ 1 , 0 , | u | > 1 2.7. Cosine Kernel K ( u ) = { π 4 cos ( π u 2 ) , | u | ≤ 1 , 0 , | u | > 1 2.8. Logistic Kernel K ( u ) = 1 exp ( u ) + 2 + exp ( − u ) 2.9. Sigmoid Kernel K ( u ) = 2 π 1 exp ( u ) + exp ( − u ) 3. Kumaraswamy-Normal Kernel 3.1. Definition

Let

ϕ ( u ) = 1 2 π e − u 2 / 2 ,       Φ ( u ) = ∫ − ∞ u ϕ ( t ) d t .

Apply the Kumaraswamy transformation:

F K N ( u ) = 1 − ( 1 − Φ ( u ) a ) b ,       a > 0 ,   b > 0.

The induced kernel density is

K K N ( u ; a , b ) = a b ϕ ( u ) Φ ( u ) a − 1 ( 1 − Φ ( u ) a ) b − 1

when a = b = 1 , the Gaussian kernel is recovered.

3.2. Motivation for the Kumaraswamy Link

The Kumaraswamy link function is an established asymmetric transformation in the statistical literature, well known for its flexibility through its two shape parameters a and b . By varying these parameters, the function can generate left-skewed, right-skewed, and heavy-tailed distributions.

When the underlying density deviates from normality, purely symmetric kernels may introduce bias in the estimation process. Embedding the Gaussian kernel within the Kumaraswamy link provides a mechanism for introducing controlled asymmetry while preserving the smoothness and analytical tractability of the Normal kernel.

Thus, the Kumaraswamy-Normal kernel retains the stability of the Gaussian kernel while adapting to skewness and complex tail behavior, making it particularly suitable for density estimation in the presence of non-standard data structures.

 4. Kumaraswamy-Normal Kernel 4.1. Definition

Let

ϕ ( u ) = 1 2 π e − u 2 / 2 ,       Φ ( u ) = ∫ − ∞ u ϕ ( t ) d t ,

denote respectively the standard normal density and cumulative distribution function.

Applying the Kumaraswamy transformation to the standard normal distribution gives

F K N ( u ) = 1 − ( 1 − Φ ( u ) a ) b ,       a > 0 ,   b > 0.

Differentiating with respect to u , the corresponding Kumaraswamy-Normal density is

K K N ( u ; a , b ) = a b ϕ ( u ) Φ ( u ) a − 1 ( 1 − Φ ( u ) a ) b − 1 ,       − ∞ < u < ∞

when a = b = 1 , we recover the classical Gaussian kernel:

K K N ( u ; 1 , 1 ) = ϕ ( u ) .

Thus, the Kumaraswamy-Normal kernel extends the Gaussian kernel through two shape parameters a and b , allowing greater flexibility in handling skewness and tail behavior.

 4.2. Likelihood Function of the Kumaraswamy-Normal Distribution

Suppose u 1 , u 2 , ⋯ , u n is a random sample from the Kumaraswamy-Normal distribution with parameters a > 0 and b > 0 . Then the joint likelihood function is

L ( a , b ) = ∏ i = 1 n   a b ϕ ( u i ) Φ ( u i ) a − 1 ( 1 − Φ ( u i ) a ) b − 1 .

Hence,

L ( a , b ) = ( a b ) n ∏ i = 1 n   ϕ ( u i ) ∏ i = 1 n   Φ ( u i ) a − 1 ∏ i = 1 n ( 1 − Φ ( u i ) a ) b − 1 .

Taking logarithms yields the log-likelihood function

ℓ ( a , b ) = n log a + n log b + ∑ i = 1 n log ϕ ( u i ) + ( a − 1 ) ∑ i = 1 n log Φ ( u i )     + ( b − 1 ) ∑ i = 1 n log ( 1 − Φ ( u i ) a ) .

Since ∑ i = 1 n log ϕ ( u i ) does not depend on a or b , it is constant for optimization purposes.

4.3. Score Equations

The score vector is

U ( a , b ) = ( ∂ ℓ ∂ a ∂ ℓ ∂ b ) .

Derivative with respect to a

Differentiating ℓ ( a , b ) with respect to a gives

∂ ℓ ∂ a = n a + ∑ i = 1 n log Φ ( u i ) + ( b − 1 ) ∑ i = 1 n ∂ ∂ a log ( 1 − Φ ( u i ) a ) .

Now,

∂ ∂ a log ( 1 − Φ ( u i ) a ) = − Φ ( u i ) a log Φ ( u i ) 1 − Φ ( u i ) a .

Therefore,

∂ ℓ ∂ a = n a + ∑ i = 1 n log Φ ( u i ) − ( b − 1 ) ∑ i = 1 n Φ ( u i ) a log Φ ( u i ) 1 − Φ ( u i ) a .

Derivative with respect to b

Differentiating ℓ ( a , b ) with respect to b gives

∂ ℓ ∂ b = n b + ∑ i = 1 n log ( 1 − Φ ( u i ) a ) .

Hence, the likelihood equations are

n a + ∑ i = 1 n log Φ ( u i ) − ( b − 1 ) ∑ i = 1 n Φ ( u i ) a log Φ ( u i ) 1 − Φ ( u i ) a = 0 ,

and

n b + ∑ i = 1 n log ( 1 − Φ ( u i ) a ) = 0.

From the second equation,

b ^ = − n ∑ i = 1 n log ( 1 − Φ ( u i ) a ) .

Thus, a ^ and b ^ are obtained by solving the nonlinear score equations numerically.

4.4. Hessian Matrix

The Hessian matrix is defined by

H ( a , b ) = ( ∂ 2 ℓ ∂ a 2 ∂ 2 ℓ ∂ a ∂ b ∂ 2 ℓ ∂ b ∂ a ∂ 2 ℓ ∂ b 2 ) .

Second derivative with respect to a

We have

∂ 2 ℓ ∂ a 2 = − n a 2 − ( b − 1 ) ∑ i = 1 n ∂ ∂ a ( Φ ( u i ) a log Φ ( u i ) 1 − Φ ( u i ) a ) .

Let

A i = Φ ( u i ) a ,       c i = log Φ ( u i ) .

Then

∂ ∂ a ( A i c i 1 − A i ) = A i c i 2 ( 1 − A i ) 2 .

Therefore,

∂ 2 ℓ ∂ a 2 = − n a 2 − ( b − 1 ) ∑ i = 1 n Φ ( u i ) a ( log Φ ( u i ) ) 2 ( 1 − Φ ( u i ) a ) 2 .

Second derivative with respect to b

∂ 2 ℓ ∂ b 2 = − n b 2 .

Mixed derivative

Differentiating ∂ ℓ ∂ a with respect to b , we obtain

∂ 2 ℓ ∂ a ∂ b = − ∑ i = 1 n Φ ( u i ) a log Φ ( u i ) 1 − Φ ( u i ) a .

Hence,

∂ 2 ℓ ∂ b ∂ a = ∂ 2 ℓ ∂ a ∂ b .

Thus, the Hessian matrix becomes

H ( a , b ) = ( − n a 2 − ( b − 1 ) ∑ i = 1 n Φ ( u i ) a ( log Φ ( u i ) ) 2 ( 1 − Φ ( u i ) a ) 2 − ∑ i = 1 n Φ ( u i ) a log Φ ( u i ) 1 − Φ ( u i ) a − ∑ i = 1 n Φ ( u i ) a log Φ ( u i ) 1 − Φ ( u i ) a − n b 2 ) . 4.5. Maximum Likelihood Estimation

The maximum likelihood estimators ( a ^ , b ^ ) are the values satisfying

U ( a , b ) = 0.

Because the score equations are nonlinear, closed-form solutions do not generally exist for a ^ and b ^ . Therefore, iterative procedures such as the Newton-Raphson algorithm are employed:

( a ( m + 1 ) b ( m + 1 ) ) = ( a ( m ) b ( m ) ) − H ( a ( m ) , b ( m ) ) − 1 U ( a ( m ) , b ( m ) ) .

Iteration continues until convergence.

4.6. Asymptotic Normality of the MLE

Under standard regularity conditions for maximum likelihood estimation, the MLE

θ ^ = ( a ^ b ^ )

is consistent and asymptotically normal. Specifically,

n ( θ ^ − θ ) → d N ( ( 0 0 ) , I ( θ ) − 1 ) ,

where

θ = ( a b ) ,

and I ( θ ) is the Fisher information matrix defined by

I ( θ ) = − E [ H ( a , b ) ] .

Equivalently,

θ ^ ≈ N ( θ , 1 n I ( θ ) − 1 )     for   large   n .

In practice, the covariance matrix of ( a ^ , b ^ ) can be estimated using the observed information matrix

Var ^ ( θ ^ ) = [ − H ( a ^ , b ^ ) ] − 1 . 4.7. Estimation of the Kumaraswamy-Transformed Normal Kernel

Let X 1 , X 2 , ⋯ , X n be a random sample from an unknown density f . The Kumaraswamy–transformed Normal kernel density estimator is defined as

f ^ K N ( x ; h , a , b ) = 1 n h ∑ i = 1 n   K K N ( x − X i h ; a , b ) ,

where h > 0 is the bandwidth.

Substituting the kernel form,

f ^ K N ( x ; h , a , b ) = a b n h ∑ i = 1 n   ϕ ( x − X i h ) Φ ( x − X i h ) a − 1 [ 1 − Φ ( x − X i h ) a ] b − 1 .

Hence, the final estimator depends on three unknown quantities:

h ,     a ,     b .

A practical estimation procedure is as follows:

1. Select an initial bandwidth h using a classical method such as Silverman’s rule of thumb, plug-in estimation, or cross-validation.

2. Estimate the shape parameters a and b by maximum likelihood.

3. Substitute h ^ , a ^ , and b ^ into the estimator

f ^ K N ( x ) = a ^ b ^ n h ^ ∑ i = 1 n   ϕ ( x − X i h ^ ) Φ ( x − X i h ^ ) a ^ − 1 [ 1 − Φ ( x − X i h ^ ) a ^ ] b ^ − 1 .

Thus, the proposed kernel estimator generalizes the Gaussian kernel estimator by incorporating adaptive shape parameters that respond to skewness and contamination.

4.8. Bandwidth Estimation

A simple bandwidth choice is Silverman’s rule of thumb:

h ^ = 1.06 σ ^ n − 1 / 5 ,

where σ ^ is the sample standard deviation.

Alternatively, h may be chosen by least-squares cross-validation:

h ^ C V = arg min h > 0 { ∫ f ^ K N ( x ; h , a , b ) 2 d x − 2 n ∑ i = 1 n   f ^ K N , − i ( X i ; h , a , b ) } ,

where f ^ K N , − i denotes the leave-one-out estimator.

4.9. Bias and Variance of the Proposed Kernel Estimator

Let

μ 2 ( K K N ) = ∫ − ∞ ∞ u 2 K K N ( u ; a , b ) d u

be the second moment of the Kumaraswamy-Normal kernel, and let

R ( K K N ) = ∫ − ∞ ∞ K K N ( u ; a , b ) 2 d u .

Under the usual smoothness assumptions on f , the bias of the estimator is

Bias ( f ^ K N ( x ) ) = E [ f ^ K N ( x ) ] − f ( x ) ≈ h 2 2 μ 2 ( K K N ) f ″ ( x ) .

Its variance is approximately

Var ( f ^ K N ( x ) ) ≈ 1 n h R ( K K N ) f ( x ) .

Therefore, the mean squared error is

MSE ( f ^ K N ( x ) ) ≈ [ h 2 2 μ 2 ( K K N ) f ″ ( x ) ] 2 + 1 n h R ( K K N ) f ( x ) .

Hence, the asymptotic mean integrated squared error is

AMISE ( f ^ K N ) ≈ h 4 4 μ 2 ( K K N ) 2 ∫ ( f ″ ( x ) ) 2 d x + R ( K K N ) n h .

Minimizing the AMISE with respect to h yields the asymptotically optimal bandwidth

h opt = [ R ( K K N ) μ 2 ( K K N ) 2 ∫ ( f ″ ( x ) ) 2 d x ] 1 / 5 n − 1 / 5 .

Thus, the proposed Kumaraswamy-Normal kernel estimator retains the classical n − 1 / 5 bandwidth rate while allowing enhanced adaptability through the parameters a and b .

4.10. Special Case: Reduction to the Gaussian Kernel a = b = 1 K K N ( u ; 1 , 1 ) = ϕ ( u ) ,

and therefore the estimator reduces to the standard Gaussian kernel estimator:

f ^ G ( x ) = 1 n h ∑ i = 1 n   ϕ ( x − X i h ) .

Hence, the proposed estimator is a genuine extension of the Gaussian kernel density estimator.

5. Simulation Study 5.1. Mathematical Description of the Simulation Design

For each Monte Carlo replication, data were generated from a finite mixture of K = 3 lognormal components:

f r ( x ) = ∑ k = 1 3   π k , r LN ( x ; μ k , r , σ k , r 2 ) ,       x > 0 ,

where

LN ( x ; μ , σ 2 ) = 1 x σ 2 π exp ( − ( ln x − μ ) 2 2 σ 2 ) .

The mixture weights satisfy

π k , r > 0 ,       ∑ k = 1 3   π k , r = 1. 5.2. Parameter Generation for Each Monte Carlo Run

For each replication r = 1 , ⋯ , 500 :

( π 1 , r , π 2 , r , π 3 , r ) ~ Dirichlet ( 1 , 1 , 1 ) , μ k , r ~ Uniform ( 0.5 , 2.5 ) ,       σ k , r ~ Uniform ( 0.3 , 1.2 ) .

This guarantees strictly positive, highly skewed, multimodal densities.

 5.3. Outlier Contamination Mechanism

Observed data were generated from

g r ( x ) = ( 1 − ϵ ) f r ( x ) + ϵ h r ( x ) ,       ϵ = 0.08 ,

with heavy-tailed contaminant

h r ( x ) = LN ( x ; μ c , r , σ c , r 2 ) , μ c , r ~ Uniform ( 3 , 4 ) ,       σ c , r ~ Uniform ( 1.2 , 1.8 ) . 5.4. Estimation of Shape Parameters <inline-formula> <mml:math> <mml:mrow> <mml:mi>a</mml:mi> <mml:mo>,</mml:mo> <mml:mi>b</mml:mi> </mml:mrow> </mml:math> </inline-formula>

The shape parameters a and b were estimated separately for each experiment rather than fixed globally.

For each replication and sample size n ,

( a r , b r ) = arg min a > 0 , b > 0 ∫ 0 ∞ ( f ^ a , b ( x ) − f r ( x ) ) 2 d x .

This allows full adaptation to each dataset.

5.5. Monte Carlo Procedure

For each

n ∈ { 40 , 80 , 150 , 300 , 600 , 1000 } ,

500 datasets were generated from g r ( x ) .

The integrated squared error (ISE) was computed as

ISE r ( f ^ ) = ∫ 0 ∞ ( f ^ r ( x ) − f r ( x ) ) 2 d x .

The estimator with the smallest ISE was recorded as the winner.

 6. Results and Discussion

Kernel comparison at n = 4 0

Table 1. Kernel smoothing performance at n = 40 .

Kernel Win-Rate Mean ISE
KwNormal 0.490 0.03643
Gaussian 0.180 0.03701
Triangular 0.105 0.03763
KwEpan 0.100 0.05164
Rectangular 0.055 0.04204
Epanechnikov 0.070 0.03900
Biweight 0.000 0.03824
Cosine 0.000 0.03800

Kernel comparison at n = 8 0

Table 2. Kernel smoothing performance at n = 80 .

Kernel Win-Rate Mean ISE
KwNormal 0.480 0.02537
Gaussian 0.250 0.02595
Triangular 0.090 0.02762
KwEpan 0.095 0.03532
Epanechnikov 0.050 0.02650
Biweight 0.005 0.02701
Cosine 0.005 0.02682
Rectangular 0.025 0.02993

Kernel comparison at n = 1 5 0

Table 3. Kernel smoothing performance at n = 150 .

Kernel Win-Rate Mean ISE
KwNormal 0.615 0.01587
Gaussian 0.195 0.01808
KwEpan 0.115 0.02086
Triangular 0.035 0.01863
Epanechnikov 0.020 0.01957
Biweight 0.005 0.01906
Cosine 0.010 0.01889
Rectangular 0.005 0.02161

Kernel comparison at n = 3 0 0

Table 4. Kernel smoothing performance at n = 300 .

Kernel Win-Rate Mean ISE
KwNormal 0.630 0.01076
Gaussian 0.190 0.01241
KwEpan 0.120 0.01371
Triangular 0.035 0.01276
Epanechnikov 0.010 0.01342
Biweight 0.000 0.01307
Rectangular 0.015 0.01504
Cosine 0.000 0.01296

Kernel comparison at n = 6 0 0

Table 5. Kernel smoothing performance at n = 600 .

Kernel Win-Rate Mean ISE
KwNormal 0.605 0.00697
Gaussian 0.220 0.00808
KwEpan 0.140 0.00892
Triangular 0.025 0.00833
Epanechnikov 0.005 0.00879
Biweight 0.000 0.00855
Cosine 0.005 0.00847
Rectangular 0.000 0.01035

Kernel comparison at n = 1 0 0 0

Table 6. Kernel smoothing performance at n = 1000 .

Kernel Win-Rate Mean ISE
KwNormal 0.680 0.00477
Gaussian 0.155 0.00592
KwEpan 0.150 0.00602
Triangular 0.015 0.00607
Epanechnikov 0.000 0.00645
Biweight 0.000 0.00627
Cosine 0.000 0.00622
Rectangular 0.000 0.00837
7. Kernel Comparison Plot

Tables 1-6 present the comparison of mean integrated squared error (ISE) across different sample sizes for all competing kernel estimators. As the sample size increases, the ISE decreases for all kernels, reflecting the expected improvement in estimation accuracy. Figure 1 is the corresponding plot.

However, the Kumaraswamy-Normal (KwNormal) kernel consistently achieves the lowest ISE across all sample sizes. This indicates its superior ability to adapt to skewness and heavy-tailed contamination in the data. Unlike classical symmetric kernels, the KwNormal kernel incorporates flexible shape parameters that allow it to adjust to the underlying structure of the distribution.

Furthermore, the gap between the KwNormal kernel and traditional kernels such as the Gaussian and Epanechnikov kernels becomes more pronounced as the sample size increases. This highlights not only its robustness but also its scalability for larger datasets.

These results visually confirm the findings from the simulation tables, demonstrating that the proposed Kumaraswamy-Normal kernel provides a stable and consistently superior performance in density estimation.

Figure 1. Comparison of mean integrated squared error (ISE) across sample sizes for different kernel estimators.

 8. Conclusions

This study introduced the Kumaraswamy-Normal kernel as an adaptive extension of the classical Gaussian kernel for density estimation. By incorporating two shape parameters, the proposed kernel is able to effectively capture skewness and heavy-tailed behavior in data.

Theoretical analysis showed that the estimator retains desirable asymptotic properties, including consistency, asymptotic normality, and the optimal bandwidth rate. Simulation results further demonstrated that the KwNormal kernel consistently outperforms traditional kernels in terms of win-rate and mean ISE across all sample sizes.

Overall, the proposed kernel provides a flexible and robust alternative for non-parametric density estimation, particularly in the presence of skewed and contaminated data. This makes it a valuable tool for practical applications where classical kernel methods may be inadequate.

References Rosenblatt, M. (1956) Remarks on Some Nonparametric Estimates of a Density Function. TheAnnalsofMathematicalStatistics, 27, 832-837. https://doi.org/10.1214/aoms/1177728190 10.1214/aoms/1177728190https://doi.org/10.1214/aoms/1177728190 Rosenblatt, M. 1956 Remarks on Some Nonparametric Estimates of a Density Function The Annals of Mathematical Statistics 27 10.1214/aoms/1177728190 Parzen, E. (1962) On Estimation of a Probability Density Function and Mode. TheAnnalsofMathematicalStatistics, 33, 1065-1076. https://doi.org/10.1214/aoms/1177704472 10.1214/aoms/1177704472https://doi.org/10.1214/aoms/1177704472 Parzen, E. 1962 On Estimation of a Probability Density Function and Mode The Annals of Mathematical Statistics 33 10.1214/aoms/1177704472 Epanechnikov, V.A. (1969) Non-parametric Estimation of a Multivariate Probability Density. TheoryofProbability&ItsApplications, 14, 153-158. https://doi.org/10.1137/1114019 10.1137/1114019https://doi.org/10.1137/1114019 Epanechnikov, V.A. 1969 Non-parametric Estimation of a Multivariate Probability Density Theory of Probability & Its Applications 14 10.1137/1114019 Silverman, B.W. (1986) Density Estimation for Statistics and Data Analysis. Chapman & Hall. Silverman, B.W. 1986 Density Estimation for Statistics and Data Analysis Scott, D.W. (1992) Multivariate Density Estimation. Wiley. https://doi.org/10.1002/9780470316849 10.1002/9780470316849https://doi.org/10.1002/9780470316849 Scott, D.W. 1992 Multivariate Density Estimation 10.1002/9780470316849 Jones, M.C., Marron, J.S. and Sheather, S.J. (1996) A Brief Survey of Bandwidth Selection for Density Estimation. JournaloftheAmericanStatisticalAssociation, 91, 401-407. https://doi.org/10.1080/01621459.1996.10476701 10.1080/01621459.1996.10476701https://doi.org/10.1080/01621459.1996.10476701 Jones, M.C. Marron, J.S. Sheather, S.J. 1996 A Brief Survey of Bandwidth Selection for Density Estimation Journal of the American Statistical Association 91 10.1080/01621459.1996.10476701 Sheather, S.J. (2004) Density Estimation. StatisticalScience, 19, 588-597. https://doi.org/10.1214/088342304000000297 10.1214/088342304000000297https://doi.org/10.1214/088342304000000297 Sheather, S.J. 2004 Density Estimation Statistical Science 19 10.1214/088342304000000297 Adepoju, K.A., Chukwu, A. and Shittu, O.I. (2016) On the Development of an Exponentiated F Test for One-Way ANOVA in the Presence of Outlier(s). Mathematics and Statistics, 4, 62-69. Adepoju, K.A. Chukwu, A. Shittu, O.I. 2016 On the Development of an Exponentiated F Test for One-Way ANOVA in the Presence of Outlier(s) Mathematics and Statistics 4 Adepoju, K.A., Chukwu, A.U. and Shittu, O.I. (2016) On the Kumaraswamy Fisher Snedecor Distribution. MathematicsandStatistics, 4, 1-14. https://doi.org/10.13189/ms.2016.040101 10.13189/ms.2016.040101https://doi.org/10.13189/ms.2016.040101 Adepoju, K.A. Chukwu, A.U. Shittu, O.I. 2016 On the Kumaraswamy Fisher Snedecor Distribution Mathematics and Statistics 4 10.13189/ms.2016.040101