Results 1 to 2 of 2

Thread: Prüfung 26.01.2012

  1. #1
    Principal
    Join Date
    Mar 2007
    Posts
    75
    Thanks
    14
    Thanked 4 Times in 2 Posts

    Prüfung 26.01.2012

    questions from memory:

    1) data preprocessing - what is it, why?
    2) bagging - boosting? what is it, which algorithms use it?
    3) what are the concepts "linear separation" & "soft margins"? which classifiers use it?
    4) what is the concept "landmarking"
    5) practical: decision tree & bayes net (design & calculate bayes net, than classify a new instance, what happens if node "debt" is instantiated)

    since as far as i can remember we never actually built a bayes net from scratch (with a dataset and probabilities), the 5th question was really hard for me...

  2. #2
    Logo-Wettbewerb 2012, Platz 2. emptyvi's Avatar
    Join Date
    Mar 2008
    Posts
    606
    Thanks
    209
    Thanked 290 Times in 143 Posts
    As question 5) (with k-NN ensemble instead of decision tree) came on this test (30.04.2012) too, but even after the test, I have no idea how to solve something like this.. could anyone explain it to me?

    In our example, a table with features name{some names}, eye colour{brown, blue, green}, height{short, tall}, handsome{yes, no}, sex{male, female}, Likes_soccer{yes, no} and class date{yes, no} was given. (I dropped feature "name" as I don't think, it would be appropriate as it is a unique identifier for each dataset.)

    regards,
    emptyvi
    "Die über den Iterator zugänglichen assoziierten Objekte entsprechen Iteratoren des Typs AssocIter, welche (so wie hier für den Wurzelknoten beschrieben) über die Label der Kanten iterieren, die von dem Knoten ausgehen, der über die Kante erreichbar ist, dessen Label zuletzt von next zurückgegeben wurde."

Bookmarks

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •