Messages
The exam this year will contain 70% multiple choice problems (selecting correct statements) and 30% problems to be answered by regular text. See lecture slides from the last lecture for the format of the multiple choice. Best wishes for your exam, Eivind and Jim
Tuesday 19 November is the last lecture in the course. It will contain a brief overview of the course with focus on practical information. However, we would be open to answer questions and repeat topics in the syllabus based on requests. If you have something you would like us to cover, it would be helpful if you let us know in advance by sending us an e-mail.
Please note that no materials (including books or handouts) are permitted to be used during the exam.
Due to the dagen@ifi arrangement we will unfortunately not hold any group session this Thursday. If you have any questions concerning either this weeks exercises or the mandatory exercise you can direct them to either me (eivinsam@ifi.uio.no) or Stian (stianlp@ifi.uio.no) by mail. - E
It has been pointed out to us that it can be quite a lot of work to run all the 39 different combinations of data and classification algorithms required by the mandatory exercise. To get the experiments done a little faster you can modify the RapidMiner process to run all three methods at the same time, like shown in this screenshot.
This way you can at least gather the results three at a time, which should make things go a bit faster.
-E
It appears that the exercise text was a little unclear about what tutorials you should try before getting to work with the classifiers, as there are some video tutorials as well, that only go to number 6. I was not intended that you should do the video tutorials, but the tutorials accessed by pressing Help -> RapidMiner Tutorials. There should be 25 steps in total, and you should try to do the first 9.
There was also a small typo later in the text. There are 13 different runs to do for each algorithm, not 14.
These things have been clarified in the exercise text on the webpage now.
-E
You can find the assignment text here.
You are to hand it in to http://devilry.ifi.uio.no. The deadline is by the end of November 3rd. -E
The first page of the mandatory exercise refers to a computer-readable version of the distance table in the pickles file format. This is not availible, since I have no experience with the format, but the sentence snuck into the text. I apologise for any confusion this may have caused. The table is still availible in a nice tab-separated plaintext file, which should be easily parseable by your favorite programming language (think input.readLine().split("\t")). -E
As the lecture plan indicates there will be no lecture next week, and thus no new weekly exercises for the week after. However, the group sessions continue as usual, with Stian in charge of both groups for the next two weeks. Feel free to ask him about the mandatory exercise if you are stuck, or use the time to catch up on the weekly exercises.
-E
You can find the assignment text here.
You are to hand it in to http://devilry.ifi.uio.no. The deadline is by the end of September 27th. -E
I have now uploaded the exercises for the first lecture. I plan on having the exercises for each week up on the web page not too long after that weeks lecture, so that you have some time to look at them before the following week's group session. Solutions to the exercises will be posted after the group sessions. -E