Vous êtes sur la page 1sur 3

C Abdul Hakeem College of Engineering and Technology

Melvisharam-632509
Department of Information Technology
IT6711-DATA MINING LABORATORY
Anna University Practical Examination-October 2018

List of Experiment

1. Create a Data Warehouse

2. Apply Apriori Algorithm to large data sets

3. Apply FP-Growth Algorithm to large data sets

4. Apply K-means clustering to large data sets

5. Apply One Hierarchical clustering algorithm to large data sets

6. Apply Bayesian Classification to large data sets

7. Apply Decision Tree to large data sets

8. Apply Support Vector Machines to large data sets

9. Create Applications of classification for web mining

10. Create Case Study on Text Mining or any commercial application

Internal Examiner External Examiner


M.Mohammed Mustafa
AP/IT
5106/CAHCET
ANNA UNIVERSITY PRACTICAL EXAMINATION, OCTOBER 2018

5106 - C. ABDUL HAKEEM COLLEGE OF ENGINEERING AND TECHNOLOGY

Department of Information Technology

Subject Code/Title: IT6711-DATA MINING LABORATORY Year/Semester: IV/VII


Date : 26.10.2018 Session: FN
Time : 9.30 am to 12.30 pm Duration: 3 hours

SKILLED REPORT

Quantity Quantity
S. No List of equipments Deficiency
Required Available

Software Requirements:
35
1 WEKA, Rapid Miner or 35 Nil
(Max)
Equivalent

Hardware Requirements:
Intel Core i3 processor +55 TC
35
2 Motherboard 35 Nil
(Max)
4 GB DDR3 RAM
500 GB Hard Disk

INTERNAL EXAMINER SKILLED EXAMINER EXTERNAL EXAMINER


M.Mohammed Mustafa
AP/IT
5106/CAHCET
ANNA UNIVERSITY PRACTICAL EXAMINATION, OCTOBER 2018

5106 - C. ABDUL HAKEEM COLLEGE OF ENGINEERING AND TECHNOLOGY

Department of Information Technology

Subject Code/Title: IT6711-DATA MINING LABORATORY Year/Semester: IV/VII


Date : 26.10.2018 Session: FN
Time : 9.30 am to 12.30 pm Duration: 3 hours

MARK ALLOCATION

Marks
S. No Description
Allotted
1 Aim & Algorithm/Procedure 20
2 Description 40
3 Execution & Result 30
4 Viva – Voce 10
5 Total 100

INTERNAL EXAMINER EXTERNAL EXAMINER


M.Mohammed Mustafa
AP/IT
5106/CAHCET

Vous aimerez peut-être aussi