Classification Tree Learning Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
Line 4: | Line 4: | ||
** It is a [[Symbolic Learning Algorithm]]. | ** It is a [[Symbolic Learning Algorithm]]. | ||
** It is a [[Discriminative Learning Algorithm]]. | ** It is a [[Discriminative Learning Algorithm]]. | ||
* <B><U>Example(s)</U>:</B> | |||
** [[C4.5 Algorithm]]. | |||
** [[ID3 Algorithm]]. | |||
** [[FOIL Algorithm]]. | |||
** [[CART Algorithm]]. | |||
* <B>Counter-Example(s):</B> | * <B>Counter-Example(s):</B> | ||
** a [[Ranking Tree Learning Algorithm]]. | |||
** a [[Regression Tree Learning Algorithm]]. | ** a [[Regression Tree Learning Algorithm]]. | ||
* <B>See:</B> [[Kernel-based Classification Algorithm]]. | * <B>See:</B> [[Kernel-based Classification Algorithm]]. | ||
---- | ---- | ||
---- | ---- |
Revision as of 01:47, 16 July 2013
A Classification Tree Learning Algorithm is a Decision Tree Learning Algorithm that can produce a Classification Tree.
- Context:
- It can be implemented in an Classification Tree Learning System.
- It is a Symbolic Learning Algorithm.
- It is a Discriminative Learning Algorithm.
- Example(s):
- Counter-Example(s):
- See: Kernel-based Classification Algorithm.