Which of the following algorithms is particularly challenging to scale for large datasets?

  • Decision Trees
  • K-Nearest Neighbors
  • Naive Bayes
  • Support Vector Machines
Decision Trees can be challenging to scale for large datasets because they tend to create complex trees that require a lot of memory and computational resources. They can easily overfit, making them less suitable for big data scenarios.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *