Erinevus lehekülje "Machine learning" redaktsioonide vahel

Allikas: Kursused
Mine navigeerimisribale Mine otsikasti
24. rida: 24. rida:
 
[http://ciml.info/dl/v0_8/ciml-v0_8-ch01.pdf Reading] - contains also the full algorithm for decision tree learning with divide-and-conquer strategy.
 
[http://ciml.info/dl/v0_8/ciml-v0_8-ch01.pdf Reading] - contains also the full algorithm for decision tree learning with divide-and-conquer strategy.
  
First homework is open in moodle. For submitting you have to register [https://moodle.e-ope.ee/course/view.php?id=6504|target='_new' to the course]
+
[[Media:Hw1.pdf|First homework]] is open in moodle. For submitting you have to register [https://moodle.e-ope.ee/course/view.php?id=6504|target='_new' to the course]
  
 
== Lecture 2: K nearest neighbours, K-means ==
 
== Lecture 2: K nearest neighbours, K-means ==
 
[http://ciml.info/dl/v0_8/ciml-v0_8-ch02.pdf Reading]
 
[http://ciml.info/dl/v0_8/ciml-v0_8-ch02.pdf Reading]

Redaktsioon: 14. veebruar 2014, kell 17:02

Spring 2013/2014

ITI8565: Machine learning

Taught by: Kairit Sirts

EAP: 6.0

Time and place: Fridays

 Lectures: 16:00-17:30  X-406
 Labs: 17:45-19:15  X-412

Additional information: sirts@ioc.ee, juhan.ernits@ttu.ee

The course is organised by the Department of Comptuer Science. The course is supported by IT Academy.


Lecture 1: Introduction, decision trees

Slides

Example made in class - When to play tennis?

Reading - contains also the full algorithm for decision tree learning with divide-and-conquer strategy.

First homework is open in moodle. For submitting you have to register to the course

Lecture 2: K nearest neighbours, K-means

Reading