计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (31): 1-4.

• 博士论坛 • 上一篇    下一篇

快速核密度估计算法研究进展

尹训福1,郝志峰2,杨晓伟2

  

  1. 1.华南理工大学 计算机科学与工程学院,广州 510640
    2.华南理工大学 数学科学学院,广州 510640
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-01 发布日期:2007-11-01
  • 通讯作者: 尹训福

Review of fast Kernel density estimation algorithms

YIN Xun-fu1,HAO Zhi-feng2,YANG Xiao-wei2   

  1. 1.College of Computer Science and Engineering,South China University of Technology,Guangzhou 510640,China
    2.School of Mathematical Science,South China University of Technology,Guangzhou 510640,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-11-01 Published:2007-11-01
  • Contact: YIN Xun-fu

摘要: 作为当前最先进有效的密度估计算法,核密度估计(KDE)得到了广泛的研究。但是其二次的计算复杂度严重阻碍了KDE在具有海量高维数据的实际问题中的应用。为了排除算法计算性能上的障碍,研究者从不同角度提出了多种解决方案。在简要介绍KDE基本算法的基础上,简要分析了近年来提出的一些KDE的快速计算和逼近算法,以便为进一步的研究提供一定的支持与帮助。

Abstract: As the most effective and powerful nonparametric density estimation technique,Kernel Density Estimation(KDE) has been widely analyzed.However,the practical use of KDE is not widespread because of high computational complexity due to the intensive use of the available data.In order to surmount this computational difficulty,researchers have proposed several schemes from different points of view.In this paper,after the brief introduction of conventional KDE,we analyze a few classes of fast KDE algorithms for the sake of further advance.