| http://dbpedia.org/ontology/abstract
|
Algorithm selection (sometimes also called … Algorithm selection (sometimes also called per-instance algorithm selection or offline algorithm selection) is a meta-algorithmic technique to choose an algorithm from a portfolio on an instance-by-instance basis. It is motivated by the observation that on many practical problems, different algorithms have different performance characteristics. That is, while one algorithm performs well in some scenarios, it performs poorly in others and vice versa for another algorithm. If we can identify when to use which algorithm, we can optimize for each scenario and improve overall performance. This is what algorithm selection aims to do. The only prerequisite for applying algorithm selection techniques is that there exists (or that there can be constructed) a set of complementary algorithms.ructed) a set of complementary algorithms.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Portfolio_correlation_as.png?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.coseal.net/aslib/ +
, https://larskotthoff.github.io/assurvey/ +
|
| http://dbpedia.org/ontology/wikiPageID
|
50773876
|
| http://dbpedia.org/ontology/wikiPageLength
|
14858
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1119690831
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Answer_set_programming +
, http://dbpedia.org/resource/Travelling_salesman_problem +
, http://dbpedia.org/resource/Hierarchical_clustering +
, http://dbpedia.org/resource/Meta-learning_%28computer_science%29 +
, http://dbpedia.org/resource/Constraint_satisfaction_problem +
, http://dbpedia.org/resource/Hyper-heuristic +
, http://dbpedia.org/resource/Multi-agent_system +
, http://dbpedia.org/resource/Algorithmic_technique +
, http://dbpedia.org/resource/File:Shapley_Values_on_SAT12-INDU_ASlib_Scenario.png +
, http://dbpedia.org/resource/MAXSAT +
, http://dbpedia.org/resource/File:Portfolio_correlation_as.png +
, http://dbpedia.org/resource/Category:Constraint_programming +
, http://dbpedia.org/resource/Multi-class_classification +
, http://dbpedia.org/resource/Conjunctive_normal_form +
, http://dbpedia.org/resource/Linear_programming +
, http://dbpedia.org/resource/Vehicle_routing_problem +
, http://dbpedia.org/resource/Answer_Set_Programming +
, http://dbpedia.org/resource/Category:Machine_learning +
, http://dbpedia.org/resource/SAT_solver +
, http://dbpedia.org/resource/QBF +
, http://dbpedia.org/resource/Automated_planning_and_scheduling +
, http://dbpedia.org/resource/Evolutionary_algorithm +
, http://dbpedia.org/resource/Boolean_satisfiability_problem +
, http://dbpedia.org/resource/Machine_learning +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Use_dmy_dates +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Machine_learning +
, http://dbpedia.org/resource/Category:Constraint_programming +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Algorithm_selection?oldid=1119690831&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Portfolio_correlation_as.png +
, http://commons.wikimedia.org/wiki/Special:FilePath/Shapley_Values_on_SAT12-INDU_ASlib_Scenario.png +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Algorithm_selection +
|
| owl:sameAs |
http://dbpedia.org/resource/Algorithm_selection +
, http://www.wikidata.org/entity/Q28324862 +
, https://global.dbpedia.org/id/2dgKE +
|
| rdfs:comment |
Algorithm selection (sometimes also called … Algorithm selection (sometimes also called per-instance algorithm selection or offline algorithm selection) is a meta-algorithmic technique to choose an algorithm from a portfolio on an instance-by-instance basis. It is motivated by the observation that on many practical problems, different algorithms have different performance characteristics. That is, while one algorithm performs well in some scenarios, it performs poorly in others and vice versa for another algorithm. If we can identify when to use which algorithm, we can optimize for each scenario and improve overall performance. This is what algorithm selection aims to do. The only prerequisite for applying algorithm selection techniques is that there exists (or that there can be constructed) a set of complementary algorithms.ructed) a set of complementary algorithms.
|
| rdfs:label |
Algorithm selection
|
