Skip to main content

Advertisement

Log in

MBFerns: classification and extraction of actionable knowledge using Multi-Branch Ferns-based Naive Bayesian classifier

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Classification is one of the tasks that are most frequently carried out in real world applications. A large number of techniques have been developed based on statistics and machine learning methods. These classification techniques usually suffer from various limitations, and there is no single technique that works best for all classification problems. Two major drawbacks in existing techniques are accuracy and lack of actionable knowledge from results. To overcome these problems, a novel algorithm called Multi-Branch Ferns (MBFerns), and R-package has been developed to build multi-branch ferns (multi-branch decision tree) and to generate key features from training dataset employing Naïve Bayesian probabilistic model as classifier. The proposed algorithm performs well for general classification problems and extracting actionable knowledge from training data. The proposed method has been evaluated with best existing classification methods namely, Random Forest (RF), Support Vector Machine (SVM) and Artificial Neural Network (ANN) on medical benchmark data, available at https://archive.ics.uci.edu/ml/datasets/ such as Breast Cancer, Cryotherapy, Cardiotocography, Dermatology, Echocardiogram, EEG Eye State, Fertility, Haberman's Survival, Hepatitis, Indian Liver Patient, Mammographic Mass, Parkinsons, etc. Detailed investigation on proposed Multi-Branch Ferns (MBFerns) with respect to accuracy, time, space complexity and knowledge discovery has also been presented.

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

Access this article

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

Similar content being viewed by others

References

Download references

Acknowledgments

Authors are thankful to Indian Council of Agricultural Research, Ministry of Agriculture and Farmers’ Welfare, Govt. of India for providing financial assistance. The authors are very grateful to the anonymous reviewers for their insightful comments to improve the manuscript

Funding

CABin scheme grant (FN/Agril-Edn./4-1/2013-A&P) Indian Council of Agricultural Research, Ministry of Agriculture and Farmers’ Welfare, Govt. of India.

Author information

Authors and Affiliations

Authors

Contributions

Angadi UB and Anil Rai conceived and designed the method; Angadi UB implemented and developed R-package; Uma G and Angadi UB analyzed the algorithm and R-package with benchmark data; Angadi UB and Anil Rai wrote the paper. All the authors read and approved the manuscript.

Corresponding author

Correspondence to U. B. Angadi.

Ethics declarations

Conflict of interest

The author declares that he has no conflict of interest.

Informed consent

Not applicable.

Codes available at URL

http://webtom.cabgrid.res.in/codes/mbferns/ and https://github.com/ubagithub/mbFerns

Ethics approval

Not applicable.

Additional information

Publisher's Note

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

Supplementary Information

Below is the link to the electronic supplementary material.

Supplementary file1 (PDF 233 kb)

Supplementary file2 (PDF 1195 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Angadi, U.B., Rai, A. & Uma, G. MBFerns: classification and extraction of actionable knowledge using Multi-Branch Ferns-based Naive Bayesian classifier. Soft Comput 25, 8357–8369 (2021). https://doi.org/10.1007/s00500-021-05759-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-021-05759-5

Keywords

Navigation