Parallel Decision Tree Search
Parallel Decision Tree Search is a parallel search algorithm that belongs to the class of decision tree-based methods, distinguished by its simultaneous exploration of multiple branches within a decision tree structure to accelerate the search process in parallel computing environments.
7
Publications
1.3K
Citations
19
Authors
11
Institutions
Publications per year
2017–2026
3
Parents
7
SPRINT: A Scalable Parallel Classifier for Data Mining
John Shafer, Rakesh Agrawal, Manish Mehta · 1996 · 782 citations
1–5 of 7
19
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 19
11
Dalian University of Technology
Dalian, China
2 h-index
3 publications
683 citations

Dalian Maritime University
Dalian, China
2 h-index
2 publications
350 citations
Queen's University
Kingston, Canada
1 h-index
3 publications
150 citations

Sookmyung Women's University
Seoul, South Korea
1 h-index
2 publications
68 citations
Bell (Canada)
Montreal, Canada
1 h-index
1 publications
50 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
1 h-index
4 publications
44 citations
Instituto Tecnológico de Veracruz
Veracruz, Mexico
1 h-index
1 publications
42 citations
Universidad Juárez Autónoma de Tabasco
Villahermosa, Mexico
1 h-index
1 publications
42 citations
1–8 of 11
1 publications · 333 citations
1
h-index
1 publications · 42 citations
1
h-index
1 publications · 34 citations
1
h-index
1 publications · 17 citations
1
h-index
TPAMI · 1 publications · 50 citations
1
h-index
1–5