What is data leakage in a train and test setup?
Simple meaning
Leakage is any path that lets information from the evaluation set, or from the future, into training.
Open the full page for Why, Steps, Example and Key takeaway.
Panel-ready AI & Data Analytics questions for freshers and experienced developers. Practice at Coding Cadre in Faridabad, or Online from Delhi NCR.
Leakage is any path that lets information from the evaluation set, or from the future, into training.
Open the full page for Why, Steps, Example and Key takeaway.
Use chronological cuts so training always precedes validation and test.
Open the full page for Why, Steps, Example and Key takeaway.
A stratified split keeps class proportions similar in train, val, and test.
Open the full page for Why, Steps, Example and Key takeaway.
ROC-AUC is the probability that a random positive scores higher than a random negative.
Open the full page for Why, Steps, Example and Key takeaway.
Precision-recall AUC focuses on the positive class and reacts to prevalence.
Open the full page for Why, Steps, Example and Key takeaway.
It counts true positives, false positives, true negatives, and false negatives at a chosen threshold.
Open the full page for Why, Steps, Example and Key takeaway.
Log loss, or binary cross-entropy, penalizes confident wrong probabilities heavily.
Open the full page for Why, Steps, Example and Key takeaway.
R-squared is the fraction of variance in y explained by the model.
Open the full page for Why, Steps, Example and Key takeaway.
Multicollinearity means features move together so the design matrix is nearly singular.
Open the full page for Why, Steps, Example and Key takeaway.
The closed form needs a matrix inverse or solve on p features and can be costly or unstable for huge p.
Open the full page for Why, Steps, Example and Key takeaway.
Heteroscedasticity means residual variance changes with x or with the predicted value.
Open the full page for Why, Steps, Example and Key takeaway.
It minimizes log loss, which is the negative log likelihood of a Bernoulli model.
Open the full page for Why, Steps, Example and Key takeaway.
One-vs-rest fits a binary model per class.
Open the full page for Why, Steps, Example and Key takeaway.
5 only matches equal costs and a well-calibrated model with balanced classes.
Open the full page for Why, Steps, Example and Key takeaway.
It struggles with strongly nonlinear decision surfaces unless you add interactions or basis functions.
Open the full page for Why, Steps, Example and Key takeaway.
Pruning removes branches that add little validated gain so the tree does not memorize noise.
Open the full page for Why, Steps, Example and Key takeaway.
A feature with many levels can create many pure-looking splits by chance.
Open the full page for Why, Steps, Example and Key takeaway.
ID3 uses information gain and likes categorical splits.
Open the full page for Why, Steps, Example and Key takeaway.
Yes, order-preserving transforms such as log or min-max usually leave the split sequence unchanged for a single tree.
Open the full page for Why, Steps, Example and Key takeaway.
Each tree is trained on a bootstrap sample, so some rows are left out of that tree.
Open the full page for Why, Steps, Example and Key takeaway.