BITS WILP Advanced Data Mining Mid-Sem Exam (Regular) 2017-H2

survival8: BITS WILP Menu Content

BITS WILP Menu Content

23 comments:

  1. Replies
    1. Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download Now

      >>>>> Download Full

      Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download LINK

      >>>>> Download Now

      Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download Full

      >>>>> Download LINK Ye

      Delete
  2. i tried mailing you , but it is not going through. Can you please share the answers to this question paper if you have.

    Thanks

    ReplyDelete
    Replies
    1. Mail me at ashishjainblogger@gmail.com
      Mention the subject(s) for which you want help.

      Delete
  3. Thanks for putting up the content in such organized manner.Great Help. Thumbs UP !!

    ReplyDelete
  4. Recorded lecture links are not working please help

    ReplyDelete
  5. Is there a group/whatsapp group for Mtech in computing systems and Infrastructure?

    ReplyDelete
  6. Very useful .. Thank you very much

    ReplyDelete
  7. Are you Looking for Smart Device Development? QuantaEd Solutions is the Best Smart Device Development Company, We design and develop smart devices that suit the healthcare requirements. For any inquiry call us we will provide all kind of assistance. For more details visit- https://quantaedsolutions.com

    ReplyDelete
  8. AI & ML in Dubai
    https://www.nsreem.com/ourservices/ai-ml/
    Artificial intelligence is very widespread today. In at least certainly considered one among its various forms has had an impact on all major industries in the world today, NSREEM is #1 AI & ML Service Provider in Dubai
    1634348519669-9

    ReplyDelete
  9. Thank you for giving valuable information about software for portable device, we can also develop custom software from pixabulous design.

    ReplyDelete
  10. This article explains in a clear manner. Nice way of explaining. Thanks for sharing. cloud engineering services

    ReplyDelete
  11. WILP is a set of educational programs designed in such a way that they can be easily integrated into your work life. Earlier, only highly developed nations like the US and Europe were indoctrinating WILPs but now the WILP in India have also gained a lot of popularity.

    ReplyDelete
  12. Candidates who wish to take the BITSAT should begin studying as soon as possible. Due to the high level of competition, it is critical to follow the best BITSAT 2022 preparation tips recommended by professionals. This blog post contains BITSAT 2022 study suggestions as well as exam pattern and syllabus information. Continue reading to get answers to all of your questions. To know more information visit @ SSSi Online Tutoring Services.

    ReplyDelete
  13. Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download Now

    >>>>> Download Full

    Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download LINK

    >>>>> Download Now

    Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download Full

    >>>>> Download LINK bO

    ReplyDelete
  14. The BITS Pilani Admission Process is designed to select the brightest minds for its world-class programs. With its independent entrance exam, BITSAT, and direct admission opportunities for board toppers, the institute ensures that only the most deserving candidates secure a place.

    ReplyDelete




Birla Institute of Technology & Science, Pilani
Work-Integrated Learning Programmes Division
First Semester 2017-2018

Mid-Semester Test
(EC-2 Regular)

Course No.                  : SS ZG548  
Course Title                 : ADVANCED DATA MINING  
Nature of Exam           : Closed Book
Weightage                    : 35%
Duration                      : 2 Hours  
Date of Exam              : 24/09/2017     (FN)
No of pages: 2
No of questions: 4
Note:
1.        Please follow all the Instructions to Candidates given on the cover page of the answer book.
2.        All parts of a question should be answered consecutively. Each answer should start from a fresh page.  
3.        Assumptions made if any, should be stated clearly at the beginning of your answer.

Q1. Explain the following concepts with respect to data mining.                               [2 + 2 + 2 = 6]
a. Difference between error and noise in data
b. Predictive and Descriptive data mining tasks with example
c. Overfitting and regularization.

Q2. Describe incremental association mining setting. How fast update algorithm (FUP) differs from fast update 2 algorithm (FUP2). Explain how one can maintain certain data structures required by FUP2 in an incremental way.                                                 [1 + 1 + 2 = 4]

Q3. Consider association rule mining for incremental databases. What are the main advantages of using Compact Pattern Stream tree (CPS Tree) over FP-Tree. Assuming a pan contains two transactions (that is restructuring happens after arrival of two transactions). And each window to contain two pans. Consider step by step arrival of following six transactions
1. A, B, C, D, E
2. B, C, E, F
3. E, C, D, F
4. B, F, C, A
5. D, E, C
6. F, B, D
Starting from a null CPS tree, draw all intermediate CPS tree on incremental arrival of every transaction. Clearly explain modifications to the CPS tree in each step.   [2 + 8 = 10]

Q4. Consider the problem of clustering an evolving database. Assume database updates happens at a regular interval. Let initially there be 15 datum points P1, P2, …, P15 spread in 2D space. Distances between every pair of datum point is provided in Table-1. A Density-Based Spatial Clustering algorithm DBSCAN is applied with parameters Eps=31 and MinPts=3.                                                                         [3 + 1 + 3 + 3 + 1 + 4 = 15]
i) Identify Core, border and noise points
ii) How many clusters are there?  
iii) Determine the cluster membership for each of the core or border point  
Consider the arrival of five more data points P16, P17, P18, P19, P20 in the database. Now we have 20 datum points.   Refer Table-1 to get the distance between any two datum point of the database. Apply incremental DBSCAN on updated database to report the following.

iv) Identify Core, border and noise points  
v) How many clusters are there?  
vi) Determine the cluster membership for each of the core or border point  

Table 1.: Distance between every pair of datum points is given below

**********

No comments:

Post a Comment