1. Mark the following statements true or false (T/F) (24) 1. Predicting whether one NCAA basketball team will beat another team by 20 points based on the past history information is a regression problem [ ] 2. Data in a data warehouse are stored to provide information from a historical perspective [ 3. Decision tree algorithm suppose to be the best accurate classifier in theory [] 4. Naïve Bayesian classification is too simple to be useful in data mining applications [ 5. Eager classification algorithm has higher accuracy than lazy classification algorithm [] 6. For decision tree algorithm no matter what kinds of mechanism to choose to split the attributes, the results are the same [ ] 7. K-mean algorithm always produces the same clustering results no matter what initial points to begin with the clustering process [] 8. Naive Bayes classification is a supervised method [ ] 9. The Decision Tree construction process covered in this course is a greedy approach [ ] 10. For two independent events A and B, the joint probability P(A and B), the probability that both events A and B will occur, can be computed by the product of P(A) and P(B) i.e., P(A)xP(B). [ ] 11. For two mutually exclusive events A and B, the joint probability P(A and B), the probability that both events A and B will occur, can be computed by the sum of P(A) and P(B), i.e, P(A)+P(B). [ ] 12. For two independent events A and B, the conditional probability P(A|B), the probability that event A will occur given that event B occurs, can be computed by the division of P(A) and P(B), i.e., P(А)P(B). [ ]