Protein Fold Recognition with Adaptive Local Hyperplane Algorithm

Publication Type:
Conference Proceeding
IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (IEEE CIBCB), 2009, pp. 1 - 4
Issue Date:
Filename Description Size
Thumbnail2009002175OK.pdf109.77 kB
Adobe PDF
Full metadata record
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.
Please use this identifier to cite or link to this item: