Yahoo India Web Search

Search results

1. www.geeksforgeeks.org › decision-tree-algorithmsDecision Tree Algorithms - GeeksforGeeks

   www.geeksforgeeks.org › decision-tree-algorithms

   • Cached

   May 22, 2024 · Decision trees are a type of machine-learning algorithm that can be used for both classification and regression tasks. They work by learning simple decision rules inferred from the data features. These rules can then be used to predict the value of the target variable for new data samples.

2. www.javatpoint.com › machine-learning-decisionDecision Tree Algorithm in Machine Learning - Javatpoint

   www.javatpoint.com › machine-learning-decision

   • Cached

   Learn how to use decision tree, a supervised learning technique, for classification and regression problems. Understand the terminologies, steps, and techniques of decision tree, such as information gain, Gini index, and pruning.

   • 
   • 
   • 
   • 

3. www.analyticsvidhya.com › decision-tree-algorithmDecision Tree? [A Step-by-Step Guide] - Analytics Vidhya

   www.analyticsvidhya.com › decision-tree-algorithm

   • Cached

   May 31, 2024 · Learn what a decision tree is, how it works, and why it is useful for classification and regression tasks. Explore the different types of decision trees, the process of building them, and how to evaluate and optimize them.

   • 
   • 
   • 
   • 

4. www.geeksforgeeks.org › decision-treeDecision Tree - GeeksforGeeks

   www.geeksforgeeks.org › decision-tree

   • Cached

   May 17, 2024 · Learn what decision trees are, how they work, their advantages and disadvantages, and their applications in various fields. Find out how to create, prune, and visualize decision trees using different programming languages and algorithms.

   • Video Duration: 19 min

5. www.ibm.com › topics › decision-treesWhat is a Decision Tree? | IBM

   www.ibm.com › topics › decision-trees

   • Cached

   A decision tree is a non-parametric supervised learning algorithm, which is utilized for both classification and regression tasks. It has a hierarchical, tree structure, which consists of a root node, branches, internal nodes and leaf nodes.

6. towardsdatascience.com › understanding-decisionUnderstanding Decision Trees (once and for all!) | by ...

   towardsdatascience.com › understanding-decision

   • Cached

   Mar 2, 2019 · Learn how to use Decision Trees, one of the simplest and most interpretable algorithms in Machine Learning, to predict iris species from petal and sepal widths. See how the tree is built iteratively, how to measure its performance, and how to visualize it.

7. People also ask

   What is a decision tree supervised learning algorithm?

   • A decision tree is a non-parametric supervised learning algorithm for classification and regression tasks. It has a hierarchical tree structure consisting of a root node, branches, internal nodes, and leaf nodes. Decision trees are used for classification and regression tasks, providing easy-to-understand models.

   Decision Tree? [A Step-by-Step Guide] - Analytics Vidhya

   www.analyticsvidhya.com/blog/2021/08/decision-tree-algorithm/

   See all results for this question

   What is a decision tree in machine learning?

   • A. A decision tree is a tree-like structure that represents a series of decisions and their possible consequences. It is used in machine learning for classification and regression tasks. An example of a decision tree is a flowchart that helps a person decide what to wear based on the weather conditions. Q2.

   Decision Tree? [A Step-by-Step Guide] - Analytics Vidhya

   www.analyticsvidhya.com/blog/2021/08/decision-tree-algorithm/

   See all results for this question

   What is a decision tree?

   • It is a graphical representation for getting all the possible solutions to a problem/decision based on given conditions. It is called a decision tree because, similar to a tree, it starts with the root node, which expands on further branches and constructs a tree-like structure.

   Decision Tree Algorithm in Machine Learning - Javatpoint

   www.javatpoint.com/machine-learning-decision-tree-classification-algorithm

   See all results for this question

   How does a decision tree algorithm work?

   • Decision Tree algorithm works in simpler steps Starting at the Root: The algorithm begins at the top, called the “root node,” representing the entire dataset. Asking the Best Questions: It looks for the most important feature or question that splits the data into the most distinct groups. This is like asking a question at a fork in the tree.

   Decision Tree? [A Step-by-Step Guide] - Analytics Vidhya

   www.analyticsvidhya.com/blog/2021/08/decision-tree-algorithm/

   See all results for this question

8. scikit-learn.org › stable › modules1.10. Decision Trees — scikit-learn 1.5.1 documentation

   scikit-learn.org › stable › modules

   • Cached

   Decision Trees (DTs) are a non-parametric supervised learning method used for classification and regression. The goal is to create a model that predicts the value of a target variable by learning simple decision rules inferred from the data features. A tree can be seen as a piecewise constant approximation.