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