Depth-Latency Tradeoffs in Multicast Tree Algorithms

2007 ◽  
Author(s):  
Michael T. Helmick ◽  
Fred S. Annexstein
Keyword(s):  
Multicast Tree ◽  
Tree Algorithms

scholarly journals Preconditioning methods based on spanning tree algorithms

2021 ◽  
Vol 1715 ◽  
pp. 012005
Author(s):  
D V Perevozkin ◽  
G A Omarova
Keyword(s):  
Spanning Tree ◽  
Tree Algorithms

scholarly journals Software Benchmark—Classification Tree Algorithms for Cell Atlases Annotation Using Single-Cell RNA-Sequencing Data

2021 ◽  
Vol 12 (2) ◽  
pp. 317-334
Author(s):  
Omar Alaqeeli ◽  
Li Xing ◽  
Xuekui Zhang
Keyword(s):  
Single Cell ◽  
Rna Sequencing ◽  
Classification Tree ◽  
Area Under The Curve ◽  
Data Sets ◽  
Sequencing Data ◽  
Single Cell Rna Sequencing ◽  
Tree Algorithms ◽  
R Packages

Classification tree is a widely used machine learning method. It has multiple implementations as R packages; rpart, ctree, evtree, tree and C5.0. The details of these implementations are not the same, and hence their performances differ from one application to another. We are interested in their performance in the classification of cells using the single-cell RNA-Sequencing data. In this paper, we conducted a benchmark study using 22 Single-Cell RNA-sequencing data sets. Using cross-validation, we compare packages’ prediction performances based on their Precision, Recall, F1-score, Area Under the Curve (AUC). We also compared the Complexity and Run-time of these R packages. Our study shows that rpart and evtree have the best Precision; evtree is the best in Recall, F1-score and AUC; C5.0 prefers more complex trees; tree is consistently much faster than others, although its complexity is often higher than others.

Sign in / Sign up

Export Citation Format

Share Document