Consider the following draw backs is/are of Rule based approach is/are: A. The learning is static. B. Any changes made to the original data will not be considered. C. Once trained the model cannot improve on the basis of feedback. Choose the correct answer from the options given below:
All the above statements are correct
A rule-based approach encodes knowledge as fixed if–then rules written by experts, whereas a machine learning approach induces its behaviour from data and can be retrained. The usual drawbacks of the rule-based approach all follow from the rules being fixed once written.
A — Correct. The knowledge is static: the system does not learn on its own; new behaviour appears only when someone rewrites the rules.
B — Correct. Because the rules were derived once from the original data, later changes in that data are not reflected until the rules are manually revised.
C — Correct. Once the rule base is built, the system cannot improve itself from feedback on its outputs; there is no mechanism for adjusting rules automatically.
All three statements are genuine drawbacks, so the choices claiming that A and B, B and C, or all statements are not correct do not hold.
All the above statements are correct option is correct.
Similar Questions
In constraint satisfaction problem, constraints can be stated as __________.
Language model used in LISP is __________.
Reasoning strategies used in expert systems include __________.
Forward chaining systems are __________ where as backward chaining systems are __________.
Given the following set of prolog clauses :
father(X, Y) :
parent(X, Y),
male(X),
parent(Sally, Bob),
parent(Jim, Bob),
parent(Alice, Jane),
parent(Thomas, Jane),
male(Bob),
male(Jim),
female(Salley),
female(Alice).
How many atoms are matched to the variable ‘X’ before the query
father(X, Jane) reports a Result ?
Match the following with respect to heuristic search techniques :
List - I List - II (a) Steepest - ascent Hill Climbing (i) Keeps track of all partial paths which can be candidate for further exploration (b) Branch - and - bound (ii) Discover problem state(s) that satisfy a set of constraints (c) Constraint satisfaction (iii) Detects difference between current state and goal state (d) Means - end - analysis (iv) Considers all moves from current state and selects best move Codes :
Match the following knowledge representation techniques with their applications :
List - I List - II (a) Frames (i) Pictorial representation of objects, their attributes and relationships (b) Conceptual dependencies (ii) To describe real world stereotype events (c) Associative networks (iii) Record like structures for grouping closely related knowledge (d) Scripts (iv) Structures and primitives to represent sentences Codes :
Match the following :
List - I List - II (a) Intelligence (i) Contextual, tacit, transfer needs learning (b) Knowledge (ii) Scattered facts, easily transferable (c) Information (iii) Judgemental (d) Data (iv) Codifiable, endorsed with relevance and purpose Codes :
Which of the following is false for the programming language PROLOG ?
________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.
Important Questions from Approaches to AI
The process of removing detail from a given state representation is called ______.
In constraint satisfaction problem, constraints can be stated as __________.
Language model used in LISP is __________.
Reasoning strategies used in expert systems include __________.
Forward chaining systems are __________ where as backward chaining systems are __________.
