Machine Learning
An introduction to support Vector Machines: and other kernel-based learning methods
An introduction to support Vector Machines: and other kernel-based learning methods
Pattern Recognition Letters
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Improving RBF-DDA Performance on Optical Character Recognition through Parameter Selection
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
Predicting breast cancer survivability: a comparison of three data mining methods
Artificial Intelligence in Medicine
LIBSVM: A library for support vector machines
ACM Transactions on Intelligent Systems and Technology (TIST)
Fast minimization of structural risk by nearest neighbor rule
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
The market demand for dental implants is growing at a significant pace. In practice, some dental implants do not succeed. Important questions in this regard concern whether machine learning techniques could be used to predict whether an implant will be successful and which are the best techniques for this problem. This paper presents a comparative study on machine learning techniques for prediction of success of dental implants. The techniques compared here are: (a) constructive RBF neural networks (RBF-DDA), (b) support vector machines (SVM), (c) k nearest neighbors (kNN), and (d) a recently proposed technique, called NNSRM, which is based on kNN and the principle of structural risk minimization. We present a number of simulations using real-world data. The simulations were carried out using 10-fold cross-validation and the results show that the methods achieve comparable performance, yet NNSRM and RBF-DDA produced smaller classifiers.