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