Affiliation:
1. Imperial College London, London, UK
Abstract
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an open question how an accurate solution to a multi-class problem can be obtained by using a logic based learning method. In this paper we present a novel logic based approach to solve complex and challenging multi-class classification problems by focusing on a key task, namely protein fold recognition. Our technique is based on the use of large margin methods in conjunction with the kernels constructed from first order rules induced by an ILP system. The proposed approach learns a multi-class classifier by using a divide and conquer reduction strategy that splits multi-classes into binary groups and solves each individual problem recursively hence generating an underlying decision list structure. The method is applied to assigning protein domains to folds. Experimental evaluation of the method demonstrates the efficacy of the proposed approach to solving multi-class classification problems in bioinformatics.
Publisher
Association for Computing Machinery (ACM)
Reference13 articles.
1. PFRES: protein fold classification by using evolutionary information and predicted secondary structure
2. On the algorithmic implementations of multiclass kernel-based vector machines;Crammer K.;Journal of Machine Learning Research, (2):265--292,2001
3. Multi-class protein fold recognition using support vector machines and neural networks
4. T. Joachims. Making large{scale SVM learning practical. In B. Schölkopf C. J. C. Burges and A. J. Smola editors Advances in Kernel Methods | Support Vector Learning pages 169--184 Cambridge MA 1999. MIT Press. T. Joachims. Making large{scale SVM learning practical. In B. Schölkopf C. J. C. Burges and A. J. Smola editors Advances in Kernel Methods | Support Vector Learning pages 169--184 Cambridge MA 1999. MIT Press.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献