Till KTH:s startsida Till KTH:s startsida

Lecture 3, Decision Trees [Atsuto]

Tid: Måndag 9 september 2013 kl 17:00 - 19:00 2013-09-09T17:00:00 2013-09-09T19:00:00

Kungliga Tekniska högskolan
HT 2013

Plats: D1

Aktivitet: Föreläsning

Studentgrupper: TCSCM1-AS, TCSCM1-BER, TCSCM1-PRS, TCSCM1-SPR, TITMM2, TIVNM1, TKOMK3, TMAIM1, TMAIM1-BIO, TMAIM1-IR, TMAIM1-PC, TSCRM1, TSCRM2

Info:

Decision Trees

Readings: Marsland, Chapter 6

  • What is a Decision Tree?
  • When are decision trees useful?
  • How can one select what questions to ask?
  • What do we mean by Entropy for a data set?
  • What do we mean by the Information Gain of a question?
  • What Bias do we get if we maximize the Information Gain?
  • What does William from Ockham (1285-1349) have to do with this?
  • Is it possible to learn too much?
  • How can one prevent the algorithms from learning irrelevant details?

Slides on Decision Trees
Schemahandläggare skapade händelsen 13 mars 2013
Schemahandläggare redigerade 15 augusti 2013

[u'TIVNM1', u'TKOMK3', u'TMAIM1-PC', u'TCSCM1-BER', u'TMAIM1', u'TCSCM1-AS', u'TCSCM1-SPR', u'TMAIM1-IR', u'TMAIM1-BIO', u'TSCRM1', u'TITMM2', u'TSCRM2', u'TCSCM1-PRS']

Lärare Örjan Ekeberg redigerade 16 augusti 2013

FöreläsningLecture 3, Decision Trees [Atsuto]

Decision Trees Readings: Marsland, Chapter 6¶


* What is a Decision Tree?
* When are decision trees useful?
* How can one select what questions to ask?
* What do we mean by Entropy for a data set?
* What do we mean by the Information Gain of a question?
* What Bias do we get if we maximize the Information Gain?
* What does William from Ockham (1285-1349) have to do with this?
* Is it possible to learn too much?
* How can one prevent the algorithms from learning irrelevant details?

Schemahandläggare redigerade 31 augusti 2013

[u'TIVNM1', u'TKOMK3', u'TMAIM1-PC', u'TCSCM1-BER', u'TMAIM1', u'TCSCM1-AS', u'TCSCM1-SPR', u'TMAIM1-IR', u'TCSCM1-AS, TCSCM1-BER, TCSCM1-PRS, TCSCM1-SPR, TITMM2, TIVNM1, TKOMK3, TMAIM1, TMAIM1-BIO', u'TSCRM1', u'TITMM2', u'TSCRM2', u'TCSCM1-PRS']TMAIM1-IR, TMAIM1-PC, TSCRM1, TSCRM2

Administratör Atsuto Maki redigerade 7 september 2013

Decision Trees Readings: Marsland, Chapter 6


* What is a Decision Tree?
* When are decision trees useful?
* How can one select what questions to ask?
* What do we mean by Entropy for a data set?
* What do we mean by the Information Gain of a question?
* What Bias do we get if we maximize the Information Gain?
* What does William from Ockham (1285-1349) have to do with this?
* Is it possible to learn too much?
* How can one prevent the algorithms from learning irrelevant details?
Slides on Decision Trees

Administratör Atsuto Maki redigerade 9 september 2013

Decision Trees Readings: Marsland, Chapter 6


* What is a Decision Tree?
* When are decision trees useful?
* How can one select what questions to ask?
* What do we mean by Entropy for a data set?
* What do we mean by the Information Gain of a question?
* What Bias do we get if we maximize the Information Gain?
* What does William from Ockham (1285-1349) have to do with this?
* Is it possible to learn too much?
* How can one prevent the algorithms from learning irrelevant details?
Slides on Decision Trees

Schemahandläggare redigerade 14 september 2013

TCSCM1-AS, [u'TIVNM1', u'TKOMK3', u'TMAIM1-PC', u'TCSCM1-BER', TCSCM1-PRS, u'TMAIM1', u'TCSCM1-AS', u'TCSCM1-SPR', TITMM2, TIVNM1, TKOMK3, TMAIM1, u'TMAIM1-IR', u'TMAIM1-BIO', TMAIM1-IR, TMAIM1-PC, TSCRM1, TSCRM2u'TSCRM1', u'TITMM2', u'TSCRM2', u'TCSCM1-PRS']

Schemahandläggare ställde in händelsen 14 december 2013

Hela världen får läsa.

Senast ändrad 2013-12-14 00:59

Taggar: Saknas än så länge.