引導式測驗 · 中等 等級

K 最近鄰測驗

涵蓋鄰居投票、特徵縮放、預測成本、度量選擇以及儲存訓練範例時的實際權衡。

相關引導路徑K 最近鄰
問題 1 的 8

KNN 如何對新資料點進行分類?

預覽每個問題8 問題

當您參加測驗時,就會出現答案和解釋。

  1. KNN 如何對新資料點進行分類?
    • 透過獲得 K 個最近鄰居的多數票
    • 透過在其上訓練神經網絡
    • 透過計算加權迴歸線
    • 透過分配隨機類別
  2. Why is KNN often called a “lazy learner”?
    • It never stores training data
    • It stores training examples and can defer much model-specific work until prediction, though indexes may be built during fitting
    • It always trains a deep neural network first
    • It does no work during either fitting or prediction
  3. 為什麼特徵縮放對於 KNN 很重要?
    • 它使訓練更快
    • 它減少了所需鄰居的數量
    • 因此,具有大範圍的特徵不會主導距離
    • 自動改變K
  4. 如果您選擇一個非常小的 K,例如 K=1,會發生什麼?
    • 模型變得非常平滑
    • 模型忽略數據
    • 預測變成不可能
    • 模型對雜訊變得敏感並且可能過度擬合
  5. In a brute-force KNN implementation, why can prediction be slow on a large dataset?
    • It may compute distances from a query to many or all stored examples
    • It must update all model weights for every query
    • It reruns the entire training dataset through a neural network
    • It cannot use an index or approximate search
  6. 哪種現代技術依賴於最近鄰思想?
    • 使用 JPEG 進行影像壓縮
    • 向量搜尋和檢索增強生成
    • 隨機數生成
    • 試算表公式
  7. Why should a feature scaler be fit only on the training split before KNN evaluation?
    • To make the distance metric ignore every feature
    • To guarantee all classes have equal counts
    • To avoid using information from validation or test examples when setting the scale
    • To remove the need to choose K
  8. How can KNN make a prediction for a regression task?
    • Choose the most common class label only
    • Fit a new deep network for each query
    • Ignore the stored examples and use a fixed intercept
    • Aggregate the target values of the K nearest training examples, often by averaging