Data Science Stack Exchange is a question and answer site for Data science professionals, Machine Learning specialists, and those interested in learning more about the field. It only takes a minute to sign up.
Sign up to join this community
This is a quick question. If I compare neural network and random forest, the data size requirement is huge in neural network, but a decision tree or random forest can work with less number of records too.
Does any such problem occurs with XGBoost as well? Does it also need a lot of data so that it can go in multiple iterations to reduce the error term?
No. Xgboost is more like traditional ML algorithm. It doesn't need too much data and it also perform better than almost all ML algorithm
The amount of data you need depends on the problem (see this great article on learning curves), but in general xgboost is very data efficient like random forests and has found a lot of use where data is expensive to produce as in medicine. Try it out on your data and plot a learning curve - if it is under-fitting, you need more data.
