CS412: Introduction to Data Mining
Spring 2016
Assignment 2
Xiangyu Chen
Due: 03/09/2016 11:59pm
General Instruction
Feel free to talk to other members of the class while doing the homework. We are more
concerned that you learn how to solve the problem t
CS412
Midterm Exam Results
Fall 2014
Kevin C. Chang
What really counts is the
process
Here is the statistics about students' feedbacks.
(There is 180 exam paper in total. )
a) Format/Style: like 132, dislike 34, empty 14
b) Difficulty: hard 73, easy 4,
CS412: Introduction to Data Mining
Fall 2015
Assignment 2: Chapters 4, 5
Due: 10/08/2015 11:59pm
General Instruction
Errata: After the assignment is released, any further corrections of errors or clarications will be posted at the Errata page at Piazza.
UIUC-CS412 An Introduction to Data Warehousing and Data Mining (Fall 2012)
Midterm Exam
(Wednesday, Oct. 24, 2012, 90 minutes, 100 marks, single sheet reference, brief answers)
Name:
NetID:
Score: Answer Key
1. [26] Data preprocessing.
(a) [6] What are th
CS412: Introduction to Data Mining
Spring 2016
Assignment 5
Due: 05/04/2016 11:59pm
General Instruction
This is an individual assignment. You can discuss this assignment on Piazza but please
do not work together or share code or results.
Libraries about
CS412: Introduction to Data Mining
Fall 2015
Assignment 5
Due: 12/3/2015 11:59pm
General Instruction
Errata: After the assignment is released, any further corrections of errors or clarications will be posted at the Errata page at Piazza. Please watch it.
CS412: Introduction to Data Mining
Fall 2014
Practice Question for Chapter 6: Part 2
Shi Zhi
Due: N/A
General Information
This is a set of sample questions with solutions. It aims at helping you better understand
two algorithms in mining frequent closed p
CS412: Introduction to Data Mining
Fall 2012
Assignment 4 Solution
Handed Out: November 20th , 2012
Due: Dec 10th , 2012
1. [k-Nearest Neigbhor and Support Vector Machine - 14 points]
Suppose we are given a training set as follows
i x1
12
24
35
48
66
x2 l
Data Preprocessing
Attribute: Nominal, Binary, Ordinal, Numeric(Interval, Ratio), Discrete, Continuous
Data set types: Record, Graph and network, Ordered, Spatial, image and multimedia
Visualization methods: Pixel-
oriented: Pi
CS 412 HW3
Yuwei Chen (chen202)
1. Brief (very brief) introduction of the methods in your general purpose
classification framework
I used Decision Tree (C4.5) as basic method, Random Forest as the ensemble version
of the classification method.
UIUC-CS412 An Introduction to Data Warehousing and Data Mining (Fall 2011)
Midterm Exam
(Wednesday, Oct. 19, 2011, 90 minutes, 100 marks, single sheet reference, brief answers)
Name:
NetID:
Score:
1. [30] Data preprocessing.
(a) [10] For data visualizatio
UIUC-CS412 An Introduction to Data Warehousing and Data Mining (Fall 2013)
Midterm Exam
(Thursday, Oct. 17, 2013, 90 minutes, 100 marks, single sheet reference, brief answers)
Name:
NetID:
Score:
1. [30] Data preprocessing.
(a) [6] Present the names of tw
CS412 An Introduction to Data Warehousing and Data Mining (Fall 2009)
Final Exam
(Friday, Dec. 11, 2009, 180 minutes, 100 marks, two sheets of references, brief answers)
Name:
NetID:
Score:
1. [15] Data preprocessing.
(a) [7] Data integration is essential
CS412: Introduction to Data Mining
Fall 2015
Assignment 2: Chapters 4, 5
Due: 10/08/2015 11:59pm
General Instruction
Errata: After the assignment is released, any further corrections of errors or clarications will be posted at the Errata page at Piazza.
UIUC-CS412 Introduction to Data Mining (Spring 2016)
Final Exam, Version 1
Thursday, May 12, 2016
180 minutes, 150 points
Name:
1 [30]
NetID:
2 [30]
3 [47]
4 [43]
Total
1. [30] Preprocessing Data, Data Cube
(a) [4] Present the value range for each of the
CS412: An Introduction to Data Warehousing and Data Mining
Fall 2014
Assignment 2
Huan Gui
Due Date: 10/08/2014
General Instruction
Feel free to talk to other members of the class in doing the homework. We are more
concerned that you learn how to solve t
CS512 (Spring 2011) Advanced Data Mining: Midterm Exam I
(Tuesday, March 1, 2011, 90 minutes, 100 marks brief answers directly written on the exam paper)
Note: Closed book and notes but one reference sheet allowed, scratch paper not need to be returned.
T
CS412: Introduction to Data Mining
Fall 2015
Assignment 5
Due: 12/7/2015 11:59pm
General Instruction
Errata: After the assignment is released, any further corrections of errors or clarications will be posted at the Errata page at Piazza. Please watch it.
UIUC-CS412 An Introduction to Data Warehousing and Data Mining (Fall 2010)
Midterm Exam
(Wednesday, Oct. 20, 2010, 90 minutes, 100 marks, single sheet reference, brief answers)
Name: KEY
NetID: KEY
Score: KEY
1. [28] Data preprocessing.
(a) [5] It is not
UIUC-CS412 An Introduction to Data Warehousing and Data Mining (Fall 2008)
Midterm Exam
(Monday, Oct. 22, 2009, 90 minutes, 100 marks, single sheet reference, brief answers)
Name:
NetID:
Score:
1. [30] Data preprocessing.
(a) [6] For data visualization, t
CS412 Mini-MP2: Preprocessing Data
This mini-MP asks you to use Pentaho Kettle (Spoon) software.
Download (~800MB): http:/community.pentaho.com/projects/data-integration/
Launch: http:/wiki.pentaho.com/display/EAI/02.+Spoon+Introd
Distributive: can be computed for a given data set by partitioning
iceberg, H-Tree, double link, head table, flexible Star: Iceberg +
the data into smaller subsets, compute the measure for each subset
skew; Fragment shell: high dimension, <4 inquired dime
CS412: Introduction to Data Mining
Fall 2015
Assignment 4
Due: 11/19/2015 11:59pm
General Instruction
Errata: After the assignment is released, any further corrections of errors or clarications will be posted at the Errata page at Piazza. Please watch it
CS412: Introduction to Data Mining
Spring 2016
Assignment 2
Due: 03/09/2016 11:59pm
General Instruction
Feel free to talk to other members of the class while doing the homework. We are more
concerned that you learn how to solve the problem than that you
CS412: An Introduction to Data Warehousing and Data Mining
Fall 2013
Assignment 2
Yanglei Song
Handed In: 10/08/2013
Question 1
Assume a base cuboid of 10 dimensions contains only two base cells:
(1) (a1 , a2 , a3 , b4 , ., b9 , b10 ), and (2) (b1 , b2 ,
Data Mining:
Concepts and Techniques
(3rd ed.)
Chapter 7
Jiawei Han, Micheline Kamber, and Jian Pei
University of Illinois at Urbana-Champaign &
Simon Fraser University
2013 Han, Kamber & Pei. All rights reserved.
1
October 22, 2013
Data Mining: Concept
Data mining extraction of interesting (non-trivial, implicit, previously unknown and potentially
useful) patterns or knowledge from huge amount of data
Association nominal attributes
Correlation linear dependence between two numeric variables
Classificati
GETTING TO KNOW YOUR
DATA
Hari Sundaram
[email protected]
http:/sundaram.cs.illinois.edu
adapted from slides by Jiawei Han and Kevin Chang
thank you for
responding to the
survey
2
research
big data
No exams!
learning new ideas
AI
Excited
practical relevanc
INTRODUCTION TO DATA
MINING
Hari Sundaram
[email protected]
http:/sundaram.cs.illinois.edu
adapted from slides by Jiawei Han and Kevin Chang
[email protected]:
DATA MINING,
DATABASE SYSTEMS,
TEXT INFORMATION
SYSTEMS, NETWORKS
Zhai
Sundaram
Parameswaran
Dierent cla
Quiz 4
There are 6 problems total worth 35 points as shown in each question.
You must not communicate with other students during this test.
No books, notes allowed.
No other electronic device except calculators are allowed. You cannot use your mobile
CS 412: Introduction to Data Mining
Spring 2017
Homework 3
Handed Out: March 8, 2017
1
Due: March 29, 2017 11:59 pm
General Instructions
This assignment is due at 11:59 PM on the due date.
We will be using Compass
(http:/compass2g.illinois.edu) for colle