Maximization problems of balancing submodular relevance and supermodular diversity

Zhicheng Liu, Longkun Guo, Donglei Du, Dachuan Xu and Xiaoyan Zhang ()
Additional contact information
Zhicheng Liu: Nanjing Normal University
Longkun Guo: Fuzhou University
Donglei Du: University of New Brunswick
Dachuan Xu: Beijing University of Technology
Xiaoyan Zhang: Nanjing Normal University

Journal of Global Optimization, 2022, vol. 82, issue 1, No 9, 179-194

Abstract: Abstract Relevance and diversity are two desirable properties in data retrieval applications, an important field in data science and machine learning. In this paper, we consider three maximization problems to balance these two factors. The objective function in each problem is the sum of a monotone submodular function f and a supermodular function g, where f and g capture the relevance and diversity of any feasible solution, respectively. In the first problem, we consider a special supermodular diversity function g of a sum-sum format satisfying the relaxed triangle inequality, for which we propose a greedy-type approximation algorithm with an $$\left( 1-1/e,1/(2\alpha )\right) $$ 1 - 1 / e , 1 / ( 2 α ) -bifactor approximation ratio, improving the previous $$\left( 1/(2\alpha ),1/(2\alpha )\right) $$ 1 / ( 2 α ) , 1 / ( 2 α ) -bifactor approximation ratio. In the second problem, we consider an arbitrary supermodular diversity function g, for which we propose a distorted greedy method to give a $$\min \left\{ 1-k_{f}e^{-1},1-k^{g}e^{-(1-k^{g})}\right\} $$ min 1 - k f e - 1 , 1 - k g e - ( 1 - k g ) -approximation algorithm, improving the previous $$k_f^{-1}\left( 1-e^{-k_f(1-k^{g})}\right) $$ k f - 1 1 - e - k f ( 1 - k g ) -approximation ratio, where $$k_f$$ k f and $$k^g$$ k g are the curvatures of the submodular function f and the supermodular funciton g, respectively. In the third problem, we generalize the uniform matroid constraint to the p matroid constraints, for which we present a local search algorithm to improve the previous $$\frac{1-k^g}{(1-k^g)k^f+p}$$ 1 - k g ( 1 - k g ) k f + p -approximation ratio to $$\min \left\{ \frac{p+1-k_f}{p(p+1)},\left( \frac{1-k^g}{p}+\frac{k^g(1-k^g)^2}{p+(1-k^g)^2}\right) \right\} $$ min p + 1 - k f p ( p + 1 ) , 1 - k g p + k g ( 1 - k g ) 2 p + ( 1 - k g ) 2 .

Keywords: submodular; Max-sum diversification; Greedy algorithm; Local search; Supermodular; Curvature; Matroid (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-021-01063-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:82:y:2022:i:1:d:10.1007_s10898-021-01063-6

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-021-01063-6

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().