Why instance based learning algorithm sometimes referred as Lazy learning?
Answer / Snigdha Jauhari
Instance-based learning algorithms, such as k-nearest neighbors (k-NN), are often referred to as 'lazy' learners because they do not build a model that can be used for new data until an actual query is made. Instead, they store examples from the training set and use them directly to classify new instances.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is machine learning in artificial intelligence?
How do I become a machine learning scientist?
Who is associated with the theory of symbolic learning?
Is Python enough for machine learning?
What is the Difference between Concept Learning and Classification Learning in Machine Learning?
Can naive bayes be used for multiclass classification?
What is logistic regression? State an example when you have used logistic regression recently.
What are the different types of algorithm methods in machine learning?
Explain the k-nearest algorithm different from the knn clustering?
Explain the Algorithm of Nearest Neighbor in Machine Learning?
How do classification and regression differ?
What’s the difference between a generative and discriminative model?
AI Algorithms (74)
AI Natural Language Processing (96)
AI Knowledge Representation Reasoning (12)
AI Robotics (183)
AI Computer Vision (13)
AI Neural Networks (66)
AI Fuzzy Logic (31)
AI Games (8)
AI Languages (141)
AI Tools (11)
AI Machine Learning (659)
Data Science (671)
Data Mining (120)
AI Deep Learning (111)
Generative AI (153)
AI Frameworks Libraries (197)
AI Ethics Safety (100)
AI Applications (427)
AI General (197)
AI AllOther (6)