A) both a and b B) prediction C) None of these D) classification
A) low diamesional data B) High dimensional data C) None of these D) medium dimensional data
A) steam B) leaf C) root D) None of these
A) Information Gain B) None of these C) Entropy D) Gini Index
A) None of these B) Non-linear patterns in the data can be captured easily C) Both D) What are the advantages of the decision tree?
A) None of these B) Random forest are easy to interpret but often very accurate C) forest are Random difficult to interpret but often very accurate D) Random forest are difficult to interpret but very less accurate
A) Data Mining B) Warehousing C) Data Selection D) Text Mining
A) Knowledge Discovery Database B) Knowledge data house C) Knowledge Discovery Data D) Knowledge Data definition
A) To obtain the queries response B) In order to maintain consistency C) For data access D) For authentication
A) All of the above B) Association and correctional analysis classification C) Cluster analysis and Evolution analysis D) Prediction and characterization
A) The goal of the k-means clustering is to partition (n) observation into (k) clusters B) The nearest neighbor is the same as the K-means C) K-means clustering can be defined as the method of quantization D) All of the above
A) 4 B) 3 C) 2 D) 5
A) Find the explained variance B) Avoid bad features C) Find which dimension of data maximize the features variance D) Find good features to improve your clustering score
A) Use Standardize the best practices of data wrangling B) data allows other people understand better your work C) Find the features which can best predicts Y D) Make the training time more fast
A) All of the mentioned B) MCRS C) MARS D) MCV
A) None of the mentioned B) plotsample C) featurePlot D) levelplot
A) All of the above B) postProcess C) process D) preProcess
A) True B) False
A) ICA B) None of the mentioned C) PCA D) SCA
A) False B) True |