BÄ°L671 - PROBABILISTIC LEARNING

Course Name Code Semester Theory
(hours/week)
Application
(hours/week)
Credit ECTS
PROBABILISTIC LEARNING BÄ°L671 Any Semester/Year 3 0 3 8
Prequisitesnone
Course languageTurkish
Course typeElective 
Mode of DeliveryFace-to-Face 
Learning and teaching strategiesLecture
Preparing and/or Presenting Reports
Problem Solving
Project Design/Management
 
Instructor (s)Asst. Prof. Dr . Burcu Can BuÄŸlalılar 
Course objectiveTo make the student have an understanding on the statistical machine learning methods. 
Learning outcomes
  1. At the end of this course, the student will have a knowledge about the probabilistic learning methods that include supervised and unsupervised learning methods and he/she will be able to apply these techniques on data for various problems.
Course Content? Probability Concepts
? Generative Models for Discrete Data
? Bayesian Statistics
? Frequentist Statistics
? Mixture Models
? Linear Regression
? Hidden Markov Models
? Sampling
? Graphic Models
 
References? Kevin Murphy Machine Learning: a probabilistic perspective
? Michael Lavine, Introduction to Statistical Thought
? Chris Bishop, Pattern Recognition and Machine Learning
? Daphne Koller & Nir Friedman, Probabilistic Graphical Models
? Hastie, Tibshirani, Friedman, Elements of Statistical Learning
? David J.C. MacKay Information Theory, Inference, and Learning Algorithms
 

Course outline weekly

WeeksTopics
Week 1Introduction to Machine Learning
Week 2Concepts about Probability and Statistics
Week 3Generative Models for Discrete Data
Week 4Gaussian Models
Week 5Bayesian Statistics
Week 6Frequentist Statistics
Week 7Linear Regression
Week 8Mixture Models
Week 9Hidden Markov Models
Week 10Kernels
Week 11Sampling methods
Week 12Graphical Models
Week 13Non-parametric Bayesian Modelling
Week 14Student presentations
Week 15Final exam preparation
Week 16Final exam

Assesment methods

Course activitiesNumberPercentage
Attendance00
Laboratory00
Application00
Field activities00
Specific practical training00
Assignments00
Presentation00
Project150
Seminar00
Midterms00
Final exam150
Total100
Percentage of semester activities contributing grade succes050
Percentage of final exam contributing grade succes050
Total100

WORKLOAD AND ECTS CALCULATION

Activities Number Duration (hour) Total Work Load
Course Duration (x14) 14 3 42
Laboratory 0 0 0
Application000
Specific practical training000
Field activities000
Study Hours Out of Class (Preliminary work, reinforcement, ect)14570
Presentation / Seminar Preparation000
Project17070
Homework assignment000
Midterms (Study duration)000
Final Exam (Study duration) 17070
Total Workload30148252

Matrix Of The Course Learning Outcomes Versus Program Outcomes

D.9. Key Learning OutcomesContrubition level*
12345
1. Graduates should have a mastery of computer science as described by the core of the Body of Knowledge.  X  
2. Graduates need understanding of a number of recurring themes, such as abstraction, complexity, and evolutionary change, and a set of general principles, such as sharing a common resource, security, and concurrency.  X   
3. Graduates of a computer science program need to understand how theory and practice influence each other.   X 
4. Graduates need to think at multiple levels of detail and abstraction. X    
5. Students will be able to think critically, creatively and identify problems in their research.    X
6. Graduates should have been involved in at least one substantial project.     X
7. Graduates should realize that the computing field advances at a rapid pace. X    
8. Graduates should conduct research in an ethical and responsible manner.  X   
9. Graduates should have good command of technical terms in both Turkish and English.  X  
10. Graduates should understand the full range of opportunities available in computing.    X
11. Graduates should understand that computing interacts with many different domains.     X
12. Graduates should develop the knowledge acquired at master level and apply scientific methods in order to solve scientific problems.      

*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest