Match the LIST-I with LIST-II Choose the correct answer from the options given below:LIST-I LIST-II A. Decision Tree I. Delta Learning Rule B. Supervised Learning II. Self Organizing Map C. Artificial Neural Network III. C4.5 Algorithm D. Instance base Learning IV. Non-linear Regression Algorithm
A-III, B-IV, C-I, D-II
The list pairs machine-learning paradigms and model families with a representative algorithm or learning rule.
A — Decision Tree: C4.5 (Quinlan's successor to ID3) builds decision trees using the gain ratio, so A-III.
B — Supervised Learning: learning a mapping from labelled inputs to outputs, of which a non-linear regression algorithm fitted to labelled targets is an example, so B-IV.
C — Artificial Neural Network: the delta (Widrow–Hoff / LMS) learning rule adjusts neuron weights in proportion to the output error, so C-I.
D — Instance base Learning: the remaining item, the Self Organizing Map, stores prototype vectors and classifies by proximity to stored instances, so D-II.
Only one code pairs the decision tree with C4.5: the codes A-I, B-II, C-III, D-IV, A-II, B-III, C-IV, D-I and A-IV, B-I, C-II, D-III all attach C4.5 to something other than the decision tree and also move the delta rule away from the neural network.
A-III, B-IV, C-I, D-II 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 __________.
