Machine Learning Academy · 课时

将 PCA 用作预处理:管道中的加速与降噪

您将在分类器前将 PCA 嵌入 sklearn Pipeline,并比较降维前后的训练时间和测试准确率。

第 4 / 4 课13 个步骤

将 PCA 用作预处理:管道中的加速与降噪 是 CoddyKit 上的免费 Machine Learning Academy 课时。 这是第 4 节课,共 4 节。 你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。 这是 Machine Learning Academy 学习路径的一部分,你的进度在网页和 CoddyKit 应用中同步。 Machine Learning Academy 课程共包含 4 节课。

本课时的部分内容尚未翻译,以英文显示。

PCA as a Preprocessing Step

Beyond visualisation, PCA serves as a practical preprocessing step that feeds compressed features into a downstream classifier or regressor. By discarding low-variance components that often encode noise, PCA can speed up training, reduce memory usage, and sometimes improve generalisation — especially when the original feature space is very high-dimensional.

Why PCA Can Reduce Noise

Random measurement noise typically spreads across many directions in feature space, but its variance is small in any single direction. PCA concentrates the meaningful signal in the top components and leaves noise in the low-variance tail. When you discard that tail, you effectively denoise the data. This is why PCA pre-processing sometimes helps algorithms like logistic regression that are sensitive to correlated or noisy features.

Embedding PCA in a sklearn Pipeline

The cleanest way to use PCA as preprocessing is inside a Pipeline. The pipeline ensures the scaler and PCA are fitted only on training data and then applied consistently to test data. This eliminates an entire class of data leakage bugs that occur when people forget to apply the same PCA transform to the test set.

from sklearn.pipeline import Pipeline
from sklearn.preprocessing import StandardScaler
from sklearn.decomposition import PCA
from sklearn.linear_model import LogisticRegression
from sklearn.datasets import load_digits
from sklearn.model_selection import train_test_split

X, y = load_digits(return_X_y=True)
X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2, random_state=42)

pipe = Pipeline([
    ('scaler', StandardScaler()),
    ('pca', PCA(n_components=0.95)),
    ('clf', LogisticRegression(max_iter=500))
])

pipe.fit(X_train, y_train)
print('Test accuracy:', pipe.score(X_test, y_test).round(4))

Comparing Training Time With and Without PCA

On high-dimensional datasets PCA can dramatically reduce training time because the classifier sees far fewer features. Let us benchmark logistic regression on the digits dataset (64 features) with and without PCA pre-reduction.

import time
from sklearn.pipeline import Pipeline
from sklearn.preprocessing import StandardScaler
from sklearn.decomposition import PCA
from sklearn.linear_model import LogisticRegression
from sklearn.datasets import load_digits
from sklearn.model_selection import train_test_split

X, y = load_digits(return_X_y=True)
X_train, X_test, y_train, y_test = train_test_split(X, y, random_state=42)

# Without PCA
t0 = time.time()
pipe_full = Pipeline([('sc', StandardScaler()), ('clf', LogisticRegression(max_iter=1000))])
pipe_full.fit(X_train, y_train)
t_full = time.time() - t0

# With PCA
t0 = time.time()
pipe_pca = Pipeline([('sc', StandardScaler()), ('pca', PCA(n_components=0.95)),
                     ('clf', LogisticRegression(max_iter=500))])
pipe_pca.fit(X_train, y_train)
t_pca = time.time() - t0

print(f'Without PCA: {t_full:.3f}s  acc={pipe_full.score(X_test, y_test):.4f}')
print(f'With PCA:    {t_pca:.3f}s  acc={pipe_pca.score(X_test, y_test):.4f}')

When PCA Helps and When It Does Not

PCA preprocessing helps most when: the number of features is large relative to the number of samples (high-dimensional, low-sample regime), features are correlated (redundant information), or the algorithm is slow with many features (e.g., SVM with RBF kernel). PCA tends NOT to help when: the dataset already has few, informative features, or you are using tree-based models (random forests, XGBoost) that handle redundant features natively and do not benefit from PCA's linear compression.

Tuning n_components in a Grid Search

Because PCA is a step inside a Pipeline, you can tune n_components alongside the classifier's hyperparameters using GridSearchCV. Use the double-underscore notation pca__n_components to refer to the PCA step's parameter. This lets the cross-validation loop find the optimal compression level simultaneously with the model's regularisation strength.

from sklearn.model_selection import GridSearchCV
from sklearn.pipeline import Pipeline
from sklearn.preprocessing import StandardScaler
from sklearn.decomposition import PCA
from sklearn.linear_model import LogisticRegression
from sklearn.datasets import load_digits

X, y = load_digits(return_X_y=True)

pipe = Pipeline([
    ('sc', StandardScaler()),
    ('pca', PCA()),
    ('clf', LogisticRegression(max_iter=500))
])

param_grid = {
    'pca__n_components': [10, 20, 30, 40],
    'clf__C': [0.1, 1.0, 10.0]
}

grid = GridSearchCV(pipe, param_grid, cv=5, n_jobs=-1)
grid.fit(X, y)
print('Best params:', grid.best_params_)
print('Best CV score:', grid.best_score_.round(4))

PCA Before SVM: A Classic Combination

SVMs with RBF kernels compute pairwise distances in the original feature space — expensive for high-dimensional data. Applying PCA first reduces dimensions while retaining signal, shrinking the distance computation. This combination was standard practice on image classification tasks before deep learning dominated: reduce image pixels with PCA, then classify with SVM.

from sklearn.pipeline import Pipeline
from sklearn.preprocessing import StandardScaler
from sklearn.decomposition import PCA
from sklearn.svm import SVC
from sklearn.datasets import load_digits
from sklearn.model_selection import cross_val_score
import numpy as np

X, y = load_digits(return_X_y=True)

pipe = Pipeline([
    ('sc', StandardScaler()),
    ('pca', PCA(n_components=30)),
    ('svm', SVC(kernel='rbf', C=10, gamma='scale'))
])

scores = cross_val_score(pipe, X, y, cv=5)
print(f'Accuracy: {np.mean(scores):.4f} +/- {np.std(scores):.4f}')

PCA for Noise Reduction: Concrete Example

Let us add Gaussian noise to the digits dataset and compare classifier accuracy with and without PCA denoising. On noisy data, PCA often improves accuracy by discarding the noise-dominated low-variance components.

import numpy as np
from sklearn.pipeline import Pipeline
from sklearn.preprocessing import StandardScaler
from sklearn.decomposition import PCA
from sklearn.linear_model import LogisticRegression
from sklearn.datasets import load_digits
from sklearn.model_selection import cross_val_score

X, y = load_digits(return_X_y=True)
X_noisy = X + np.random.randn(*X.shape) * 5.0  # heavy noise

for nc in [None, 10, 20, 30, 40]:
    steps = [('sc', StandardScaler())]
    if nc:
        steps.append(('pca', PCA(n_components=nc)))
    steps.append(('clf', LogisticRegression(max_iter=500)))
    pipe = Pipeline(steps)
    acc = cross_val_score(pipe, X_noisy, y, cv=5).mean()
    label = f'PCA({nc})' if nc else 'No PCA'
    print(f'{label:10s}  acc={acc:.4f}')

Always Fit PCA on Training Data Only

A critical rule: never fit the PCA transform on the test set. Fitting on test data leaks test-set statistics into the preprocessing and gives overly optimistic performance estimates. Using a Pipeline enforces this rule automatically: when you call pipeline.fit(X_train, y_train), every step — including PCA — is fitted only on the training split.

Memory Savings from PCA

On datasets with millions of samples and thousands of features (e.g., text TF-IDF matrices, genomic data), PCA dramatically reduces memory footprint. A 1M×5000 matrix at float32 costs 20 GB; PCA to 100 components gives a 1M×100 matrix at 400 MB — a 50× reduction. For such cases, use IncrementalPCA from scikit-learn, which fits PCA in chunks and never needs to load the full matrix into RAM.

from sklearn.decomposition import IncrementalPCA
import numpy as np

# Simulate large dataset as batches
n_samples, n_features = 10000, 500
n_components = 50
batch_size = 500

ipca = IncrementalPCA(n_components=n_components)
for i in range(0, n_samples, batch_size):
    batch = np.random.randn(batch_size, n_features)
    ipca.partial_fit(batch)

print('Explained variance ratio sum:', ipca.explained_variance_ratio_.sum().round(4))

Combining PCA with ColumnTransformer

In mixed-type datasets, you can apply PCA only to numeric columns while encoding categoricals separately, then combine with a ColumnTransformer. This is an advanced but realistic pattern for production ML pipelines where image features, numerical measurements, and categorical flags all coexist in the same row.

Quick Check

Test your understanding of PCA as pipeline preprocessing from this lesson.

Lesson Recap

In this lesson you learned: PCA inside a Pipeline prevents data leakage by fitting the transform only on training data, PCA can speed up training and reduce noise especially for high-dimensional or correlated feature sets, and n_components can be tuned via GridSearchCV alongside other model hyperparameters using double-underscore notation. Next up we build our first complete scikit-learn Pipeline combining scaler and classifier.

免费开始

用 AI 导师学习 Python — 免费

在浏览器中编写并运行真实代码,获得全天候 AI 导师的即时帮助,并在网页或应用中继续学习。

课程
30
课程
120

常见问题解答

「将 PCA 用作预处理:管道中的加速与降噪」课时是免费的吗?

是的 — 「将 PCA 用作预处理:管道中的加速与降噪」的完整文本可在网页上免费阅读。要进行交互式练习(内置代码编辑器和全天候 AI 导师)并解锁 Machine Learning Academy 课程的其余内容,请升级到 CoddyKit PRO。 Machine Learning Academy 课程共包含 4 节课。

「将 PCA 用作预处理:管道中的加速与降噪」这节课中我会学到什么?

您将在分类器前将 PCA 嵌入 sklearn Pipeline,并比较降维前后的训练时间和测试准确率。 你通过在浏览器中直接运行的动手代码来练习 Machine Learning Academy,全天候 AI 导师会在你学习这节课的过程中回答你的问题。

学习 Machine Learning Academy 需要有经验吗?

无需任何先前经验。CoddyKit 上的 Machine Learning Academy 课程适合初学者到高级学习者,你可以从这里开始或从头开始,按照自己的节奏学习。 这是第 4 节课,共 4 节。

「将 PCA 用作预处理:管道中的加速与降噪」课时需要多长时间?

大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动,所以你能稳步进步,并在网页和应用中从离开的地方继续。

我能在这节 Machine Learning Academy 课中编写并运行代码吗?

能。每节 Machine Learning Academy 课都包含内置代码编辑器,你可以在浏览器中直接编写并运行真实代码,并获得即时 AI 反馈 — 无需本地设置。

此课程中的所有课时

  1. PCA:方差、特征向量与主成分
  2. 投影数据并从主成分重建
  3. t-SNE:用于可视化的邻域保持
  4. 将 PCA 用作预处理:管道中的加速与降噪
← 返回 Machine Learning Academy