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