Results 41 to 50 of about 6,285,799 (375)
Coronary Artery Disease Diagnosis: Ranking the Significant Features Using Random Trees Model
, 2020 Heart disease is one of the most common diseases in middle-aged citizens. Among the vast number of heart diseases, coronary artery disease (CAD) is considered a common cardiovascular disease with a high death rate.
Javad Hassannataj Joloudari +8 more
semanticscholar +1 more source
On the Zagreb index of random m-oriented recursive trees [PDF]
Transactions on Combinatorics, 2023 The main goal of this paper is to study the modified $F$-indices (modified first Zagreb index and modified forgotten topological index) of random $m$-oriented recursive trees (RMORTs).
Ramin Kazemi
doaj +1 more source
Trees with product-form random weights [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We consider growing random recursive trees in random environment, in which at each step a new vertex is attached according to a probability distribution that assigns the tree vertices masses proportional to their random weights.The main aim of the paper ...
Konstantin Borovkov, Vladimir Vatutin
doaj +1 more source
Classification Under Streaming Emerging New Classes: A Solution Using Completely-Random Trees [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2016 This paper investigates an important problem in stream mining, i.e., classification under streaming emerging new classes or SENC. The SENC problem can be decomposed into three subproblems: detecting emerging new classes, classifying known classes, and ...
Xin Mu, K. Ting, Zhi-Hua Zhou
semanticscholar +1 more source
Election algorithms with random delays in trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied.
Jean-François Marckert +2 more
doaj +1 more source
Partial match queries in relaxed K-dt trees [PDF]
, 2017 The study of partial match queries on random hierarchical multidimensional data structures dates back to Ph. Flajolet and C. Puech’s 1986 seminal paper on partial match retrieval.
Duch Brown, Amalia +1 more
core +1 more source
The height of random binary unlabelled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
doaj +1 more source
Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees [PDF]
Mathematics Interdisciplinary Research, 2021 For a simple graph G, the Gordon-Scantlebury index of G is equal to the number of paths of length two in G, and the Platt index is equal to the total sum of the degrees of all edges in G.
Ramin Kazemi
doaj +1 more source
Random trees constructed by aggregation [PDF]
, 2016 We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree.
Curien, Nicolas, Haas, Bénédicte
core +3 more sources
Random Hyperplane Search Trees
SIAM Journal on Computing, 2009 Summary: A hyperplane search tree is a binary tree used to store a set \(S\) of \(n\) \(d\)-dimensional data points. In a random hyperplane search tree for \(S\), the root represents a hyperplane defined by \(d\) data points drawn uniformly at random from \(S\).
Devroye, L, King, J, McDiarmid, C
openaire +1 more source