About: Alternating decision tree

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Alternating decision tree Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

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 is classified by an ADTree by following all paths for which all decision nodes are true, and summing any prediction nodes that are traversed.

Attributes	Values
rdf:type	software
rdfs:label	Alternating decision tree (en)
rdfs:comment	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 is classified by an ADTree by following all paths for which all decision nodes are true, and summing any prediction nodes that are traversed. (en)
sameAs	Alternating decision tree Alternating decision tree Alternating decision tree
dbp:wikiPageUsesTemplate	dbt:Math dbt:Mvar dbt:N/A dbt:Reflist dbt:Val
Subject	Classification algorithms Decision trees
Link from a Wikipage to an external page	http://jboost.sourceforge.net/presentations/BoostingLightIntro.pdf http://jboost.sourceforge.net/
thumbnail	wiki-commons:Special:FilePath/Spambase_adtree_example.png?width=300
foaf:depiction
gold:hypernym	Machine
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Alternating_decision_tree?oldid=984669005&ns=0
Wikipage page ID	11288998 (xsd:integer)
page length (characters) of wiki page	8931 (xsd:nonNegativeInteger)
Wikipage revision ID	984669005 (xsd:integer)
Link from a Wikipage to another Wikipage	Logical conjunction Machine learning Weka (machine learning) Boosting (machine learning) C4.5 algorithm Classification algorithms Decision trees Frequency distribution Decision stump Decision tree learning Correlation Yoav Freund
has abstract	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 is classified by an ADTree by following all paths for which all decision nodes are true, and summing any prediction nodes that are traversed. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Alternating_decision_tree
is Wikipage redirect of	ADTree
is Link from a Wikipage to another Wikipage of	ADT Boosting (machine learning) BrownBoost Decision tree learning List of data structures ADTree
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Alternating_decision_tree

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 1005 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software