Letters: Adaptive local hyperplane classification
Neurocomputing
Face recognition with adaptive local hyperplane algorithm
Pattern Analysis & Applications
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Margin-based ensemble classifier for protein fold recognition
Expert Systems with Applications: An International Journal
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
Using rotation forest for protein fold prediction problem: an empirical study
EvoBIO'10 Proceedings of the 8th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
A novel approach to protein structure prediction using PCA or LDA based extreme learning machines
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part IV
Protein fold recognition with a two-layer method based on SVM-SA, WP-NN and C4.5 TLM-SNC
International Journal of Data Mining and Bioinformatics
Hi-index | 0.00 |
Protein fold recognition task is important for understanding the biological functions of proteins. The adaptive local hyperplane (ALH) algorithm has been shown to perform better than many other renown classifiers including support vector machines, K-nearest neighbor, linear discriminant analysis, K-local hyperplane distance nearest neighbor algorithms and decision trees on a variety of data sets. In this paper, we apply the ALH algorithm to well-known data sets on protein fold recognition task without sequence similarity from Ding and Dubchak (2001). The results obtained demonstrate that the ALH algorithm outperforms all the seven other very well known and established benchmarking classifiers applied to same data sets.