Download Mining massive datasets

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Cluster analysis wikipedia , lookup

K-means clustering wikipedia , lookup

K-nearest neighbors algorithm wikipedia , lookup

Nonlinear dimensionality reduction wikipedia , lookup

Transcript
1.
2.
Course
Code
3.
Study programme
4.
Study programme organized by
5.
Cycle
Academic year / semester
Mining massive datasets
KNI_E30
Computer Science and Engineering PhD study
programme
FCSE
Third – PhD
6.
7. ECTS credits 7,5
winter/summer/elective
8.
Teacher
9.
Prerequisites
Prof. d-r Dejan Gjorgjevikj, Prof. d-r Gjorgji
Madzarov
None
Course programme goals (competences):
The students will attain in depth understanding of the machine learning and data mining
10. techniques for massive data sets. They will be able to successfully apply machine learning
algorithms when solving real problems concerning business intelligence, social networks, web
data description. They will be able to concept, analyze, realize and evaluate the developed system
performances.
Course syllabus:
The MapReduce model, associative rules, nearest neighbor search in high dimensional data,
11. reducing dimensions, locality sensitive hashing), recommendation systems, massive data sets
clustering techniques, link analysis, machine learning techniques for massive data sets, data
stream mining, structural data relations retrieval, web advertising, massive data industry
examples.
Teaching methods:
Classes supported with slide presentations, interactive teaching, lab equipment and other
12.
software packages, teamwork, case studies, invited guest lecturers, presentations of project
works, e-learning materials, forums and consultations.
13. Total fund of work hours
7,5 ЕКТС x 30 h = 225 h
14. Available hours distribution
45+30+150 = 225
15. Teaching activities
16. Other activities
17.
15.1. Theoretical classes
45 h
Practical classes (labs,
15.2. exercises), seminars,
team work
30 h
16.1. Project tasks
50 h
16.2. Self study
50 h
16.3. Homework
50 h
Grading
17.1. Tests
40 points
17.2. Seminar work/ project (presentation: written and oral)
50 points
17.3. Active participation
18. Grading criteria (points/grade)
to 59 points
from 60 to 68 points
from 69 to 76 points
10 points
5 (five) (F)
6 (six) (Е)
7 (seven) (D)
1
from 77 to 84 points
from 85 to 92 points
from 93 to 100 points
19. Conditions for attending the final exam
8 (eight) (С)
9 (nine) (В)
10 (ten) (А)
Successful completion of activities 15.1 and 15.2
20. Language
Macedonian or English
21. Quality assessment
Internal evaluation and student pools
Literature
Compulsory
22.1.
22.
No.
Author
Title
Publisher
Year
1.
Anand Rajaraman,
Jeffrey David Ullman
Mining of Massive Datasets
Cambridge
University Press
2011
Michael Minelli, Michele
2.
Chambers, Ambiga
Dhiraj
3.
22.2.
Thomas C. Redman
Additional
No. Author
1.
2.
3.
Big Data, Big Analytics:
Emerging Business
Intelligence and Analytic
Wiley CIO
Trends for Today's
Businesses
Data Driven: Profiting from
Harvard Business
Your Most Important
Press
Business Asset
Title
Publisher
2013
2008
Year
2