Results 21 to 30 of about 10,146,366 (200)
Fast Submodular Function Maximization [PDF]
, 2023 Submodular functions have many real-world applications, such as document summarization, sensor placement, and image segmentation. For all these applications, the key building block is how to compute the maximum value of a submodular function efficiently.
Song, Zhao, Wang, Yitan, Qin, Lianke
core +1 more source
IEEE Access, 2018 Submodular optimization plays a significant role in combinatorial problems, since it captures the structure of the edge cuts in graphs, the coverage of sets, and so on. Many data mining and machine learning problems can be cast as submodular maximization
Qilian Yu, Li Xu, Shuguang Cui
doaj +1 more source
Submodular stochastic probing on matroids [PDF]
, 2014 In a stochastic probing problem we are given a universe E, where each element e in E is active independently with probability p in [0,1], and only a probe of e can tell us whether it is active or not. On this universe we execute a process that one by one
Sviridenko, Maxim +5 more
core +1 more source
Submodular Dominance and Applications [PDF]
, 2022 In submodular optimization we often deal with the expected value of a submodular function $f$ on a distribution $\mathcal{D}$ over sets of elements. In this work we study such submodular expectations for negatively dependent distributions. We introduce a
Singla, Sahil, Qiu, Frederick
core +2 more sources
IET Renewable Power Generation, 2023 This paper aims to present an optimization method for the best bus selection (BBS) in the large‐scale power systems in order to send the input signals to the damping controllers.
Mohsen Darabian +2 more
doaj +1 more source
Constrained robust submodular sensor selection with application to multistatic sonar arrays
IET Radar, Sonar & Navigation, 2017 The authors develop a framework to select a subset of sensors from a field in which the sensors have an ingrained independence structure. Given an arbitrary independence pattern, the authors construct a graph that denotes pairwise independence between ...
Thomas Powers +3 more
doaj +1 more source
An analysis of approximations for maximizing submodular set functions—I
Mathematical Programming, 1978 LetN be a finite set andz be a real-valued function defined on the set of subsets ofN that satisfies z(S)+z(T)źz(SźT)+z(SźT) for allS, T inN. Such a function is called submodular. We consider the problem maxSźN{a(S):|S|≤K,z(S) submodular}. Several hard combinatorial optimization problems can be posed in this framework.
Fisher, M.L. +2 more
openaire +2 more sources
SFExt-PGAbs: Two-Stage Summarization Model for Long Document
Jisuanji kexue yu tansuo, 2021 Aiming at the fluency problem of extractive method, the accuracy problem of abstractive method, and the important information missing problem caused by truncating the original document before document encoding, this paper proposes a two-stage long ...
ZHOU Weixiao, LAN Wenfei, XU Zhiming, ZHU Rongbo
doaj +1 more source
New performance guarantees for the greedy maximization of submodular set functions [PDF]
Optimization Letters, 2016 We present new tight performance guarantees for the greedy maximization of nondecreasing submodular set functions. Our main result first provides a performance guarantee in terms of the overlap of the optimal and greedy solutions. As a consequence we improve performance guarantees of Nemhauser, Wolsey and Fisher (1978) and Conforti and Cornuéjols (1984)
Jussi Laitila, Atte Moilanen
openaire +4 more sources
On Constructing Finite, Finitely Subadditive Outer Measures, and Submodularity
International Journal of Mathematics and Mathematical Sciences, 2008 Given a nonempty abstract set 𝑋, and a covering class 𝒞, and a finite, finitely subadditive outer measure 𝜈, we construct an outer measure 𝜈 and investigate conditions for 𝜈 to be submodular. We then consider several other set functions associated with 𝜈
Charles Traina
doaj +1 more source