Results 111 to 120 of about 2,699,353 (198)
Hypergraphic submodular function minimization
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Maximizing Submodular Functions for Recommendation in the Presence of Biases
Subset selection tasks, arise in recommendation systems and search engines and ask to select a subset of items that maximize the value for the user. The values of subsets often display diminishing returns, and hence, submodular functions have been used ...
Mehrotra, Anay, Vishnoi, Nisheeth K.
core
Regularized impurity reduction: accurate decision trees with complexity guarantees. [PDF]
Zhang G, Gionis A.
europepmc +1 more source
Submodular Order Functions and Assortment Optimization [PDF]
We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to this permutation as a submodular order.
Udwani, Rajan
core
A Polynomial Algorithm for Minimizing $k$-Distant Submodular Functions [PDF]
This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at least $k$.
Mizutani, Ryuhei
core +1 more source
Deep Submodular Functions: Definitions & Learning
We propose and study a new class of submodular functions called deep submodular functions (DSFs). We define DSFs and situate them within the broader context of classes of submodular functions in relationship both to various matroid ranks and sums of ...
Jeff Bilmes, Brian Dolhansky
core
Semi-streaming algorithms for submodular matroid intersection. [PDF]
Garg P, Jordan L, Svensson O.
europepmc +1 more source
This paper considers the problem of learning submodular functions. A problem instance consists of a distribution on {0,1}[superscript n] and a real-valued function on {0,1}[superscript n] that is non-negative, monotone and submodular. We are given poly(
Harvey, Nicholas J. A. +1 more
core
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]
Sason I.
europepmc +1 more source

