×
WORK HARD IN SILENCE; LET SUCCESS MAKE THE NOISE
--Your friends at LectureNotes
Close

Previous Year Exam Questions for Data and Webmining - DWM of 2018 - bput by Bput Toppers

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

Share it with your friends

Leave your Comments

Text from page-1

Registration No : Total Number of Page : 01 B.Tech. PECS5409 8th Semester Regular / Back Examination 2017-18 DATA AND WEB MINING BRANCH : CSE Time : 3 Hours Max Marks : 70 Q.CODE : C553 Answer Question No.1 which is compulsory and any five from the rest. The figures in the right hand margin indicate marks. Answer all parts of a question at a place. Q1 a) b) c) d) e) f) g) h) i) j) Q2 Answer the following questions : Define multi-level association rule. Define DBSCAN. What is splitting criterion? List out the constraints in constraint-based association mining. What is object type prediction? What do you mean by a HUB? Explain Universal crawlers. What is page rank? What is a decision tree? Define Opinion Mining. (2 x 10) Illustrate diagrammatically the types of knowledge discovered during data mining. (10) Q3 a) b) Write short notes on Privacy Preserving Data Mining. Write short notes on feature-based Opinion Mining. (5) (5) Q4 a) b) Explain k-nearest neighbor classifier. Write short notes on Classification by Back Propagation. (5) (5) Explain k-means and k-medoids methods with example. (10) Explain outlier analysis. Explain CART. (5) (5) Explain various types of data in cluster analysis with example. (10) Q5 Q6 a) b) Q7 Q8 a) b) c) d) Write short answer on any TWO : Classification vs. Prediction String Matching Mining Multilevel Association Rules from Transaction Databases Tree Pruning (5 x 2)

Lecture Notes