Skip to main content

Advertisement

SpringerLink
Log in

Recognition of splice-junction genetic sequences using random forest and Bayesian optimization

  • 1155T: Advanced machine learning algorithms for biomedical data and imaging
  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Recently, Bayesian Optimization (BO) provides an efficient technique for selecting the hyperparameters of machine learning models. The BO strategy maintains a surrogate model and an acquisition function to efficiently optimize the computation-intensive functions with a few iterations. In this paper, we demonstrate the utility of the BO to fine-tune the hyperparameters of a Random Forest (RF) model for a problem related to the recognition of splice-junction genetic sequences. Locating these splice-junctions prompts further understanding of the DNA splicing process. Specifically, the BO algorithm optimizes four RF hyperparameters: number of trees, number of splitting features, splitting criterion, and leaf size. The optimized RF model automatically selects the most predictive features of the training data. The dataset is obtained from the UCI machine learning repository where half of the records represent two different types of splice-junctions and the other half does not represent any splice-junction. Experimental results proved the advantage of the BO-RF with 99.96% and 97.34% training and test classification accuracies respectively. The results also demonstrated the ability of the RF model to select the most important features, ensuring the best possible results using Support Vector Machine (SVM), K-Nearest Neighbor (KNN), and decision tree (DT) models. Some practical procedures in model development and evaluation such as out-of-bag error and cross-validation approaches are also referred to.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Boulesteix A-L, Janitza S, Kruppa J, König IR (2012) Overview of random forest methodology and practical guidance with emphasis on computational biology and bioinformatics. Wiley Interdisciplinary Rev Data Min Knowl Discov 2(6):493–507

    Article  Google Scholar 

  2. Breiman L (2001) Random forests. Mach Learn 45(1):5–32

    Article  Google Scholar 

  3. Brochu E, Cora VM, De Freitas N (2010) A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning. arXiv preprint arXiv:1012.2599

  4. Cervantes J, Chau AL, Espinoza A T, Castilla JSR (2011) Fast Splice Site Classification Using Support Vector Machines in Imbalanced Data-sets. In Proceedings of the International Conference on Bioinformatics & Computational Biology (BIOCOMP), p. 1. The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp)

  5. Cooper TA, Wan L, Dreyfuss G (2009) RNA and disease. Cell 136(4):777–793

    Article  Google Scholar 

  6. Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273–297

    MATH  Google Scholar 

  7. Cox DD, John S (1997) SDO: A statistical method for global optimization. In: Alexandrov NM, Hussaini MY (eds) Multidisciplinary Design Optimization: State of the Art, pp. 315–329

  8. Damaševicius R (2008) Splice site recognition in DNA sequences using k-mer frequency based mapping for support vector machine with power series kernel. In 2008 International Conference on Complex, Intelligent and Software Intensive Systems, pp. 687–692. IEEE

  9. Dewancker I, McCourt M, Clark S (2016) Bayesian optimization for machine learning: A practical guidebook. arXiv preprint arXiv:1612.04858

  10. Elyan E, Gaber MM (2017) A genetic algorithm approach to optimising random forests applied to class engineered data. Inf Sci 384:220–234

    Article  Google Scholar 

  11. Faris H, Aljarah I, Al-Shboul B (2016) A hybrid approach based on particle swarm optimization and random forests for e-mail spam filtering. In International Conference on Computational Collective Intelligence, pp. 498–508. Springer, Cham

  12. Htike ZZ, Win SL (2013) Classification of eukaryotic splice-junction genetic sequences using averaged one-dependence estimators with subsumption resolution. Procedia Comput Sci 23:36–43

    Article  Google Scholar 

  13. Jiang F, Jiang Y, Zhi H, Dong Y, Li H, Ma S, Wang Y, Dong Q, Shen H, Wang Y (2017) Artificial intelligence in healthcare: past, present and future. Stroke Vasc Neurol 2(4):230–243

    Article  Google Scholar 

  14. Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J Glob Optim 13(4):455–492

    Article  MathSciNet  Google Scholar 

  15. Kaur P, Kumar R, Kumar M (2019) A healthcare monitoring system using random forest and internet of things (IoT). Multimed Tools Appl 78(14):19905–19916

    Article  Google Scholar 

  16. Kushner HJ (1964) A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise. J Basic Eng 86(1):97–106

    Article  Google Scholar 

  17. Lévesque J-C (2018) Bayesian hyperparameter optimization: overfitting, ensembles and conditional spaces

  18. Lin N, Noe D, He X, Phoam H (2006) Tree-based methods and their applications. Springer Handb Eng Stat London: Springer-Verlag:551–570

  19. Lorena A C, Batista GEAPA, de Leon Ferreira ACP, Monard MC (2002) Splice Junction Recognition using Machine Learning Techniques. In WOB, pp. 32–39

  20. Luts J, Ojeda F, Van de Plas R, De Moor B, Van Huffel S, Suykens JAK (2010) A tutorial on support vector machine-based methods for classification problems in chemometrics. Anal Chim Acta 665(2):129–145

    Article  Google Scholar 

  21. Mathworks C (2018) MATLAB documentation

  22. Meher PK, Sahu TK, Rao AR (2016) Prediction of donor splice sites using random forest with a new sequence encoding approach. BioData Min 9(1):4

    Article  Google Scholar 

  23. Meher PK, Sahu TK, Rao AR, Wahi SD (2016) Identification of donor splice sites using support vector machine: a computational approach based on positional, compositional and dependency features. Algorithms Mol Biol 11(1):16

    Article  Google Scholar 

  24. Minasny B, McBratney AB (2005) The Matérn function as a general model for soil variograms. Geoderma 128(3–4):192–207

    Article  Google Scholar 

  25. Pashaei E, Ozen M, Aydin N (2017) Splice site identification in human genome using random forest. Heal Technol 7(1):141–152

    Article  Google Scholar 

  26. Probst P (2019) Hyperparameters, tuning and meta-learning for random forest and other machine learning algorithms. PhD diss, lmu

  27. Rácz A, Bajusz D, Héberger K (2018) Modelling methods and cross-validation variants in QSAR: a multi-level analysis$. SAR QSAR Environ Res 29(9):661–674

    Article  Google Scholar 

  28. Rasmussen CE (2006) CKI Williams Gaussian processes for machine learning

  29. Snoek J, Larochelle H, Adams RP (2012) Practical bayesian optimization of machine learning algorithms. In Advances in neural information processing systems, pp. 2951–2959

  30. Stranger BE, Dermitzakis ET (2006) From DNA to RNA to disease and back: the'central dogma'of regulatory disease variation. Hum Genomics 2(6):1–8

    Article  Google Scholar 

  31. The Machine Learning Database Repository (n.d.) https://archive.ics.uci.edu/ml/datasets/ Molecular+Biology+(Splice-junction+Gene+Sequences)

  32. Zeng Y, Yuan H, Yuan Z, Chen Y (2019) A high-performance approach for predicting donor splice sites based on short window size and imbalanced large samples. Biol Direct 14(1):6

    Article  Google Scholar 

  33. Zhang S (2020) Cost-sensitive KNN classification. Neurocomputing 391:234–242

    Article  Google Scholar 

  34. Zhang Y, Liu X, MacLeod J, Liu J (2018) Discerning novel splice junctions derived from RNA-seq alignment: a deep learning approach. BMC Genomics 19(1):971

    Article  Google Scholar 

  35. Ziegler A, König IR (2014) Mining data with random forests: current options for real-world applications. Wiley Interdisciplinary Rev Data Min Knowl Discov 4(1):55–63

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computers Science Department, Al-Balqa Applied University, Ajloun College, Ajloun, Jordan

    Abdel Karim Baareh

  2. College of Engineering, Prince Sattam Bin Abdulaziz University, Wadi Eldawasir, Kingdom of Saudi Arabia

    Alaa Elsayad

  3. Computers and Systems Department, Electronics Research Institute, Giza, 12622, Egypt

    Alaa Elsayad

  4. Systems Engineering Department, King Fahd University of Petroleum and Minerals, Dhahran, 31261, Kingdom of Saudi Arabia

    Mujahed Al-Dhaifallah

Authors
  1. Abdel Karim Baareh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alaa Elsayad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mujahed Al-Dhaifallah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alaa Elsayad.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Baareh, A.K., Elsayad, A. & Al-Dhaifallah, M. Recognition of splice-junction genetic sequences using random forest and Bayesian optimization. Multimed Tools Appl 80, 30505–30522 (2021). https://doi.org/10.1007/s11042-021-10944-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-021-10944-7

Keywords

Search

Navigation