Thresholding Methods for Streaming Submodular Maximization with a Cardinality Constraint and Its Variants

Ruiqi Yang (), Dachuan Xu (), Min Li () and Yicheng Xu ()
Additional contact information
Ruiqi Yang: Beijing University of Technology
Dachuan Xu: Beijing University of Technology
Min Li: Shandong Normal University
Yicheng Xu: Chinese Academy of Sciences

A chapter in Nonlinear Combinatorial Optimization, 2019, pp 123-140 from Springer

Abstract: Abstract Constrained submodular maximization (CSM) is widely used in numerous data mining and machine learning applications such as data summarization, network monitoring, exemplar-clustering, and nonparametric learning. The CSM can be described as: Given a ground set, a specified constraint, and a submodular set function defined on the power set of the ground set, the goal is to select a subset that satisfies the constraint such that the function value is maximized. Generally, the CSM is NP-hard, and cardinality constrained submodular maximization is well researched. The greedy algorithm and its variants have good performance guarantees for constrained submodular maximization. When dealing with large input scenario, it is usually formulated as streaming constrained submodular maximization (SCSM), and the classical greedy algorithm is usually inapplicable. The streaming model uses a limited memory to extract a small fraction of items at any given point of time such that the specified constraint is satisfied, and good performance guarantees are also maintained. In this chapter, we list the up-to-date popular algorithms for streaming submodular maximization with cardinality constraint and its variants, and summarize some problems in streaming submodular maximization that are still open.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spochp:978-3-030-16194-1_5

Ordering information: This item can be ordered from
http://www.springer.com/9783030161941

DOI: 10.1007/978-3-030-16194-1_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().