| Display title | Alternating decision tree |
| Default sort key | Alternating Decision Tree |
| Page length (in bytes) | 9,654 |
| Namespace ID | 0 |
| Page ID | 205368 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>StanislovAI |
| Date of page creation | 23:12, 6 March 2023 |
| Latest editor | imported>StanislovAI |
| Date of latest edit | 23:12, 6 March 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | An alternating decision tree (ADTree) is a machine learning method for classification. It generalizes decision trees and has connections to boosting.
An ADTree consists of an alternation of decision nodes, which specify a predicate condition, and prediction nodes, which contain a single number. An instance... |
