A binary node has class proportions 0.5 and 0.5. Find Gini impurity.
Answer and explanation
0.5
1−0.25−0.25=0.5.
Subjects
Choose questions individually, practise online, or create a worksheet with matching answers. Counts include generated variants, not only authored originals.
0.5
1−0.25−0.25=0.5.
0
1−1²=0.
A terminal prediction region
Leaves end a branch and supply predictions.
A minimum number of examples per leaf
A minimum leaf size discourages unsupported fine partitions.
0.3
Equal weights give (0.2+0.4)/2.
A split can make a tiny pure child while leaving most data poorly separated. Weighting reflects the fraction of examples affected.
Credit representativeness of the overall split.
A decision tree partitions feature space using a sequence of tests. Leaf predictions summarize the training examples reaching them.
UniversityA decision tree partitions feature space using a sequence of tests. Leaf predictions summarize the training examples reaching them.
UniversityClustering groups examples according to a representation and similarity rule. The groups are not automatically true natural categories.
UniversityClustering groups examples according to a representation and similarity rule. The groups are not automatically true natural categories.
UniversityPrincipal component analysis finds orthogonal directions of high variance in centred data under its standard formulation.
UniversityPrincipal component analysis finds orthogonal directions of high variance in centred data under its standard formulation.
UniversityUse covariance eigenvalues sorted in descending order and a positive total variance.
UniversityUse covariance eigenvalues sorted in descending order and a positive total variance.
UniversityUnderstand learning tasks, datasets, honest evaluation, privacy and human responsibility. No paid AI tool is required.
Work through regression, gradients, classification and generalization using paper-based examples.
Compare trees, clustering, PCA and validation without confusing training performance with evidence of generalization.
Build from artificial neurons and backpropagation to attention and embedding geometry.
Practise clear prompting, retrieval-grounded workflows, evidence checking and permission-aware deployment.