Results 31 to 40 of about 291 (165)

Regularized Submodular Maximization With a k-Matroid Intersection Constraint

open access: yesIEEE Access, 2023
With the development of the Internet and the emergence of various social-media platforms, designing approximation algorithms for optimization problems such as the influence maximization in social networks has received widespread attention.
Qingqin Nong, Zhijia Guo, Suning Gong
doaj   +1 more source

Determinant-Based Fast Greedy Sensor Selection Algorithm

open access: yesIEEE Access, 2021
In this paper, the sparse sensor placement problem for least-squares estimation is considered, and the previous novel approach of the sparse sensor selection algorithm is extended. The maximization of the determinant of the matrix which appears in pseudo-
Yuji Saito   +7 more
doaj   +1 more source

Submodular Cost Submodular Cover with an Approximate Oracle

open access: yesCoRR, 2019
International Conference on Machine Learning ...
Victoria G. Crawford   +2 more
openaire   +3 more sources

Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization

open access: yesIEEE Access, 2021
The problem of selecting an optimal set of sensors estimating a high-dimensional data is considered. Objective functions based on D-, A-, and E-optimality criteria of optimal design are adopted to greedy methods, that maximize the determinant, minimize ...
Kumi Nakai   +4 more
doaj   +1 more source

On Greedy and Submodular Matrices [PDF]

open access: yes, 2011
We characterize non-negative greedy matrices, i.e., (0,1)-matrices A such that the problem max {c T x|Ax ≤ b, x ≥ 0} can be solved greedily. We identify so-called submodular matrices as a special subclass of greedy matrices. Finally, we extend the notion of greediness to { − 1,0,1}-matrices. We present numerous applications of these concepts.
Faigle, Ulrich   +2 more
openaire   +2 more sources

Submodular Dominance and Applications

open access: yesCoRR, 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 natural notion of negative dependence, which we call Weak Negative Regression (WNR), that ...
Qiu, Frederick, Singla, Sahil
openaire   +4 more sources

Optimization of Tank Cleaning Station Locations and Task Assignments in Inland Waterway Networks: A Multi-Period MIP Approach

open access: yesMathematics
Inland waterway transportation is critical for the movement of hazardous liquid cargoes. To prevent contamination when transporting different types of liquids, certain shipments necessitate tank cleaning at designated stations between tasks. This process
Yanmeng Tao   +3 more
doaj   +1 more source

On Constructing Finite, Finitely Subadditive Outer Measures, and Submodularity

open access: yesInternational 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

Submodular partition functions

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amini, Omid   +3 more
openaire   +3 more sources

Differentiable Submodular Maximization [PDF]

open access: yesProceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018
We consider learning of submodular functions from data. These functions are important in machine learning and have a wide range of applications, e.g. data summarization, feature selection and active learning. Despite their combinatorial nature, submodular functions can be maximized approximately with strong theoretical guarantees in polynomial time ...
Sebastian Tschiatschek   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy