Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    K Nearest Neighbor (KNN)

    Uploaded by

    simransolanki003
    K-Nearest Neighbor (KNN) is a simple machine learning algorithm that classifies new data points based on the majority class of its k nearest neighbors. It works by finding the k training samples that are closest in distance to the new data point, and assigning the data point to the most common class among those k nearest neighbors. KNN is a non-parametric algorithm that makes no assumptions about the distribution of the data and can be used for both classification and regression problems.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    K Nearest Neighbor (KNN)

    Uploaded by

    simransolanki003
    14 views9 pages
    K-Nearest Neighbor (KNN) is a simple machine learning algorithm that classifies new data points based on the majority class of its k nearest neighbors. It works by finding the k training samples that are closest in distance to the new data point, and assigning the data point to the most common class among those k nearest neighbors. KNN is a non-parametric algorithm that makes no assumptions about the distribution of the data and can be used for both classification and regression problems.

    Original Title

    K Nearest Neighbor(KNN)

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    K-Nearest Neighbor (KNN) is a simple machine learning algorithm that classifies new data points based on the majority class of its k nearest neighbors. It works by finding the k training samples that are closest in distance to the new data point, and assigning the data point to the most common class among those k nearest neighbors. KNN is a non-parametric algorithm that makes no assumptions about the distribution of the data and can be used for both classification and regression problems.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    14 views9 pages

    K Nearest Neighbor (KNN)

    Uploaded by

    simransolanki003
    K-Nearest Neighbor (KNN) is a simple machine learning algorithm that classifies new data points based on the majority class of its k nearest neighbors. It works by finding the k training samples that are closest in distance to the new data point, and assigning the data point to the most common class among those k nearest neighbors. KNN is a non-parametric algorithm that makes no assumptions about the distribution of the data and can be used for both classification and regression problems.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 9

    K-Nearest Neighbor(KNN)

    KNN
    • K-Nearest Neighbour is one of the simplest Machine Learning algorithms based on Supervised
    Learning technique.
    • K-NN algorithm assumes the similarity between the new case/data and available cases and put the new
    case into the category that is most similar to the available categories.
    • K-NN algorithm stores all the available data and classifies a new data point based on the similarity.
    This means when new data appears then it can be easily classified into a well suite category by using
    K- NN algorithm.
    • K-NN algorithm can be used for Regression as well as for Classification but mostly it is used for the
    Classification problems.
    • K-NN is a non-parametric algorithm, which means it does not make any assumption on underlying
    data.
    • It is also called a lazy learner algorithm because it does not learn from the training set immediately
    instead it stores the dataset and at the time of classification, it performs an action on the dataset.
    • KNN algorithm at the training phase just stores the dataset and when it gets new data, then it classifies
    that data into a category that is much similar to the new data.
    KNN

    Suppose, we have an image of a creature that looks similar to cat and dog, but we want to know either it is a cat
    or dog. So for this identification, we can use the KNN algorithm, as it works on a similarity measure. Our KNN
    model will find the similar features of the new data set to the cats and dogs images and based on the most
    similar features it will put it in either cat or dog category.
    KNN
    • Suppose there are two categories, i.e., Category A and Category B, and
    we have a new data point x1, so this data point will lie in which of
    these categories. To solve this type of problem, we need a K-NN
    algorithm. With the help of K-NN, we can easily identify the category
    or class of a particular dataset. Consider the below diagram:
    Working
    • Step-1: Select the number K of the neighbors
    • Step-2: Calculate the Euclidean distance of K number of neighbors
    • Step-3: Take the K nearest neighbors as per the calculated Euclidean
    distance.
    • Step-4: Among these k neighbors, count the number of the data points
    in each category.
    • Step-5: Assign the new data points to that category for which the
    number of the neighbor is maximum.
    • Step-6: Our model is ready.
    Example
    Suppose we have a new data point and we need to put it in the required category. Consider the
    below image:
    Example
    • Firstly, we will choose the number of neighbors, so we will choose the k=5.
    • Next, we will calculate the Euclidean distance between the data points. The
    Euclidean distance is the distance between two points, which we have already
    studied in geometry. It can be calculated as:
    • By calculating the Euclidean distance we got the nearest neighbors, as
    three nearest neighbors in category A and two nearest neighbors in
    category B. Consider the below image:
    Advantages
    • Advantages of KNN Algorithm:
    • It is simple to implement.
    • It is robust to the noisy training data
    • It can be more effective if the training data is large.
    • Disadvantages of KNN Algorithm:
    • Always needs to determine the value of K which may be complex
    some time.
    • The computation cost is high because of calculating the distance
    between the data points for all the training samples.

    You might also like