Results 11 to 20 of about 249,007 (264)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Aldous
openaire +7 more sources
We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, or to its grandparent, etc; all nodes from the target node to its most ancient ancestor are equiprobable destinations.
Ben-Naim, E., Krapivsky, P. L.
openaire +2 more sources
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
Random Trees in Random Graphs [PDF]
We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled n n -vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n n increases, and the set of trees referred to as "almost all" depends
Bender, E. A., Wormald, N. C.
openaire +2 more sources
Predicting the Pillar Stability of Underground Mines with Random Trees and C4.5 Decision Trees
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
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
Random assignment and shortest path problems [PDF]
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
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
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
Random Generation of Nondeterministic Finite-State Tree Automata [PDF]
Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable.
Thomas Hanneforth +2 more
doaj +1 more source

