Start where you are. Use what you have. Do what you can.
--Your friends at LectureNotes

Previous Year Exam Questions for Data and Webmining - DWM of 2017 - bput by Verified Writer

  • Data and Webmining - DWM
  • 2017
  • PYQ
  • Biju Patnaik University of Technology BPUT - BPUT
  • Computer Science Engineering
  • B.Tech
  • 63 Offline Downloads
  • Uploaded 1 year ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

Registration no: Total Number of Pages: 2 B.Tech PECS5409 8th Semester Regular / Back Examination 2016-17 DATA AND WEB MINING BRANCH: CSE Time: 3 Hours Max Marks: 70 Q.CODE: Z205 Answer Question No.1 which is compulsory and any five from the rest. The figures in the right hand margin indicate marks. Q2 a) Define the lift of an association rule. b) Consider the following transaction database: TransID Items T100 A, B, C, D T200 A, B, C, E T300 A, B, E, F, H T400 A, C, H Suppose that minimum support is set to 50% and minimum confidence to 60%. i. List all frequent itemsets together with their support. ii. Which of the itemsets from a) are closed? Which of the itemsets from a) are maximal? iii. For all frequent itemsets of maximal length, list all corresponding association rules satisfying the requirements on (minimum support and) minimum confidence together with their confidence. (2 x 10) (2) (8) 1 Answer the following questions: a) Write down the difference between Data mining and Data mining. b) What do you mean by Attribute Selection Measure? c) What is spatial data mining? Write down two applications of spatial data mining. d) Write down the mathematical formulation of association rule mining problem. e) What Model based clustering method? f) Write down the difference between descriptive and prescriptive data mining task. g) What is a crawler? And how it works? h) What is Knowledge Discovery? i) Given two objects represented by the tuples (22, 1, 42, 10) and (20, 0, 36, 8): Compute the Minkowski distance between the two objects, using q = 3. j) What is Opinion Spam. Page Q1

Text from page-2

Q3 a) Briefly outline the major steps of decision tree classification (5) b) Why is tree pruning useful in decision tree induction? What is a drawback of using a separate set of tuples to evaluate pruning? (5) Q4 a) Briefly outline how to compute the dissimilarity between objects described by the following types of variables: (a) Numerical (interval-scaled) variables (b) Categorical variables (c) Ratio-scaled variables (d) Nonmetric vector objects (5) b) Why is outlier mining important? Briefly describe the different approaches behind distanced-based outlier detection and densitybased local outlier detection. Q5 a) Describe Information Retrieval Models with examples. (5) b) Describe social network analysis measures centrality and prestige in detail and its usability (5) Q6 a) What are the different issues for implementation of a Crawler? Describe (5) (5) it in detail. b) Explain Recommender Systems and Collaborative Filtering in detail. Q7 Both k-means and k-medoids algorithms can perform effective clustering. Illustrate the strength and weakness of k-means in comparison with the k-medoids algorithm. (5) (10) Suppose that the data mining task is to cluster the following eight points (with (x, y) representing location) into three clusters: A1(2, 10), A2(2, 5), A3(8, 4), B1(5, 8), B2(7, 5), B3(6, 4), C1(1, 2), C2(4, 9): The distance function is Euclidean distance. Suppose initially we assign A1, B1, and C1 as the center of each cluster, respectively. Use the kmeans algorithm to show only (a) The three cluster centers after the first round execution (b) The final three clusters Write short answer on any TWO: a) Backpropagation Algorithm (5 x 2) b) SVM d) Bayesian Classification 2 c) Edit Distance Page Q8

Lecture Notes