Identification of DNA-Binding Proteins via Hypergraph Based Laplacian Support Vector Machine

Background: The identification of DNA binding proteins (DBP) is an important research field. Experiment-based methods are time-consuming and labor-intensive for detecting DBP. Objective: To solve the problem of large-scale DBP identification, some machine learning methods are proposed. However, these methods have insufficient predictive accuracy. Our aim is to develop a se-quence-based machine learning model to predict DBP. Methods: In our study, we extracted six types of features (including NMBAC, GE, MCD, PSSM-AB, PSSM-DWT, and PsePSSM) from protein sequences. We used Multiple Kernel Learning based on Hil -bert-Schmidt Independence Criterion (MKL-HSIC) to estimate the optimal kernel. Then, we construct-ed a hypergraph model to describe the relationship between labeled and unlabeled samples. Finally, La-placian Support Vector Machines (LapSVM) is employed to train the predictive model. Our method is tested on PDB186, PDB1075, PDB2272 and PDB14189 data sets. Results: Compared with other methods, our model achieved best results on benchmark data sets. Conclusion: The accuracy of 87.1% and 74.2% are achieved on PDB186 (Independent test of PDB1075) and PDB2272 (Independent test of PDB14189), respectively.

Automated summary

In this study, we developed a sequence-based machine learning model to predict DNA binding proteins (DBP). By extracting six types of features and using multiple kernel learning and hypergraph model, our model achieved good predictive accuracy on multiple datasets.