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