Evidence map›Paper›PMID 33854542›Full record

ArticleComputational intelligence and neuroscience2021

A New Random Forest Algorithm Based on Learning Automata.

Mohammad Savargiv, Behrooz Masoumi, Mohammad Reza Keyvanpour

Abstract read
In one paragraph

Article in Computational intelligence and neuroscience, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 22 papers.

0numbers the graph read from it
0cells of the map it votes in
22citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

22 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. [Recent research on machine learning in the diagnosis and treatment of necrotizing enterocolitis in neonates].Zhongguo dang dai er ke za zhi = Chinese journal of contemporary pediatrics · 2023
    Article
  12. Article
  13. Review
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Deep Learning-Based Classification of Spoken English Digits.Computational intelligence and neuroscience · 2022
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Mohammad SavargivFaculty of Computer and Information Technology Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.ORCID https://orcid.org/0000-0001-5229-0589
Behrooz MasoumiFaculty of Computer and Information Technology Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.ORCID https://orcid.org/0000-0003-2314-283X
Mohammad Reza KeyvanpourDepartment of Computer Engineering, Alzahra University, Tehran, Iran.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The goal of aggregating the base classifiers is to achieve an aggregated classifier that has a higher resolution than individual classifiers. Random forest is one of the types of ensemble learning methods that have been considered more than other ensemble learning methods due to its simple structure, ease of understanding, as well as higher efficiency than similar methods. The ability and efficiency of classical methods are always influenced by the data. The capabilities of independence from the data domain, and the ability to adapt to problem space conditions, are the most challenging issues about the different types of classifiers. In this paper, a method based on learning automata is presented, through which the adaptive capabilities of the problem space, as well as the independence of the data domain, are added to the random forest to increase its efficiency. Using the idea of reinforcement learning in the random forest has made it possible to address issues with data that have a dynamic behaviour. Dynamic behaviour refers to the variability in the behaviour of a data sample in different domains. Therefore, to evaluate the proposed method, and to create an environment with dynamic behaviour, different domains of data have been considered. In the proposed method, the idea is added to the random forest using learning automata. The reason for this choice is the simple structure of the learning automata and the compatibility of the learning automata with the problem space. The evaluation results confirm the improvement of random forest efficiency.

Indexed as

AlgorithmsLearning

Identifiers

PMID33854542
PMCPMC8019375

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.