Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5249244> ?p ?o }
Showing triples 1 to 15 of
15
with 100 triples per page.
- Q5249244 subject Q8367393.
- Q5249244 abstract "A decision stump is a machine learning model consisting of a one-level decision tree. That is, it is a decision tree with one internal node (the root) which is immediately connected to the terminal nodes (its leaves). A decision stump makes a prediction based on the value of just a single input feature. Sometimes they are also called 1-rules.Depending on the type of the input feature, several variations are possible. For nominal features, one may build a stump which contains a leaf for each possible feature value or a stump with the two leaves, one of which corresponds to some chosen category, and the other leaf to all the other categories. For binary features these two schemes are identical. A missing value may be treated as a yet another category.For continuous features, usually, some threshold feature value is selected, and the stump contains two leaves — for values below and above the threshold. However, rarely, multiple thresholds may be chosen and the stump therefore contains three or more leaves.Decision stumps are often used as components (called "weak learners" or "base learners") in machine learning ensemble techniques such as bagging and boosting. For example, a state-of-the-art Viola–Jones face detection algorithm employs AdaBoost with decision stumps as weak learners.The term "decision stump" was coined in a 1992 ICML paper by Wayne Iba and Pat Langley.".
- Q5249244 thumbnail Decision_stump.svg?width=300.
- Q5249244 wikiPageWikiLink Q16766476.
- Q5249244 wikiPageWikiLink Q17087718.
- Q5249244 wikiPageWikiLink Q245652.
- Q5249244 wikiPageWikiLink Q2493877.
- Q5249244 wikiPageWikiLink Q2539.
- Q5249244 wikiPageWikiLink Q2823869.
- Q5249244 wikiPageWikiLink Q466303.
- Q5249244 wikiPageWikiLink Q799897.
- Q5249244 wikiPageWikiLink Q8367393.
- Q5249244 comment "A decision stump is a machine learning model consisting of a one-level decision tree. That is, it is a decision tree with one internal node (the root) which is immediately connected to the terminal nodes (its leaves). A decision stump makes a prediction based on the value of just a single input feature. Sometimes they are also called 1-rules.Depending on the type of the input feature, several variations are possible.".
- Q5249244 label "Decision stump".
- Q5249244 depiction Decision_stump.svg.