Polarity related influence maximization in signed social networks. [PDF]
PLoS ONE, 2014 Influence maximization in social networks has been widely studied motivated by applications like spread of ideas or innovations in a network and viral marketing of products.
Dong Li +5 more
doaj +1 more source
Submodular Optimization with Contention Resolution Extensions [PDF]
, 2019 This paper considers optimizing a submodular function subject to a set of downward closed constraints. Previous literature on this problem has often constructed solutions by (1) discovering a fractional solution to the multi-linear extension and (2 ...
Moseley, Benjamin, Sviridenko, Maxim
core +1 more source
Multi-Agent Maximization of a Monotone Submodular Function via Maximum Consensus [PDF]
IEEE Conference on Decision and Control, 2020 This paper studies distributed submodular optimization subject to partition matroid. We work in the value oracle model where the only access of the agents to the utility function is through a black box that returns the utility function value.
Navid Rezazadeh, Solmaz S. Kia
semanticscholar +1 more source
Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks
IEEE Access, 2020 Along with the development of Information Technology, Online Social Networks (OSN) are constantly developing and have become popular media in the world.
Dung V. Pham +4 more
doaj +1 more source
Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization
IEEE 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
Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture [PDF]
, 2014 We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai).
Ene, Alina, VondrΓ‘k, Jan
core +2 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
Near-Optimal Convergent Approach for Composed Influence Maximization Problem in Social Networks
IEEE Access, 2019 Crowd psychology is a critical factor when considering information diffusion, which has been modeled as composed influence. The composed influence is represented as a hyperedge in a graph model.
Jianming Zhu +3 more
doaj +1 more source
Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot
Frontiers in Neurorobotics, 2018 In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP). The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory,
Tadahiro Taniguchi +2 more
doaj +1 more source
Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms [PDF]
Operations Research Letters, 2011 We study the problem of maximizing constrained non-monotone submodular functions and provide approximation algorithms that improve existing algorithms in terms of either the approximation factor or simplicity. Our algorithms combine existing local search and greedy based algorithms. Different constraints that we study are exact cardinality and multiple
Fadaei, Salman +2 more
openaire +3 more sources