Evidence map›Paper›PMID 40989467›Full record

ArticlePeerJ. Computer science2025

A new machine learning method for rainfall classification: temporal random tree.

Kokten Ulas Birant, Bita Ghasemkhani, Özlem Varlıklar, Derya Birant

Abstract read
In one paragraph

Article in PeerJ. Computer science, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

4 authors.

Kokten Ulas BirantDepartment of Computer Engineering, Dokuz Eylül University, Izmir, Turkey.
Bita GhasemkhaniGraduate School of Natural and Applied Sciences, Dokuz Eylül University, Izmir, Turkey.
Özlem VarlıklarDepartment of Computer Engineering, Dokuz Eylül University, Izmir, Turkey.ORCID 0000-0001-6415-0698
Derya BirantDepartment of Computer Engineering, Dokuz Eylül University, Izmir, Turkey.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Traditional classification algorithms usually assume that all samples in a dataset contribute equally to the training of a machine learning model, which is not always the case. In fact, samples in temporal data, such as precipitation data, may not have equal importance; more recent samples contain more accurate and useful information than earlier ones. To address this issue, the article proposes a novel method, named temporal random tree (TRT), in which recent training samples have a greater impact on the model's decision-making process. It divides the dataset into temporal segments, assigns higher weights to classifiers trained on more recent data, and employs a weighted majority voting strategy. The experiments demonstrated the effectiveness of TRT on the real-world WeatherAUS precipitation dataset, achieving an accuracy of 83.54%, which represents a 5% improvement over the traditional random tree method. Additionally, our method achieved an average improvement of 9.98% compared to state-of-the-art results in the recent literature. These findings highlight TRT's potential as a valuable method for spatiotemporal rainfall classification.

Indexed as

Artificial intelligenceClassificationMachine learningPrecipitation predictionRainfall classificationRain/no-rainRandom treeSpatiotemporal dataTemporal weightingWeather pattern

Identifiers

PMID40989467
PMCPMC12453857

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.