Understand the idea
Validation rows must not become training neighbours. Scaling belongs inside the candidate pipeline so each fold learns its own metric scale.
Python skill: Fits the distance scale within each pipeline fit, including each validation fold.
Meet the syntax
Pipeline([('scale',StandardScaler()),('model',KNeighborsClassifier())])('scale',StandardScaler())- Fits the distance scale within each pipeline fit, including each validation fold.
('model',KNeighborsClassifier())- Places neighbour voting after scaling; model__n_neighbors can address its k setting.
Follow the code
Use the numbered comments to connect each Python block to the workflow above.
from sklearn.pipeline import Pipeline
from sklearn.preprocessing import StandardScaler
from sklearn.neighbors import KNeighborsClassifier
from sklearn.model_selection import GridSearchCV,StratifiedKFold
model=Pipeline([('scale',StandardScaler()),('model',KNeighborsClassifier())])
search=GridSearchCV(model,{'model__n_neighbors':[3,5,9]},cv=StratifiedKFold(5,shuffle=True,random_state=42),scoring='f1_macro').fit(X_train,y_train)
answer=search.cv_results_['mean_test_score']
This practice: Read and run the Python. Next: Change · Validate k on a meaningful scale.
Given data · CLASS180
180 observations. Deterministic teaching observations; values illustrate the concept rather than a real population claim. The dataframe df is supplied afresh for each Run.
| length | width | label |
|---|---|---|
| 236.033 | -0.805568 | A |
| 581.297 | 0.728558 | A |
| -1511.27 | -1.00866 | A |
| 99.0248 | -0.24496 | A |
| -13.0141 | -0.660765 | A |
| 681.179 | 0.602475 | A |
| 51.1472 | 0.873157 | A |
| 362.131 | -0.665605 | A |
Column meanings and units
Column names describe the supplied features and target. Keep the stated units and row identities when making comparisons.
Synthetic data are deliberately small and reproducible. Their patterns illustrate an idea; they are not evidence about a real population.
| Column | Stored type |
|---|---|
| length | float64 |
| width | float64 |
| label | str |
Supplied setup · available if you need to inspect it
This code runs before your editor on every Run. These are the objects your exercise uses.
from sklearn.model_selection import train_test_split
X=df[['length','width']]
y=df.label
X_train,X_test,y_train,y_test=train_test_split(X,y,test_size=.2,random_state=42,stratify=y)
Your task · Follow
Search production k values 3,5,9 on CLASS180.
Hint 1 — Think
Scaling must be learned separately inside each validation fit.
Hint 2 — Tools
Pipeline, GridSearchCV and model__n_neighbors.
Hint 3 — Approach
Compare the declared k values in a scaling/KNN pipeline using seeded stratified macro-F1 folds.
Explained solution
from sklearn.pipeline import Pipeline
from sklearn.preprocessing import StandardScaler
from sklearn.neighbors import KNeighborsClassifier
from sklearn.model_selection import GridSearchCV,StratifiedKFold
model=Pipeline([('scale',StandardScaler()),('model',KNeighborsClassifier())])
search=GridSearchCV(model,{'model__n_neighbors':[3,5,9]},cv=StratifiedKFold(5,shuffle=True,random_state=42),scoring='f1_macro').fit(X_train,y_train)
answer=search.cv_results_['mean_test_score']
Fold-local scaling keeps validation observations from changing distances used to fit their own predictor.
Helpful prior knowledge: Neighbour voting These links are guidance, not locks.
Sources and API context
Examples run with this Playground’s scikit-learn 1.4.2 / Pyodide 0.26.4 runtime.