Scribd Logo
Upload

Welcome to Scribd!

  • AMNA SHAHID - Docx MCQS

    Uploaded by

    ghaffarali3256
    26 views8 pages
    The document contains 15 multiple choice questions about K-nearest neighbors (KNN) regression. KNN regression is a machine learning algorithm that can be used for classification and regression tasks. It finds the K closest training examples in the feature space and assigns the label (for classification) or value (for regression) based on the majority vote or average of its neighbors. The questions cover topics like the time required to classify new examples using KNN compared to other models, Euclidean distance, choosing the value of K, and whether KNN has training and testing phases like other algorithms.

    Original Description:

    Objective paper of machine learning

    Original Title

    AMNA SHAHID.docx MCQS

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains 15 multiple choice questions about K-nearest neighbors (KNN) regression. KNN regression is a machine learning algorithm that can be used for classification and regression tasks. It finds the K closest training examples in the feature space and assigns the label (for classification) or value (for regression) based on the majority vote or average of its neighbors. The questions cover topics like the time required to classify new examples using KNN compared to other models, Euclidean distance, choosing the value of K, and whether KNN has training and testing phases like other algorithms.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    26 views8 pages

    AMNA SHAHID - Docx MCQS

    Uploaded by

    ghaffarali3256
    The document contains 15 multiple choice questions about K-nearest neighbors (KNN) regression. KNN regression is a machine learning algorithm that can be used for classification and regression tasks. It finds the K closest training examples in the feature space and assigns the label (for classification) or value (for regression) based on the majority vote or average of its neighbors. The questions cover topics like the time required to classify new examples using KNN compared to other models, Euclidean distance, choosing the value of K, and whether KNN has training and testing phases like other algorithms.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 8

    AMNA SHAHID & AYESHA AAMIR

    CLASS BSIS 7th

    ROLL NO F20RINFS1M02032 & F20RINFS1M02018

    KNN REGRESSION (MCQS)

    1. Time to classify a new example than with a model in Knn requires?

    Options :

    a. Depends on Data

    b. More Time

    c. None of these

    d. Less time

    Answers :

    b. More Time

    2. The Euclidean distance between two a set of numerical attributes is called as?

    Options :

    a. Closeness

    b. Validation data
    c. Error Rate

    d. None of these

    Answers :

    a. Closeness

    3. Which is the number of nearby neighbours to be used to classify the new record ?

    Options :

    a. KNN

    b. Validation data

    c. Euclidean Distance

    d. All the above

    Answers :

    a. KNN

    4 .Which capture the local structure in data ?

    Options :

    a. Low Value

    b. High Value

    c. Error Rate

    d. All the Above


    Answers :

    a. Low Value

    5.Which provide more smoothing, less noise ?

    Options :

    a. Low Value

    b. High Value

    c. Error Rate

    d. All the Above

    Answers :

    b. High Value

    6. Income, Lot size belongs to?

    Options :

    a. Predictor

    b. Data

    c. Error Rate

    d. None of these

    Answers :

    a. Predictor
    7.Classification done in Euclidean distance is comparing feature vectors of ?

    Options :

    a. Same Point

    b. Within Point

    c. Different Point

    d. None of these

    Answers :

    c. Different Point

    8.Classification done in Euclidean distance is comparing feature vectors of ?

    Options :

    a. Same Point

    b. Within Point

    c. Different Point

    d. Noneof these

    Answers :

    c. Different Point
    9. Classification done in Euclidean distance is comparing feature vectors of ?

    Options :

    a. Same Point

    b. Within Point

    c. Different Point

    d. Noneof these

    Answers :

    c. Different Point

    10.Classification done in Euclidean distance is comparing feature vectors of ?

    Options :

    a. Same Point

    b. Within Point

    c. Different Point

    d. None of these

    Answers :

    c. Different Point

    11 . Select K Average test Error?

    Options :
    a. Minimum

    b. Maximum

    c. Null

    d. None of these

    Answers :

    a. Minimum

    12 .In Optimal value of ‘k’ training part considered as?

    Options :

    a. P

    b. P-1

    c. 1-p

    d. 1

    Answers :

    b. P-1

    13 .In Optimal value of ‘k’ training part considered as?

    Options :

    a. P

    b. P-1
    c. 1-p

    d. 1

    Answers :

    b. P-1

    14.1. Which of the following machine learning algorithms has both training and test phases?

    a) k-Nearest Neighbor
    b) Linear regression
    c) Case-based reasoning
    d) None of the above

    Answers :
    b.Linear regression

    15.Decision trees can work with

    a) Only numeric values


    b) Only nominal values
    c) Both numeric and nominal values
    d) Neither numeric nor nominal values

    Answers :
    c. Both numeric and nominal values

    You might also like