GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - charankamarapu/ML-K-nearest-neighbour-Algorithm-and-Models

BranchesTags
Open more actions menu

Latest commit

 

History

11 Commits
11 Commits

Folders and files

NameName
Last commit message
Last commit date
KNN-MNIST-digit_recognization
KNN-MNIST-digit_recognization
 
 
KNN-predict_breast_cancer
KNN-predict_breast_cancer
 
 
README.md
README.md
 
 

Repository files navigation

ML-K-nearest-neighbour-and-Models

INTRODUCTION

The k-nearest neighbors (KNN) algorithm is a simple, easy-to-implement supervised machine learning algorithm that can be used to solve both classification and regression problems.It is a supervised machine learning algorithm (as opposed to an unsupervised machine learning algorithm) is one that relies on labeled input data to learn a function that produces an appropriate output when given new unlabeled data./

  • The KNN algorithm assumes that similar things exist in close proximity. In other words, similar things are near to each other.
  • Here k is the no of neighbhour that we wish to considerfor the caluclation.
  • The algorithm takes the first K nearest neghbours
  • If regression, it returns the mean of the K labels
  • If classification, return the mode of the K labels
  • we usually make K an odd number to have a tiebreaker./

PROS

  • The algorithm is simple and easy to implement.
  • There’s no need to build a model, tune several parameters, or make additional assumptions.
  • The algorithm is versatile. It can be used for classification, regression, and search.

CONS

  • The algorithm gets significantly slower as the number of examples and/or predictors/independent variables increase.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.