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