| http://dbpedia.org/ontology/abstract
|
An incremental decision tree algorithm is … An incremental decision tree algorithm is an online machine learning algorithm that outputs a decision tree. Many decision tree methods, such as C4.5, construct a tree using a complete dataset. Incremental decision tree methods allow an existing tree to be updated using only new individual data instances, without having to re-process past instances. This may be useful in situations where the entire dataset is not available when the tree is updated (i.e. the data was not stored), the original data set is too large to process or the characteristics of the data change over time.racteristics of the data change over time.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www-lrn.cs.umass.edu/iti/index.html +
, http://www.cs.washington.edu/dm/vfml/ +
, https://github.com/greenfish77/gaenari +
|
| http://dbpedia.org/ontology/wikiPageID
|
22540036
|
| http://dbpedia.org/ontology/wikiPageLength
|
11714
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1076063377
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Category:Decision_trees +
, http://dbpedia.org/resource/Online_machine_learning +
, http://dbpedia.org/resource/Machine_learning +
, http://dbpedia.org/resource/Predictive_analytics +
, http://dbpedia.org/resource/ID3_algorithm +
, http://dbpedia.org/resource/Machine_Learning +
, http://dbpedia.org/resource/Incremental_learning +
, http://dbpedia.org/resource/Data_streams +
, http://dbpedia.org/resource/Concept_drift +
, http://dbpedia.org/resource/Disjunctive_normal_form +
, http://dbpedia.org/resource/Online_algorithm +
, http://dbpedia.org/resource/Multiclass_classification +
, http://dbpedia.org/resource/Decision_tree_learning +
, http://dbpedia.org/resource/C4.5 +
, http://dbpedia.org/resource/Ross_Quinlan +
, http://dbpedia.org/resource/C4.5_algorithm +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Decision_trees +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Machine +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Incremental_decision_tree?oldid=1076063377&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Incremental_decision_tree +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.05z_rp7 +
, http://yago-knowledge.org/resource/Incremental_decision_tree +
, http://dbpedia.org/resource/Incremental_decision_tree +
, https://global.dbpedia.org/id/fCAe +
, http://www.wikidata.org/entity/Q17083028 +
|
| rdf:type |
http://dbpedia.org/class/yago/LivingThing100004258 +
, http://dbpedia.org/class/yago/Plant100017222 +
, http://dbpedia.org/class/yago/Organism100004475 +
, http://dbpedia.org/class/yago/Object100002684 +
, http://dbpedia.org/class/yago/WikicatDecisionTrees +
, http://dbpedia.org/ontology/Software +
, http://dbpedia.org/class/yago/VascularPlant113083586 +
, http://dbpedia.org/class/yago/WoodyPlant113103136 +
, http://dbpedia.org/class/yago/PhysicalEntity100001930 +
, http://dbpedia.org/class/yago/Tree113104059 +
, http://dbpedia.org/class/yago/Whole100003553 +
|
| rdfs:comment |
An incremental decision tree algorithm is … An incremental decision tree algorithm is an online machine learning algorithm that outputs a decision tree. Many decision tree methods, such as C4.5, construct a tree using a complete dataset. Incremental decision tree methods allow an existing tree to be updated using only new individual data instances, without having to re-process past instances. This may be useful in situations where the entire dataset is not available when the tree is updated (i.e. the data was not stored), the original data set is too large to process or the characteristics of the data change over time.racteristics of the data change over time.
|
| rdfs:label |
Incremental decision tree
|
