DWDM Bits New
DWDM Bits New
A. OLAP
B. OLTP
C. OLAP and OLTP
D. Operational databases
B. Data Transformation
C. Data Reduction
D. Data Integration
A. Clementine
B. Intelligent Miner
C. Weka3
D. Enterprise Miner
13. ___ works to remove the noise from the data that includes techniques like binning, clustering,
and regression.
A. Smoothing
B. Outliers
C. Clustreing
D. Association
B. False
18. To detect fraudulent usage of credit cards, the following data mining task should be used
A. Outlier analysis
B. prediction
C. association analysis
D. feature selection
19. Dimensionality reduction reduces the data set size by removing _________ Select one:
A. composite attributes
B. derived attributes
C. relevant attributes
D. irrelevant attributes
20. Data set {brown, black, blue, green , red} is example of Select one:
A. Continuous attribute
B. Ordinal attribute
C. Numeric attribute
D. Nominal attribute
21.The problem of finding hidden structure in unlabeled data is called
A. Supervised learning
B. Unsupervised learning
C. Reinforcement learning
D. None of these
23. This data transformation technique works well when minimum and maximum values for a
real-valued attribute are known. Select one:
A. z-score normalization
B. min-max normalization
C. logarithmic normalization
D. decimal scaling
24. What is the difference between supervised and unsupervised learning?
A. Supervised learning requires labeled data, while unsupervised learning does not.
B. Supervised learning uses clustering algorithms, while unsupervised learning uses
classification algorithms.
C. Supervised learning is used for regression analysis, while unsupervised learning is
used for clustering.
D. There is no difference between supervised and unsupervised learning.
25. Which of the following is not a data mining task?
A. Classification
B. Clustering
C. Regression
D. Linear Programming
26. Which of the following is a data reduction technique?
A. Clustering
B. Classification
C. Sampling
D. Regression
27. Which of the following is not a type of decision tree node?
A. Root node
B. Leaf node
C. Decision node
D. Branch node
28. Which of the following is a classification algorithm?
A. K-means
B. Decision tree
C. Apriori
D. DBSCAN
29. Which of the following is a supervised learning algorithm?
A. K-means clustering
B. Decision tree
C. Apriori algorithm
D. DBSCAN clustering
30. Which of the following is not a type of data visualization?
A. Scatter plot
B. Bar chart
C. Tree map
D. Linear regression