When dealing with high-dimensional data, which of the two algorithms (k-NN or Naive Bayes) is likely to be more efficient in terms of computational time?

  • Both Equally Efficient
  • It depends on the dataset size
  • Naive Bayes
  • k-NN
Naive Bayes is generally more efficient in terms of computational time for high-dimensional data because it doesn't require distance calculations.
Add your answer
Loading...

Leave a comment

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