arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0709.2760stat.ML
收藏

基于核密度估计的有监督机器学习

Supervised Machine Learning with a Novel Kernel Density Estimator

Yen-Jen Oyang, Darby Tien-Hao Chang, Yu-Yen Ou, Hao-Geng Hung, Chih-Peng Wu, Chien-Yu Chen

摘要:

近年来,核密度估计已被计算机科学家用来建模机器学习问题。基于核密度估计的方法由于构造分类器的O(n)或O(n*log(n))的低时间复杂度而受到关注,其中n是采样实例的数量。关于核密度估计器的设计,一个基本问题是逐点均方误差(MSE)和/或积分均方误差(IMSE)随着采样实例数的增加而减小的速度有多快。在这篇文章中,它表明,与建议的核函数是可行的,使点态MSE的密度估计收敛于O(n^-2/3)的向量空间的维数无关,只要在感兴趣的点的概率密度函数满足一定的条件。

英文摘要:

In recent years, kernel density estimation has been exploited by computer scientists to model machine learning problems. The kernel density estimation based approaches are of interest due to the low time complexity of either O(n) or O(n*log(n)) for constructing a classifier, where n is the number of sampling instances. Concerning design of kernel density estimators, one essential issue is how fast the pointwise mean square error (MSE) and/or the integrated mean square error (IMSE) diminish as the number of sampling instances increases. In this article, it is shown that with the proposed kernel function it is feasible to make the pointwise MSE of the density estimator converge at O(n^-2/3) regardless of the dimension of the vector space, provided that the probability density function at the point of interest meets certain conditions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑