Introduction: Accurate identification of forest tree species is essential for sustainable forest management, biodiversity assessment, and environmental monitoring. Urban forests, in particular, ...
The present study aimed at comparing predictive performance of some data mining algorithms (CART, CHAID, Exhaustive CHAID, MARS, MLP, and RBF) in biometrical data of Mengali rams. To compare the ...
Introduction: The unmanned aerial vehicle -based light detection and ranging (UAV-LiDAR) can quickly acquire the three-dimensional information of large areas of vegetation, and has been widely used in ...
1 Computer Science Department, Babcock University, Ilishan-Remo, Ogun State, Nigeria. 2 Computer Science Department, Adeleke University, Ede, Osun State, Nigeria. 3 Department of Applied Mathematics, ...
This repository contains solutions and explanations for working with Binary Search Trees (BST). It includes algorithmic implementations and step-by-step traces for various tasks. A detailed ...
Merkle trees, also known as hash trees or binary hash trees, are tree-like data structures used in computer science. They are named after their inventor, Ralph Merkle, who proposed the concept in 1979 ...
Abstract: Alphabetic codes and binary search trees are combinatorial structures that abstract search procedures in ordered sets endowed with probability distributions. In this paper, we design new ...
Decision tree is an effective supervised learning method for solving classification and regression problems. This article combines the Pearson correlation coefficient with the CART decision tree, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results