| http://dbpedia.org/ontology/abstract
|
Quadratic unconstrained binary optimizatio … Quadratic unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem with a wide range of applications from finance and economics to machine learning. QUBO is an NP hard problem, and for many classical problems from theoretical computer science, like maximum cut, graph coloring and the partition problem, embeddings into QUBO have been formulated.Embeddings for machine learning models include support-vector machines, clustering and probabilistic graphical models.Moreover, due to its close connection to Ising models, QUBO constitutes a central problem class for adiabatic quantum computation, where it is solved through a physical process called quantum annealing.physical process called quantum annealing.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://portal.acm.org/citation.cfm%3Fid=1231283 +
|
| http://dbpedia.org/ontology/wikiPageID
|
20352269
|
| http://dbpedia.org/ontology/wikiPageLength
|
7466
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1119961812
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Partition_problem +
, http://dbpedia.org/resource/Graph_coloring +
, http://dbpedia.org/resource/Binary_data +
, http://dbpedia.org/resource/Probabilistic_graphical_model +
, http://dbpedia.org/resource/Category:Machine_learning_algorithms +
, http://dbpedia.org/resource/Cluster_analysis +
, http://dbpedia.org/resource/Optimization_problem +
, http://dbpedia.org/resource/Ising_model +
, http://dbpedia.org/resource/Finance +
, http://dbpedia.org/resource/Support-vector_machine +
, http://dbpedia.org/resource/Quantum_annealing +
, http://dbpedia.org/resource/NP_hard +
, http://dbpedia.org/resource/Maximum_cut +
, http://dbpedia.org/resource/Hamiltonian_function +
, http://dbpedia.org/resource/Theoretical_computer_science +
, http://dbpedia.org/resource/Adiabatic_quantum_computing +
, http://dbpedia.org/resource/Quadratic_polynomial +
, http://dbpedia.org/resource/Machine_learning +
, http://dbpedia.org/resource/Economics +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Compu-AI-stub +
, http://dbpedia.org/resource/Template:Cite_journal +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Machine_learning_algorithms +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Quadratic_unconstrained_binary_optimization?oldid=1119961812&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Quadratic_unconstrained_binary_optimization +
|
| owl:sameAs |
https://global.dbpedia.org/id/4tX9N +
, http://rdf.freebase.com/ns/m.04zyxsn +
, http://dbpedia.org/resource/Quadratic_unconstrained_binary_optimization +
, http://www.wikidata.org/entity/Q7268372 +
|
| rdfs:comment |
Quadratic unconstrained binary optimizatio … Quadratic unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem with a wide range of applications from finance and economics to machine learning. QUBO is an NP hard problem, and for many classical problems from theoretical computer science, like maximum cut, graph coloring and the partition problem, embeddings into QUBO have been formulated.Embeddings for machine learning models include support-vector machines, clustering and probabilistic graphical models.Moreover, due to its close connection to Ising models, QUBO constitutes a central problem class for adiabatic quantum computation, where it is solved through a physical process called quantum annealing.physical process called quantum annealing.
|
| rdfs:label |
Quadratic unconstrained binary optimization
|
