Bootstrap samples are generated from the training set to model the base detectors At each internal node of a base decisi

[answerhappygod]

Bootstrap samples are generated from the training set to model the base detectors
At each internal node of a base decision tree p attributes are randomly chosen
The decision trees used as base detectors are unpruned
Random Forest is a linear classifier
2. In the Apriori algorithm of Association Analysis the support counting step is expensive. Which of the following data structures can be utilized to make the support counting step faster?
Linked List
Stack
Queue
Hash Tree