以RBF類神經網路為基礎之機器學習演算法研究

A Study on Machine Learning with Radial Basis Function Networks

歐昱言(Yu-Yen Ou)

指導教授 ： 歐陽彥正

國立臺灣大學/電機資訊學院/資訊工程學研究所/博士(2005年)

https://doi.org/10.6342/NTU.2005.00509

摘要

本論文主要是討論一系列使用RBF類神經網路 (Radial Basis Function Networks) 在機器學習 (Machine Learning) 領域的研究。
論文的第一個部分討論到如何用正規化程序 (regularization procedure) 有效率的建立一個RBF類神經網路。其中有兩個重要的問題，第一個問題是如何決定核心函數 (kernel function) 的個數與位置。第二個問題是如何決定核心函數組合成RBF類神經網路的權重。在這個論文，我用隨機與遞增式學習兩種方法來決定核心函數的位置，然後用正規化方法與 Cholesky 分解來決定各個核心函數的權重。實驗結果顯示這篇論文所使用的方法可以使用在機器學習與生物資訊領域，而且獲得不錯的結果。
第二個部分討論到一個新的核心密度預測 (kernel density estimation) 的演算法跟他的應用。這個演算法稱為 RVKDE (relaxed variable kernel density estimation) 是由我們實驗室團隊在近期所提出，並應用在許多方面，而我把他拿來應用在機器學習領域的兩個題目上，構成了這個論文的第二部分。

關鍵字

機器學習 ； 分類演算法 ； 生物資訊

並列摘要

This thesis reports a series of studies on machine learning with the radial basis function network (RBFN).

The first part of this thesis discusses how to construct an RBFN efficiently with the regularization procedure. In fact, construction of an RBFN with the regularization procedure involves two main issues. The first issue concerns the number of hidden nodes to be incorporated and where the centers of the associated kernel functions should be located. The second issue concerns how the links between the hidden layer and the output layer should be weighted.
For the first issue, this thesis discusses the effects with a random samples based approach and an incremental clustering based approach. For the second issue, this thesis elaborates the effects with the Cholesky decomposition employed. Experimental results show that an RBFN constructed with the approaches proposed in this thesis is able to deliver the same level of classification accuracy as the SVM and offers several important advantages. Finally, this thesis reports the experimental results with the QuickRBF package, which has been
developed based on the approaches proposed in this thesis, applied to bioinformatics problems.

The second study reported in this thesis concerns how the novel relaxed variable kernel density estimation (RVKDE) algorithm that our research team has recently proposed performs in data classification applications. The experimental results reveal that the classifier configured with the RVKDE algorithm is capable of delivering the same level of accuracy as the SVM, while enjoying some advantages in comparison with the SVM. In particular, the time complexity for construction of a classifier with the RVKDE algorithm is O(nlogn), where n is the number of samples in the training data set. This means that it is highly efficient to construct a classifier with the RVKDE algorithm, in comparison with the SVM algorithm. Furthermore, the RVKDE based classifier is able to carry
out data classification with more than two classes of samples in one single run. In other words, it does not need to invoke mechanisms such as one-against-one or one-against-all for handling data sets with more than two classes of samples.

The successful experiences with the RVKDE algorithm in data
classification applications then motivate the study presented next in this thesis. In Section 4.3, a RVKDE based data reduction approach for expediting the model selection process of the SVM is described. Experimental results show that, in comparison with the existing approaches, the data reduction based approach proposed in
this thesis is able to expedite the model selection process by a larger degree and cause a smaller degradation of prediction accuracy.

並列關鍵字

Machine Learning ； Data Classification ； RBF ； RBFN ； bioinformatics

參考文獻

[2] F. Belloir, A. Fache, and A. Billat. A general approach to construct rbf netbased

classifier. In Proceedings of the 7th European Symposium on Artificial

Neural Network, pages 399—404, 1999.

[3] J. Bentley. Multidimensional binary search trees used for associative searching.

[4] M. Bianchini, P. Frasconi, and M. Gori. Learning without local minima in radial