Why instance-based learning algorithm sometimes referred to as lazy learning algorithm?
Answer / Suresh Chandra
Instance-Based Learning (IBL) algorithms, also known as Lazy Learning algorithms, are delayed-response learners that do not create an explicit model of the training data. Instead, they store all training examples and retrieve them when needed to make predictions. This makes IBL efficient for small datasets but can be computationally expensive for large ones.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is naive bayes in machine learning?
What is supervised and unsupervised machine learning?
How Recall and True positive rate are related?
Which language is better for machine learning r or python?
Why do we convert categorical variables into factor?
Assume that you are working on a data set, explain how would you select important variables?
Tell us when will you use classification over regression?
What is the convex hull?
What is the difference between probability and likelihood?
What is connectionist AI?
Tell us how do deductive and inductive machine learning differ?
Is machine learning a good career?
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)