Solved by Expert Tutors
Solved by Expert Tutors
Question

Solutions for machine problems and need all codes written to solve them

CS412: Introduction to Data Mining Fall 2015 Assignment 3 Due: 10/22/2015 11:59pm General Instruction Errata: After the assignment is released, any further corrections of errors or clarifica- tions will be posted at the Errata page at Piazza . Please watch it. Feel free to talk to other members of the class when doing the homework. We are more concerned about whether you learn how to solve the problem than whether you solve it entirely on your own. You should, however, write down the solution yourself. Please use Piazza first if you have questions about the homework. Also feel free to send us e-mails and come to office hours. For each question, you will NOT get full credit if you only give a final result. Necessary calculation steps and reasoning are required. For each question, you should show the necessary calculation steps and reasoning—not only final results. Keep the solution brief and clear. For a good balance of cognitive activities, we label each question with an activity type: – L1 (Knowledge) Definitions, propositions, basic concepts. – L2 (Practice) Repeating and practicing algorithms/procedures. – L3 (Application) Critical thinking to apply, analyze, and assess. Assignment Submission Please submit your work before the due time. We do NOT accept late homework! Please submit your answers electronically via Compass ( http://compass2g.illinois. edu ). Contact TAs if you have technical difficulties in submitting the assignment. Please type your answers in an Answer Document , and submit it in PDF. Hand- written answers are not acceptable . This assignment consists of four written assignments and one large Machine Problem (MP). Your answers to all questions (including MP) should be included in one Answer Document, named as NetId assign3 answer.pdf . The four written questions do not require programming at all. The last part is the first MP (not a mini one) we have in this course. It consists of several programming assignments, which usually take more time than written assignments, so please start early . Find detailed submission guidelines for codes and results in the requirements of MP. 1
Background image of page 1
2 Question 1 (12 points) Based on the tiny database of 5 transactions in Table 1, use the Apriori algorithm to find the frequent patterns with relative min sup = 0 . 6 . Purpose Get a better understanding as well as hands-on experience of the Apriori algorithm. Requirements For this question, you are required to simulate the basic Apriori algorithm and write down all intermediate as well as final results. No programming is needed. Use the abbreviations we give you (C1, L1. ..) to denote which list you are writing about. You may use a table to contain all lists, or just write them one by one. For each itemset you write down in the L i lists, put its corresponding absolute support after it, with a colon between them, such as L 1 = { m : 4 ,... } . Do not forget to write down the actions (pruning, self-joining or db-scanning) you take to generate F1 and C2. Trans. Items 1 b,d,f,g,l 2 f,g,h,l,m,n 3 b,f,h,k,m 4 a,f,h,j,m 5 d,f,g,j,m Table 1: A tiny transaction database a. (2 0 ,L 1) List all candidate 1-itemsets (C1). What will you do to get rid of non-frequent 1-itemsets ( Choose one from pruning, self-joining and db-scanning )? List all frequent 1-itemsets (L1). b. (2 0 ,L 1) What will you do to generate all candidate 2-itemsets (C2) ( Choose one from pruning, self-joining and db-scanning )? List all itemsets in C2. c. (1 0 ,L 1) Take the same action you choose for computing L1 from C1, and list all frequent 2-itemsets (L2) computed from C2. d. (3 0 ,L 1) To generate all candidate 3-itemsets (C3) from L2, what is the extra action you need to consider besides the one you take from L1 to C2 in sub-question b ( Choose one from pruning, self-joining and db-scanning )? List all itemsets in C3. Are they all frequent?
Background image of page 2
Show entire document
Sign up to view the entire interaction

Step-by-step answer

ultrices ac magna.

nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna. Fusce dui lectus, congue vel laoreet ac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentes

Solutions for machine problems and need all....zip - Preview not available

Subscribe to view the full answer

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question
Let our 24/7 Mechanical Engineering tutors help you get unstuck! Ask your first question.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes