{"id":202,"date":"2022-05-16T17:18:08","date_gmt":"2022-05-16T15:18:08","guid":{"rendered":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/?p=202"},"modified":"2022-05-24T10:16:48","modified_gmt":"2022-05-24T08:16:48","slug":"algorithme-des-k-plus-proches-voisins","status":"publish","type":"post","link":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/2022\/05\/16\/algorithme-des-k-plus-proches-voisins\/","title":{"rendered":"Algorithme des k plus proches voisins"},"content":{"rendered":"\n<p>voici mon lien google collab pour les test effectu\u00e9s :<\/p>\n\n\n\n<p><a href=\"https:\/\/colab.research.google.com\/drive\/15gxnbpN3ZKyxncxIkUZBFhbWIoCF55Hj?usp=sharing\">https:\/\/colab.research.google.com\/drive\/15gxnbpN3ZKyxncxIkUZBFhbWIoCF55Hj?usp=sharing<\/a><\/p>\n\n\n\n<p>L\u2019algorithme des K plus proches voisins ou K-nearest neighbors (k-NN) est un algorithme de machine learning qui appartient \u00e0 la classe des algorithmes d\u2019apprentissage supervis\u00e9 simple et facile \u00e0 mettre en \u0153uvre qui peut \u00eatre utilis\u00e9 pour r\u00e9soudre les probl\u00e8mes de classification et de r\u00e9gression.<\/p>\n\n\n\n<p>Avantages et inconv\u00e9nients du k-NN : <\/p>\n\n\n\n<p>Avantages :<\/p>\n\n\n\n<ul><li>l&rsquo;algorithme est simple et facile \u00e0 mettre en place<\/li><li>aucune hypoth\u00e8se sur les donn\u00e9es<\/li><li>l&rsquo;algorithme est polyvalent. Il peut \u00eatre utilis\u00e9 pour la classification, la r\u00e9gression.<\/li><\/ul>\n\n\n\n<p>Inconv\u00e9nients : <\/p>\n\n\n\n<ul><li>l&rsquo;algorithme devient beaucoup plus lent \u00e0 mesure que le nombre d&rsquo;exemples d&rsquo;apprentissage augmente.<\/li><li>Le choix de la m\u00e9thode de calcul de la distance ainsi que le nombre de voisins k-NN peut ne pas \u00eatre \u00e9vident<\/li><li>L&rsquo;\u00e9tape de pr\u00e9diction peut-\u00eatre lente.<\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>voici mon lien google collab pour les test effectu\u00e9s : https:\/\/colab.research.google.com\/drive\/15gxnbpN3ZKyxncxIkUZBFhbWIoCF55Hj?usp=sharing L\u2019algorithme des K plus proches voisins ou K-nearest neighbors (k-NN) est un algorithme de machine learning qui appartient \u00e0 la classe des algorithmes d\u2019apprentissage supervis\u00e9 simple et facile \u00e0 mettre en \u0153uvre qui peut \u00eatre utilis\u00e9 pour r\u00e9soudre les probl\u00e8mes de classification et de&hellip; <a class=\"more-link\" href=\"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/2022\/05\/16\/algorithme-des-k-plus-proches-voisins\/\">Poursuivre la lecture <span class=\"screen-reader-text\">Algorithme des k plus proches voisins<\/span><\/a><\/p>\n","protected":false},"author":12,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[1],"tags":[],"_links":{"self":[{"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/posts\/202"}],"collection":[{"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/users\/12"}],"replies":[{"embeddable":true,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/comments?post=202"}],"version-history":[{"count":5,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/posts\/202\/revisions"}],"predecessor-version":[{"id":208,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/posts\/202\/revisions\/208"}],"wp:attachment":[{"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/media?parent=202"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/categories?post=202"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/romane\/wp-json\/wp\/v2\/tags?post=202"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}