WorksheetsData Mining Terminology 1
Total questions: 15
Worksheet time: 15mins
get (oneself or something) into or out of a situation using existing / minimal resources [9]
(a)
The first N in kNN stands for [7]
(a)
Choice of a split in a tree is based on this algorithm [6]
(a)
CART are also known as these trees [8]
(a)
These residuals in regression can be used to get n-fold cross-validation error [5]
(a)
Every tree has exactly one node of this type [4]
(a)
The terminal nodes of a tree are also known as these types of nodes [4]
(a)
This coefficient can measure the purity of a node in a classification tree [4]
(a)
This type of error generally shows a U shaped curve with respect to flexibility [4]
(a)
The measure for node purity based on logarithm of proportions of each class [7]
(a)
Number of nodes in a tree is also known as [10]
(a)
The second O in LOOCV stands for [3]
(a)
The process of cutting short a fully grown tree [7]
(a)
LOOCV is also known as [9]
(a)
The largest possible value of the misclassification probability [4]
(a)
