Match List I with List II Choose the correct answer from the options given below:List I List II A. Regression I. Unsupervised Learning. B. KNN II. Supervised Learning. C. Clustering D. Decision Tree
A-II, B-II, C-I, D-II
Machine-learning methods are supervised when they learn from labelled examples (input with known output) and unsupervised when they find structure in unlabelled data.
A. Regression — fits a function that predicts a continuous target from labelled training pairs, so it is supervised learning (II).
B. KNN (k-nearest neighbours) — classifies a new point by the labels of its k closest training points; it needs labelled data, so it is supervised learning (II).
C. Clustering — groups unlabelled points by similarity (for example k-means), with no target output, so it is unsupervised learning (I).
D. Decision tree — learns splitting rules from labelled examples to predict a class or value, so it is supervised learning (II).
Codes that call regression or decision trees unsupervised, or call clustering supervised, reverse the role of labels in these methods.
A-II, B-II, 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 __________.
