{"id":2254,"date":"2022-06-15T00:46:09","date_gmt":"2022-06-14T17:46:09","guid":{"rendered":"http:\/\/student-activity.binus.ac.id\/himmat\/?p=2254"},"modified":"2022-06-15T00:46:09","modified_gmt":"2022-06-14T17:46:09","slug":"decision-tree-in-machine-learning","status":"publish","type":"post","link":"https:\/\/student-activity.binus.ac.id\/himmat\/2022\/06\/decision-tree-in-machine-learning\/","title":{"rendered":"Decision Tree in Machine Learning"},"content":{"rendered":"<p style=\"text-align: justify\"><span style=\"font-weight: 400\"><em>Decision Tree<\/em> adalah sebuah tipe model yang digunakan untuk <em>Supervised Learning<\/em> pada bidang <em>Machine Learning<\/em>. <em>Decision Tree<\/em> dapat digunakan untuk menyelesaikan masalah klasifikasi dan regresi, namun lebih sering digunakan untuk masalah klasifikasi. <em>Decision Tree<\/em> memiliki bentuk seperti pohon, dimana <em>tree<\/em> memiliki node akar (<em>root node<\/em>), <em>decision node<\/em> dan node daun (<em>leaf node<\/em>). <em>Leaf node<\/em> adalah node akhir yang tidak dapat dipecah dan yang akan menentukan hasil prediksi <em>decision tree<\/em>.<\/span><\/p>\n<p style=\"text-align: justify\"><span style=\"font-weight: 400\"><em>Decision Tree<\/em> bekerja dengan melakukan klasifikasi berdasarkan atribut yang paling membedakan. Algoritma <em>decision tree<\/em> akan mulai pada node akar, kemudian akan melakukan perbandingan antara nilai yang ada pada <em>dataset<\/em> dan data yang ingin diprediksi. Berdasarkan perbandingan tersebut, algoritma akan turun ke bawah dan melanjutkan ke <em>sub-node<\/em> yang lebih dalam. Algoritma ini akan berulang hingga mencapai <em>leaf node<\/em>, dimana keputusan prediksi bisa dibuat.<\/span><\/p>\n<p style=\"text-align: justify\"><span style=\"font-weight: 400\">Kelebihan <em>Decision Tree<\/em><\/span><\/p>\n<ul style=\"text-align: justify\">\n<li style=\"font-weight: 400\"><span style=\"font-weight: 400\">Model simpel dan mudah dimengerti (mirip seperti cara manusia membuat keputusan),<\/span><\/li>\n<li style=\"font-weight: 400\"><span style=\"font-weight: 400\">Dapat digunakan untuk mencari semua kemungkinan keputusan, dan<\/span><\/li>\n<li style=\"font-weight: 400\"><span style=\"font-weight: 400\">Tidak perlu melakukan banyak pembersihan atau augmentasi data.<\/span><\/li>\n<\/ul>\n<p style=\"text-align: justify\"><span style=\"font-weight: 400\">Kekurangan <em>Decision Tree<\/em><\/span><\/p>\n<ul style=\"text-align: justify\">\n<li style=\"font-weight: 400\"><span style=\"font-weight: 400\">Tree dapat memiliki banyak layer, yang membuat model kompleks,<\/span><\/li>\n<li style=\"font-weight: 400\"><span style=\"font-weight: 400\">Dapat memiliki masalah <em>overfitting<\/em>, dan<\/span><\/li>\n<li style=\"font-weight: 400\"><span style=\"font-weight: 400\">Untuk klasifikasi dengan banyak label, akan membuat komputasi model lebih kompleks.<\/span><\/li>\n<\/ul>\n<p><a href=\"http:\/\/student-activity.binus.ac.id\/himmat\/wp-content\/uploads\/sites\/14\/2022\/06\/tree.png\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter size-full wp-image-2255\" src=\"http:\/\/student-activity.binus.ac.id\/himmat\/wp-content\/uploads\/sites\/14\/2022\/06\/tree.png\" alt=\"\" width=\"360\" height=\"340\" \/><\/a><\/p>\n<p style=\"text-align: center\">Contoh <em>decision tree<\/em><\/p>\n<p style=\"text-align: justify\">\nSumber :<\/p>\n<p style=\"text-align: justify\"><a href=\"https:\/\/www.xoriant.com\/blog\/product-engineering\/decision-trees-machine-learning-algorithm.html\"><span style=\"font-weight: 400\">https:\/\/www.xoriant.com\/blog\/product-engineering\/decision-trees-machine-learning-algorithm.html<\/span><\/a><\/p>\n<p style=\"text-align: justify\"><a href=\"https:\/\/en.wikipedia.org\/wiki\/Decision_tree_learning\"><span style=\"font-weight: 400\">https:\/\/en.wikipedia.org\/wiki\/Decision_tree_learning<\/span><\/a><\/p>\n<p style=\"text-align: justify\"><a href=\"https:\/\/www.javatpoint.com\/machine-learning-decision-tree-classification-algorithm\"><span style=\"font-weight: 400\">https:\/\/www.javatpoint.com\/machine-learning-decision-tree-classification-algorithm<\/span><\/a><\/p>\n<p><a href=\"https:\/\/adityagoel123.medium.com\/binary-classification-using-decision-tree-model-c4e20c8a5afb\">https:\/\/adityagoel123.medium.com\/binary-classification-using-decision-tree-model-c4e20c8a5afb<\/a><\/p>\n<p><a href=\"https:\/\/miro.medium.com\/max\/720\/1*XMId5sJqPtm8-RIwVVz2tg.png\">https:\/\/miro.medium.com\/max\/720\/1*XMId5sJqPtm8-RIwVVz2tg.png<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Decision Tree adalah sebuah tipe model yang digunakan untuk Supervised Learning pada bidang Machine Learning. Decision Tree dapat digunakan untuk menyelesaikan masalah klasifikasi dan regresi, namun lebih sering digunakan untuk masalah klasifikasi. Decision Tree memiliki bentuk seperti pohon, dimana tree memiliki node akar (root node), decision node dan node daun (leaf node). Leaf node adalah [&hellip;]<\/p>\n","protected":false},"author":15,"featured_media":2256,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[35,67,64,21,66,65],"class_list":["post-2254","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-articles","tag-algorithm","tag-dataset","tag-decision-tree","tag-machine-learning","tag-node","tag-supervised-learning"],"_links":{"self":[{"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/posts\/2254","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/users\/15"}],"replies":[{"embeddable":true,"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/comments?post=2254"}],"version-history":[{"count":1,"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/posts\/2254\/revisions"}],"predecessor-version":[{"id":2257,"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/posts\/2254\/revisions\/2257"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/media\/2256"}],"wp:attachment":[{"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/media?parent=2254"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/categories?post=2254"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/student-activity.binus.ac.id\/himmat\/wp-json\/wp\/v2\/tags?post=2254"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}