Radial basis and support vector machine algorithms for approximating discrete data
The aim of this thesis is to demonstrate how the versatility of radial basis functions can be used to construct algorithms for approximating discrete sets of scattered data. In many cases, these algorithms have been constructed by blending together existing methods or by extending algorithms that ex...
| Main Author: | |
|---|---|
| Published: |
University of Huddersfield
2002
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.273723 |