Parallel Tree Partitioning is a computational method that belongs to the class of parallel algorithms for tree-structured data, distinguished by its strategy of decomposing a tree into disjoint subtrees or segments that can be processed concurrently across multiple processing units to optimize performance in distributed or shared-memory environments.
22
Publications
1K
Citations
72
Authors
38
Institutions
Publications per year
2017–2026
4
Parents
Publications
22
Parallel Formulations of Decision-Tree Classification Algorithms
Anurag Srivastava, Eui-Hong Han, Vipin Kumar et al. · Data Mining and Knowledge Discovery · 1999 · 110 citations
A Communication-Efficient Parallel Algorithm for Decision Tree
Qi Meng, Guolin Ke, Taifeng Wang et al. · arXiv (Cornell University) · 2016 · 69 citations · Full text
1–5 of 22
Authors
72
- YZ
2
h-index
- WC
2
h-index
- EH
2
h-index
- DC
2
h-index
- WZ
2
h-index
1–5 of 72
Institutions
38
Tsinghua University
Beijing, China
3 h-index
11 publications
1.9K citations
Chinese Academy of Sciences
Beijing, China
3 h-index
10 publications
1.2K citations
University of Sfax
Sfax, Tunisia
2 h-index
2 publications
47 citations
Hitachi (Japan)
Tokyo, Japan
2 h-index
3 publications
172 citations
University of Minnesota
Minneapolis, United States
2 h-index
4 publications
282 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
1 h-index
1 publications
16 citations
University of Macau
Macao, Macao
1 h-index
1 publications
13 citations
Microsoft (United States)
Redmond, United States
1 h-index
4 publications
276 citations
1–8 of 38
Venues
- IEEE Transactions on Computers
2 publications · 87 citations
2
h-index
- IEEE Antennas and Wireless Propagation Letters
AWPL · 1 publications · 13 citations
1
h-index
- Data Mining and Knowledge Discovery
1 publications · 110 citations
1
h-index
- Discrete Applied Mathematics
1 publications · 11 citations
1
h-index
- Distributed and Parallel Databases
1 publications · 31 citations
1
h-index
1–5