Results 21 to 30 of about 2,921,645 (302)
Predicting the Pillar Stability of Underground Mines with Random Trees and C4.5 Decision Trees
Applied Sciences, 2020 Predicting pillar stability in underground mines is a critical problem because the instability of the pillar can cause large-scale collapse hazards. To predict the pillar stability for underground coal and stone mines, two new models (random tree and C4 ...
Mahmood Ahmad +5 more
doaj +1 more source
Journal of Hydroinformatics, 2023 In this study, the vote algorithm used to improve the performances of three machine-learning models including M5Prime (M5P), random forest (RF), and random tree (RT) is developed (i.e. V-M5P, V-RF, and V-RT).
Javad Hatamiafkoueieh +8 more
doaj +1 more source
Parking on a Random Tree [PDF]
Combinatorics, Probability and Computing, 2018 Consider a uniform random rooted labelled tree on n vertices. We imagine that each node of the tree has space for a single car to park. A number m ≤ n of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path towards the root until it ...
Christina Goldschmidt, Michal Przykucki
openaire +4 more sources
Random Trees in Random Graphs [PDF]
Proceedings of the American Mathematical Society, 1988 We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled
Bender, E. A., Wormald, N. C.
openaire +2 more sources
Random assignment and shortest path problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by
Johan Wästlund
doaj +1 more source
Random projection tree similarity metric for SpectralNet
Array, 2023 SpectralNet is a graph clustering method that uses neural network to find an embedding that separates the data. So far it was only used with k-nn graphs, which are usually constructed using a distance metric (e.g., Euclidean distance).
Mashaan Alshammari +3 more
doaj +1 more source
Jurnal Teknologi Informasi dan Ilmu Komputer, 2021 Penelitian ini menerangkan analisis decision tree J48, REPTree dan Random Tree dengan menggunakan metode fuzzy Tsukamoto dalam penentuan jumlah produksi minyak kelapa sawit di perusahaan PT Tapiana Nadenggan dengan tujuan untuk mengetahui decision tree ...
Tundo Tundo, Shofwatul 'Uyun
doaj +1 more source
Mathematics, 2020 The amount of water allocated to irrigation systems is significantly greater than the amount allocated to other sectors. Thus, irrigation water demand management is at the center of the attention of the Ministry of Agriculture and Forestry in Turkey.
Mohammad Taghi Sattari +2 more
doaj +1 more source
Parking on a Random Tree [PDF]
Journal of Statistical Physics, 2008 Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking RSA: at every vertex of the tree a particle (or car) arrives with rate one.
Dehling, H. G. +2 more
openaire +4 more sources
Discrete Applied Mathematics, 2019 Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support we show that $1.41805386^n \le c(n) \le 1.41959881^n$. Moreover, there is a strong indication that, in fact, $c(n) \
Bogumil Kaminski, Pawel Pralat
openaire +2 more sources