This document outlines questions from various parts (A, B, C) and units (I-V) of a data mining subject question bank. It includes definitions, explanations and discussions of key concepts like classification, clustering, association rules and algorithms like k-means, apriori and neural networks.
This document outlines questions from various parts (A, B, C) and units (I-V) of a data mining subject question bank. It includes definitions, explanations and discussions of key concepts like classification, clustering, association rules and algorithms like k-means, apriori and neural networks.
This document outlines questions from various parts (A, B, C) and units (I-V) of a data mining subject question bank. It includes definitions, explanations and discussions of key concepts like classification, clustering, association rules and algorithms like k-means, apriori and neural networks.
This document outlines questions from various parts (A, B, C) and units (I-V) of a data mining subject question bank. It includes definitions, explanations and discussions of key concepts like classification, clustering, association rules and algorithms like k-means, apriori and neural networks.
QUESTION BANK SUBJECT NAME: DATA MINING SUBJECT CODE: SZ26B UNIT – I PART – A (2 Mark Questions) 1. Define Data Mining. 2. How Data mining access differ from traditional access. 3. List out the Data Mining Task 4. What is Classification? 5. What is Recursion? 6. What is Clustering? 7. List out the Visualization techniques in Data Mining. 8. What is Database? 9. What is KDD? 10. What is Pattern Evaluation? 11. Define Data Cleaning. 12. What is Data warehouse?
PART – B (5 Mark Questions)
1. Explain in detail about Data Mining Architecture.
2. Discuss the Steps in KDD Process. 3. Write notes on Recursion and Classification. 4. Discuss:”Data Mining issues”. 5. Write notes about Data Mining Algorithms
PART – C (10 Mark Questions)
1. Discuss: Data Mining versus Knowledge Discovery.
2. Explain in detail about Data Mining Task. 3. Explain the Social Implication of Data Mining. 4. Explain in detail about the Architecture of Data warehouse. 5.Describe in detail about the Visualization techniques in Data Mining. UNIT – II PART – A (2 Mark Questions)
1.What is OLTP? 2.What is IR? 3.What is decision support system? 4.What is Dimensional Module? 5.What is Index? 6.What is OLAP? 7.What is pattern matching? 8.What is Association Rule? 9.What is Point Estimation? 10.What is Parametric Models? 11.What is Decision Tree? 12.What is Neural Network?
PART – B (5 Mark Questions)
1.Explain in detail about Summarization.
2.Discuss about Parametric and Non parametric Models. 3.What is Hypothesis Testing? Explain. 4.Explain about Similarity Measures. 5.Write a notes about IR.
PART – C (10 Mark Questions)
1. Explain in detail about Static Perspective in Data Mining.
2.Describe:”Similarity Measures”. 3.Explain in detail about Bayes Theorem. 4.Explain in detail about Decision trees. 5.Explain in detail about Neural Network. 6.Explain in detail about Genetic Algorithm. UNIT – III
PART – A (2 Mark Questions)
1.What is Classification? 2.List the issues in Classification. 3.What is Statistical Algorithm? 4.What is Bayes Theorem? 5.What is Bayesian Classification? 6.What is Decision Tree.? 7.What is Propagation? 8.What is Perceptrons? 9.What is Supervised Learning? 10.What is Back Propagations?
PART – B (5 Mark Questions)
1.Explain in detail about Statistical Based Algorithm. 2.Discuss the issues in Classification. 3..Write a notes about Distance Based Algorithm. 4.Explain in detail about K-Nearest Neighbors 5.Explain in detail about Decision Tree Indentation. 6.Write a note on a. Classification b.Regression.
PART – C (10 Mark Questions)
1.Explain in detail about Neural Network Algorithm.
2.Write a notes on “CARD”. 3.Expalin about NN Supervised Learning. 4.Explain about Rule Based Algorithm. 5.Write a notes on a.c4.0 b.c5.0s UNIT – IV PART – A (2 Mark Questions) 1.What is Clustering? 2.What is Out Layers? 3.What is Dendrograms? 4. Define:”Genetic Algorithm”. 5.Define :”Spanning Tree”. 6.What is K –Means Clustering? 7.What is Hierarchical Algorithm? 8.Define:”PAM Algorithm”.
PART – B (5 Mark Questions)
1.Explain in detail about Bond Energy Algorithm.
2.Explain:”Self-Organising feature maps”. 3.Write a note on a. Spanning Tree b. Dendrograms. 4.Descibe about clustering with Genetic Algorithm. 5.Explain about clustering with Neural Networks.
PART – C (10 Mark Questions)
1.Explain in detail about K-Means Clustering.
2.Explain in detail about Clustering with large Database. 3.Explain in detail about BRICH. 4.Descibe about DPSCAN(Density Based Patel Clustering of Application). 5.Explain in detail about CURE Algorithm(Clustering Using Representatives). UNIT – V PART – A (2 Mark Questions)
1.What is Association ? 2.Define : ‘Large Item Sense ‘ 3.What is Apriori algorithm ? 4.What is Partitioning Algorithm ? 5.What is Task Parallelism ? 6.Define :’Sampling Algorithm ‘ 7.Define :’Association Rules’
PART – B (5 Mark Questions)
1.Write a note on a. Task Parallelism b. Incremental Rules 2.Explain in detail about Partitioning algorithm. 3.Explain in detail about Apriori Algorithm. 4.Explain in detail about Advanced Association Rules. 5.Explain in detail about Multilevel Association Rules.
PART – C (10 Mark Questions)
1. Explain in detail about Generalize Association Rule
2. Explain in detail about Sampling Algorithm. 3. Explain in detail about Quantitative Association Rules. 4.Write a note on “Measuring The Quality of Loops”.
