Bissoy.com
Doctors Medicines MCQs Q&A

Practical decision tree learning algorithms are based on heuristics.

Practical decision tree learning algorithms are based on heuristics. Correct Answer True

Practical decision tree learning algorithms are based on heuristics such as a greedy approach, where the tree is constructed gradually, and locally optimal decisions are made at the construction of each node. Such algorithms cannot guarantee to return the globally optimal decision tree but tend to work reasonably well in practice.

Related Questions

Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode {              treeptr leftMostChild, rightSibling; }; int DoSomething (treeptr tree) {              int value=0;              if (tree != NULL) {              if (tree->leftMostChild == NULL)              value = 1;    else               value = DoSomething(tree->leftMostChild);               value = value + DoSomething(tree->rightSibling);     }               return(value); } When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the 
Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?
Which of the following statements regarding tree are correct? (A) All the links of a tree together does not constitute the complement of the corresponding tree (B) A connected subgraph of a connected graph is a tree if there exist (n - 1) nodes of the group (C) A connected subgraph of a connected graph is a tree if there exist many paths between any pair of nodes in it (D) The number of terminal nodes of end vertices of every tree are atleast two (E) Every connected graph has atleast one tree Choose the correct answer from the options given below: (1) (A) and (B) only (2) (B) and (C) only (3) (B) and (D) only (4) (D) and (E) only
According to Robert M. Gagne, which learning types precede concept learning? a) Rule learning b) Sign learning c) Problem solving learning d) Verbal association learning e) S.R Learning Choose the correct option:
Which of the following indicate the pillars of learning contained in the UNESCO Report, 1996, “Learning the Treasure Within”, a) Learning to know b) Learning to be c) Learning to do d) Learning to understand e) Learning to live together
Which of the following statements differentiate teaching from learning? A) Teaching is a social act while learning is a personal act B) Teaching implies learning C) Teaching is like selling while learning is like buying D) Teaching can occur without learning taking place E) In teaching, influence is directed towards learning and learner, while in learning it is usually towards oneself Choose the correct answer from the following options:
In the following question, there are six parts marked S1, S6, P, Q, R and S. The position of S1 and S6 are fixed. Some parts of the sentence have been jumbled up. Rearrange these parts and choose the proper sequence from the given options. (S1) Once upon a time, there lived a farmer in a village, beside a forest. (P) When the farmer was a little boy, he spent much of his time playing with the apple tree (Q) Those days, the apple tree had given the choicest of apples to him (R) However, as time passed, the apple tree became old and stopped bearing fruits (S) He had a big garden that had an old apple tree and other plants, trees and beautiful flowers (S6) Now that the farmer was not getting any apples from the tree, he decided that the tree was useless and cut it.
In the following question, there are six parts marked S1, S6, P, Q, R and S.The position of S1 and S6 are fixed. Some parts of the sentence have been jumbled up. Rearrange these parts and choose the proper sequence from the given options. (S1) Once upon a time, there lived a farmer in a village, beside a forest. (P) When the farmer was a little boy, he spent much of his time playing with the apple tree (Q)Those days, the apple tree had given the choicest of apples to him (R) However, as time passed, the apple tree became old and stopped bearing fruits (S)He had a big garden that had an old apple tree and other plants, trees and beautiful flowers (S6) Now that the farmer was not getting any apples from the tree, he decided that the tree was useless and cut it.
A straight tree breaks due to storm and the broken part bends so that the top of the tree touches the ground making an angle of 60° with the ground. The distance from the foot of the tree to the point, where the top point touches the ground is 15 m. Find the ratio between total height of the tree and the distance from foot of the tree to top point of the tree.
Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-­leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n­-1 nodes