{"id":1061,"date":"2023-07-06T12:50:07","date_gmt":"2023-07-06T10:50:07","guid":{"rendered":"https:\/\/ia4legos.umh.es\/?page_id=1061"},"modified":"2023-11-30T13:28:11","modified_gmt":"2023-11-30T12:28:11","slug":"algoritmo-de-los-k-vecinos-mas-cercanos-k-nn","status":"publish","type":"page","link":"https:\/\/unidigital.umh.es\/ca\/algoritmo-de-los-k-vecinos-mas-cercanos-k-nn\/","title":{"rendered":"<span lang=\"es\">(Espa\u00f1ol) Algoritmo de los k vecinos m\u00e1s cercanos (k-NN) IASAC ML<\/span>"},"content":{"rendered":"<p>[et_pb_section fb_built=&#8221;1&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_row _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221; theme_builder_area=&#8221;post_content&#8221;][et_pb_column type=&#8221;4_4&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221; theme_builder_area=&#8221;post_content&#8221;][et_pb_text _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; custom_padding=&#8221;4px||4px|||&#8221; link_option_url=&#8221;https:\/\/unidigital.umh.es\/ml-iasac\/&#8221; global_colors_info=&#8221;{}&#8221; theme_builder_area=&#8221;post_content&#8221;]<\/p>\n<h1 style=\"text-align: center;\"><span style=\"text-decoration: underline; color: #bf5800;\"><strong>IR A CONTENIDOS MACHINE LEARNING<\/strong><\/span><\/h1>\n<p>[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=&#8221;1_5,3_5,1_5&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_column type=&#8221;1_5&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_button button_url=&#8221;https:\/\/unidigital.umh.es\/clasificador-naive-bayes\/&#8221; button_text=&#8221;Unidad 2.3 Clasificador Na\u00efve Bayes&#8221; button_alignment=&#8221;center&#8221; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; custom_button=&#8221;on&#8221; button_text_size=&#8221;13px&#8221; button_text_color=&#8221;#bf4c00&#8243; button_bg_color=&#8221;#FFFFFF&#8221; button_border_color=&#8221;#bf5800&#8243; button_font=&#8221;Roboto||||||||&#8221; custom_margin=&#8221;|||-50px|false|false&#8221; global_colors_info=&#8221;{}&#8221;][\/et_pb_button][\/et_pb_column][et_pb_column type=&#8221;3_5&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_text _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; text_font=&#8221;Signika||||||||&#8221; header_2_font_size=&#8221;22px&#8221; global_colors_info=&#8221;{}&#8221;]<\/p>\n<h1 style=\"text-align: center\">M\u00f3dulo 2. Aprendizaje supervisado<\/h1>\n<p>&nbsp;<\/p>\n<h2 style=\"text-align: center\">Unidad 2.4 Algoritmo de los k vecinos m\u00e1s cercanos (k-NN)<\/h2>\n<h2>\u00a0<\/h2>\n<p>[\/et_pb_text][\/et_pb_column][et_pb_column type=&#8221;1_5&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_button button_url=&#8221;https:\/\/unidigital.umh.es\/maquinas-de-vector-soporte-svm\/&#8221; button_text=&#8221;Unidad 2.5 M\u00e1quinas de vector soporte (SVM)&#8221; button_alignment=&#8221;center&#8221; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; custom_button=&#8221;on&#8221; button_text_size=&#8221;13px&#8221; button_text_color=&#8221;#bf4c00&#8243; button_bg_color=&#8221;#FFFFFF&#8221; button_border_color=&#8221;#bf5800&#8243; button_font=&#8221;Roboto||||||||&#8221; custom_margin=&#8221;|-50px|||false|false&#8221; global_colors_info=&#8221;{}&#8221;][\/et_pb_button][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=&#8221;1_3,1_3,1_3&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_column type=&#8221;1_3&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][\/et_pb_column][et_pb_column type=&#8221;1_3&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_image src=&#8221;https:\/\/ia4legos.umh.es\/files\/2023\/07\/Enlace-a-cuaderno-13.png&#8221; title_text=&#8221;Enlace a cuaderno 13&#8243; url=&#8221;https:\/\/colab.research.google.com\/drive\/1wIW9J3OEFkuOTa8Sn-Mk5zvSC0Vpd5jA&#8221; url_new_window=&#8221;on&#8221; align=&#8221;center&#8221; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; width=&#8221;62%&#8221; max_width=&#8221;99%&#8221; module_alignment=&#8221;center&#8221; custom_padding=&#8221;0px||||false|false&#8221; global_colors_info=&#8221;{}&#8221;][\/et_pb_image][et_pb_accordion toggle_icon=&#8221;&#x3b;||divi||400&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; toggle_font=&#8221;Signika||||||||&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_accordion_item title=&#8221;Tema 13. k-NN para problemas de clasificaci\u00f3n y regresi\u00f3n&#8221; open=&#8221;on&#8221; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;]<\/p>\n<ol>\n<li><span style=\"color: #bf5800\"><a href=\"https:\/\/colab.research.google.com\/drive\/1wIW9J3OEFkuOTa8Sn-Mk5zvSC0Vpd5jA#scrollTo=QAgaWSzDmSw2\" target=\"_blank\" rel=\"noopener\" style=\"color: #bf5800\">Algoritmo k-NN para problemas de clasificaci\u00f3n y regresi\u00f3n<\/a><\/span><\/li>\n<li><span style=\"color: #bf5800\"><a href=\"https:\/\/colab.research.google.com\/drive\/1wIW9J3OEFkuOTa8Sn-Mk5zvSC0Vpd5jA#scrollTo=Og2KEHgSHsnT\" target=\"_blank\" rel=\"noopener\" style=\"color: #bf5800\">k-NN en Scikit-Learn<\/a><\/span><\/li>\n<li><span style=\"color: #bf5800\"><a href=\"https:\/\/colab.research.google.com\/drive\/1wIW9J3OEFkuOTa8Sn-Mk5zvSC0Vpd5jA#scrollTo=HHlELezgY9ET\" target=\"_blank\" rel=\"noopener\" style=\"color: #bf5800\">Aplicaciones<\/a><\/span><\/li>\n<\/ol>\n<p>[\/et_pb_accordion_item][\/et_pb_accordion][et_pb_image src=&#8221;https:\/\/ia4legos.umh.es\/files\/2023\/07\/Enlace-a-video-cuaderno-13.png&#8221; title_text=&#8221;Enlace a v\u00eddeo cuaderno 13&#8243; url=&#8221;https:\/\/www.youtube.com\/watch?v=UCffZ-jU5qA&#038;list=PLClKgnzRFYe7A_t6D-siRSLuPPBzVNgI5&#038;index=11&#8243; url_new_window=&#8221;on&#8221; align=&#8221;center&#8221; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; transform_translate=&#8221;0px|27px&#8221; transform_translate_linked=&#8221;off&#8221; width=&#8221;66%&#8221; max_width=&#8221;100%&#8221; custom_margin=&#8221;-40px||||false|false&#8221; custom_padding=&#8221;|||1px||&#8221; global_colors_info=&#8221;{}&#8221;][\/et_pb_image][\/et_pb_column][et_pb_column type=&#8221;1_3&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=&#8221;1_3,1_3,1_3&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_column type=&#8221;1_3&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][\/et_pb_column][et_pb_column type=&#8221;1_3&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][et_pb_gallery gallery_ids=&#8221;1786,1789,1792&#8243; posts_number=&#8221;1&#8243; show_title_and_caption=&#8221;off&#8221; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][\/et_pb_gallery][\/et_pb_column][et_pb_column type=&#8221;1_3&#8243; _builder_version=&#8221;4.17.4&#8243; _module_preset=&#8221;default&#8221; global_colors_info=&#8221;{}&#8221;][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"<p>IR A CONTENIDOS MACHINE LEARNINGM\u00f3dulo 2. Aprendizaje supervisado &nbsp; Unidad 2.4 Algoritmo de los k vecinos m\u00e1s cercanos (k-NN) \u00a0 Algoritmo k-NN para problemas de clasificaci\u00f3n y regresi\u00f3n k-NN en Scikit-Learn Aplicaciones<\/p>\n","protected":false},"author":24713,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":"","_links_to":"","_links_to_target":""},"_links":{"self":[{"href":"https:\/\/unidigital.umh.es\/ca\/wp-json\/wp\/v2\/pages\/1061"}],"collection":[{"href":"https:\/\/unidigital.umh.es\/ca\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/unidigital.umh.es\/ca\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/unidigital.umh.es\/ca\/wp-json\/wp\/v2\/users\/24713"}],"replies":[{"embeddable":true,"href":"https:\/\/unidigital.umh.es\/ca\/wp-json\/wp\/v2\/comments?post=1061"}],"version-history":[{"count":0,"href":"https:\/\/unidigital.umh.es\/ca\/wp-json\/wp\/v2\/pages\/1061\/revisions"}],"wp:attachment":[{"href":"https:\/\/unidigital.umh.es\/ca\/wp-json\/wp\/v2\/media?parent=1061"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}