Laboratory of Computer and Information Science > Teaching > T-61.5060 > Exercises 2007

The exercises are held Thursdays in lecture hall T2 (the same as for the lectures) at 16-18. The first exercises are on the 13th of September, there won't exercises every week.

The course participants should try and solve the exercises beforehand. The course assistant will go through the solutions in the exercise session and any discussion concerning the course, the exercises and the project work is welcome in the exercise session.

The solutions will be put to the course homepage afterwards, but they will contain only the core solution with only few comments. This means that you don't have to use your time for copying the solutions during the exercise session, but attending the session is highly recommended for understanding the solution. The course is about learning the methods of the field and learning is all about trying those methods out, failing a few times maybe and then finally understanding the idea beneath the surface. This is achieved by trying out all the exercises before giving up.

- 13.9.2007 Some warm-up (PDF), Solutions
- 20.9.2007 Counting stuff (PDF),
Solutions
- Supplementary material: abstracts10000.txt (3.5 M)
and words.txt

- 27.9.2007 Frequent sets (PDF), Solutions (Updated with some fixes)
- 11.10.2007 Episodes etc. (PDF),
Solutions
- Supplementary material: eventsequence.txt

- 18.10.2007 Episodes, borders (PDF),
Solutions
- NOTE! There is a typo in the 4th problem, the correct question goes:

What is the relation between the minimal elements of S and the maximal elements of T? - 8.11.2007 Clustering and metrics (PDF), Solutions
- 15.11.2007 Similarity, aggregation (PDF) (UPDATED with the new 3rd exercise), Solutions
- 22.11.2007 Set covering (PDF), Solutions

You are at: CIS → /Opinnot/T-61.5060/2007/laskarit.shtml

Page maintained by webmaster at cis.hut.fi, last updated Thursday, 22-Nov-2007 15:31:52 EET