What is the computational complexity of constructing and performing a regression tree? Is there any analysis or conclusion on it?
Thanks!
You can look at the xgboost paper.
The most time consuming part of the tree learning algorithm is getting the data in sorted order. This makes the time complexity of learning each tree O(n log n).
1.4m articles
1.4m replys
5 comments
57.0k users