Browse Wiki & Semantic Web

Jump to: navigation, search
Http://dbpedia.org/resource/Proactive learning
  This page has no properties.
hide properties that link here 
  No properties link to this page.
 
http://dbpedia.org/resource/Proactive_learning
http://dbpedia.org/ontology/abstract Proactive learning is a generalization of Proactive learning is a generalization of active learning designed to relax unrealistic assumptions and thereby reach practical applications. "Active learning seeks to select the most informative unlabeled instances and ask an omniscient oracle for their labels, so as to retrain a learning algorithm maximizing accuracy. However, the oracle is assumed to be infallible (never wrong), indefatigable (always answers), individual (only one oracle), and insensitive to costs (always free or always charges the same)." "In real life, it is possible and more general to have multiple sources of information with differing reliabilities or areas of expertise. Active learning also assumes that the single oracle is perfect, always providing a correct answer when requested. In reality, though, an "oracle" (if we generalize the term to mean any source of expert information) may be incorrect (fallible) with a probability that should be a function of the difficulty of the question. Moreover, an oracle may be reluctant – it may refuse to answer if it is too uncertain or too busy. Finally, active learning presumes the oracle is either free or charges uniform cost in label elicitation.Such an assumption is naive since cost is likely to be regulated by difficulty (amount of work required to formulate an answer) or other factors." Proactive learning relaxes all four of these assumptions, relying on a decision-theoretic approach to jointly select the optimal oracle and instance, by casting the problem as a utility optimization problem subject to a budget constraint.on problem subject to a budget constraint.
http://dbpedia.org/ontology/wikiPageID 21985449
http://dbpedia.org/ontology/wikiPageLength 2177
http://dbpedia.org/ontology/wikiPageRevisionID 913090816
http://dbpedia.org/ontology/wikiPageWikiLink http://dbpedia.org/resource/Budget_constraint + , http://dbpedia.org/resource/Category:Machine_learning + , http://dbpedia.org/resource/Category:Learning + , http://dbpedia.org/resource/Machine_learning + , http://dbpedia.org/resource/Oracle_%28computer_science%29 + , http://dbpedia.org/resource/Optimization_problem + , http://dbpedia.org/resource/Active_learning +
http://dbpedia.org/property/wikiPageUsesTemplate http://dbpedia.org/resource/Template:Reflist +
http://purl.org/dc/terms/subject http://dbpedia.org/resource/Category:Learning + , http://dbpedia.org/resource/Category:Machine_learning +
http://purl.org/linguistics/gold/hypernym http://dbpedia.org/resource/Generalization +
http://www.w3.org/ns/prov#wasDerivedFrom http://en.wikipedia.org/wiki/Proactive_learning?oldid=913090816&ns=0 +
http://xmlns.com/foaf/0.1/isPrimaryTopicOf http://en.wikipedia.org/wiki/Proactive_learning +
owl:sameAs https://global.dbpedia.org/id/4tahn + , http://rdf.freebase.com/ns/m.05p6bnn + , http://www.wikidata.org/entity/Q7246814 + , http://dbpedia.org/resource/Proactive_learning +
rdfs:comment Proactive learning is a generalization of Proactive learning is a generalization of active learning designed to relax unrealistic assumptions and thereby reach practical applications. "Active learning seeks to select the most informative unlabeled instances and ask an omniscient oracle for their labels, so as to retrain a learning algorithm maximizing accuracy. However, the oracle is assumed to be infallible (never wrong), indefatigable (always answers), individual (only one oracle), and insensitive to costs (always free or always charges the same)."(always free or always charges the same)."
rdfs:label Proactive learning
hide properties that link here 
http://en.wikipedia.org/wiki/Proactive_learning + http://xmlns.com/foaf/0.1/primaryTopic
http://dbpedia.org/resource/Proactive_learning + owl:sameAs
 

 

Enter the name of the page to start semantic browsing from.