hw2 - CSC-5120-09 CSC-5120 Assignment 2 (Fall 2009) Due...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC-5120 Assignment 2 (Fall 2009) Due Date and Time: 3:00 p.m. 12th Nov, 2009 CSC-5120-09 1. In a classification problem we are given a relational table with a set of attributes a 1 , ..., a m where a 1 is a special attribute for classes . The problem is to build a classifier based on the data in the table for classifying any new instance with given values of a 2 , a 3 , ...a m . Decision tree is a classical classifier for such a problem. However, association rules of the form A c where A is a set of attribute values for a subset of a 2 , ..a m and c is a certain class in a 1 may also help to determine classes. Propose a method to build a decision tree based on association rules that are mined from the dataset. That is, the decision tree is not built from the raw table but from the association rules instead. Note that there can be different association rules for the same class, e.g. x, y c 1 , and y, z c 1 . Part of your solution is to decide which rules are to be used and how they are used. 2. K-means is a classical algorithm for clustering.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/23/2010 for the course CSC CSC5120 taught by Professor Adafu during the Fall '09 term at CUHK.

Page1 / 2

hw2 - CSC-5120-09 CSC-5120 Assignment 2 (Fall 2009) Due...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online