Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Submodular set function
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Function on subsets that has a diminishing returns property
Property
Value
dbo:
description
Mengenfunktion
(de)
function on subsets that has a diminishing returns property
(en)
dbo:
wikiPageExternalLink
http://submodularity.org/
http://www.cs.berkeley.edu/~stefje/references.html
dbo:
wikiPageWikiLink
dbr
:Diminishing_returns
dbr
:Restriction_(mathematics)
dbc
:Combinatorial_optimization
dbr
:Oxford_University_Press
dbr
:Machine_learning
dbr
:Optimization_problem
dbr
:Artificial_intelligence
dbr
:Cambridge_University_Press
dbr
:Set_(mathematics)
dbr
:Closure_(mathematics)
dbr
:Convex_function
dbr
:Computer_vision
dbc
:Matroid_theory
dbr
:Feature_selection
dbc
:Approximation_algorithms
dbr
:Automatic_summarization
dbr
:Maximum_coverage_problem
dbr
:Entropic_vector
dbr
:Matroid_rank
dbr
:Directed_graph
dbr
:Concave_function
dbr
:Economics
dbr
:Game_theory
dbr
:Matroid
dbr
:Mutual_information
dbr
:Random_variable
dbr
:Greedy_algorithm
dbr
:Active_learning_(machine_learning)
dbr
:László_Lovász
dbr
:Electrical_network
dbr
:Power_set
dbr
:Entropy_(information_theory)
dbr
:Local_search_(optimization)
dbr
:Polymatroid
dbr
:Elsevier
dbr
:Minimum_cut
dbr
:Multi-document_summarization
dbr
:Springer_Publishing
dbr
:Linear_combination
dbr
:Graph_(discrete_mathematics)
dbr
:Maximum_cut
dbr
:Set_function
dbr
:Supermodular_function
dbr
:Utility_functions_on_indivisible_goods
dbr
:Approximation_algorithms
dbr
:Subadditive_set_function
dbr
:Budget-additive_valuation
dbr
:NP-hard
dbr
:Polynomial_time
dbr
:Uniform_distribution_(continuous)
dbr
:Random_variables
dbp:
wikiPageUsesTemplate
dbt
:Reflist
dbt
:Anchor
dbt
:Citation
dbt
:Use_American_English
dbt
:Citation_needed
dbt
:Short_description
dct:
subject
dbc
:Combinatorial_optimization
dbc
:Matroid_theory
dbc
:Approximation_algorithms
gold:
hypernym
dbr
:Function
rdfs:
label
Submodular set function
(en)
Submodulare Funktion
(de)
Fonction sous-modulaire
(fr)
劣モジュラ関数
(ja)
owl:
sameAs
freebase
:Submodular set function
yago-res
:Submodular set function
wikidata
:Submodular set function
dbpedia-de
:Submodular set function
dbpedia-fr
:Submodular set function
dbpedia-ja
:Submodular set function
dbpedia-global
:Submodular set function
prov:
wasDerivedFrom
wikipedia-en
:Submodular_set_function?oldid=1296441257&ns=0
foaf:
isPrimaryTopicOf
wikipedia-en
:Submodular_set_function
is
dbo:
wikiPageRedirects
of
dbr
:Submodular
dbr
:Submodular_function
dbr
:Submodular_maximization
dbr
:Submodular_valuation
dbr
:Submodular_valuations
is
dbo:
wikiPageWikiLink
of
dbr
:Sigma-additive_set_function
dbr
:Diminishing_returns
dbr
:Feature_selection
dbr
:Automatic_summarization
dbr
:Alexander_Schrijver
dbr
:Maximum_coverage_problem
dbr
:Matroid_rank
dbr
:Bin_packing_problem
dbr
:Fulkerson_Prize
dbr
:George_Nemhauser
dbr
:Polymatroid
dbr
:Pseudo-Boolean_function
dbr
:Strategic_complements
dbr
:Bregman_divergence
dbr
:Set_function
dbr
:Supermodular_function
dbr
:Utility_functions_on_indivisible_goods
dbr
:Correlation_gap
dbr
:Additive_utility
dbr
:Gross_substitutes_(indivisible_items)
dbr
:Unit_demand
dbr
:Structured_sparsity_regularization
dbr
:Price_of_anarchy_in_auctions
dbr
:Egalitarian_item_allocation
dbr
:Subadditive_set_function
dbr
:Budget-additive_valuation
dbr
:Combinatorics:_The_Rota_Way
dbr
:Deficiency_(graph_theory)
dbr
:Independence_Theory_in_Combinatorics
dbr
:Cost-sharing_mechanism
dbr
:Sequential_auction
dbr
:Fractionally-subadditive_valuation
dbr
:Submodular
dbr
:Submodular_function
dbr
:Submodular_maximization
dbr
:Submodular_valuation
dbr
:Submodular_valuations
dbr
:Efficient_approximately-fair_item_allocation
is
foaf:
primaryTopic
of
wikipedia-en
:Submodular_set_function
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International