Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1of 2
1. List the advantages of using decision trees.
2. Discuss the two approaches to improve quality of hierarchical clustering.
3. List the applications of cluster analysis. 4. Define data stream mining. 5. Give the taxonomy of web mining. 6. How effective are Bayesian classifiers? 7. What is an outlier? 8. What are the weaknesses of hierarchical clustering? 9. Define unstructured text. 10. Draw the structure of web mining. 11. List the characteristics of k-nearest neighbor algorithm. 12. Give Brief Discussion about Clustering Problem Definition? 13. What is the need of outlier detection? List two applications of it. 14. Define web mining. 15. Define text clustering. 16. Illustrate the Measures for Selecting the Best Split?
17. Explain about Bayesian Belief Networks?
18. Give Specific techniques, Key Issues in Hierarchical Clustering.
19. Explain about Partitioning Clustering-K-Means Algorithm. 20. Give brief explanation about unstructured text. 21. Describe episode rule discovery for
22. Explain K- Nearest neighbor classification-Algorithm and Characteristics?
23. What are the advantages of PAM algorithm over k-means algorithm?
24 Explain about Outlier Detection?
25. State and explain web usage mining ?
26. Summarize about Text mining
27. Explain about Bayesian Belief Networks ? (CO3)(BTL2)
28. Describe K- Nearest neighbor classification-Algorithm and Characteristics ?
29. Compare k-means with k-medoids algorithms for clustering.
30. Distinguish between Agglomerative Methods and divisive methods.
31. Explain about web content mining.
32. Write about hierarchy of categories and text clustering.