access icon free Epanechnikov kernel for incomplete data

The Epanechnikov kernel (EK) is a popular kernel function that has achieved promising results in many machine learning applications. Although the EK is widely used, its basic formulation requires fully observed input feature vectors. A method is proposed to estimate the EK when these input vectors are only partially observed, i.e. some of its features are missing. In the proposed method, named expected EK, the expected value of the kernel function is estimated given the distribution of the data and the observed values of the feature vectors.

Inspec keywords: data handling; learning (artificial intelligence)

Other keywords: observed values; input feature vectors; kernel function; machine learning applications; feature vectors; incomplete data; Epanechnikov kernel

Subjects: Data handling techniques; Learning in AI (theory)

References

    1. 1)
    2. 2)
      • 10. Marc, G.G.: ‘Skew-Elliptical distributions and their applications: journey beyond normality’ (Chapman and Hall/CRC, Boca Raton, FL, USA, 2004).
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
      • 1. Ong, C.S., Mary, X., Canu, S., et al: ‘Learning with non-positive kernels’. Proc. of the Twenty-First Int. Conf. on Machine Learning, Banff, Canada, July 2004, p. 81.
    9. 9)
      • 3. Mierswa, I.: ‘Evolutionary learning with kernels: a generic solution for large margin problems’. Proc. of the 8th Annual Conf. on Genetic and Evolutionary Computation, Seattle, WA, USA, July 2006, pp. 15531560.
    10. 10)
      • 9. Johnson, N., Kotz, S., Balakrishnan, N.: ‘Continuous univariate distributions’ (Wiley, New York, NY, USA, 1995).
    11. 11)
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2017.0507
Loading

Related content

content/journals/10.1049/el.2017.0507
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading