300 citations · 1.5k across the 38 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LG2016★ 4 cited
Scaling Submodular Maximization via Pruned Submodularity Graphs
Tianyi Zhou, Hua Ouyang, Yi Chang +2
We propose a new random pruning method (called "submodular sparsification (SS)") to reduce the cost of submodular maximization. The pruning is applied via a "submodularity graph" o…
stat.ML2016
Stream Clipper: Scalable Submodular Maximization on Stream
Tianyi Zhou, Jeff Bilmes
We propose a streaming submodular maximization algorithm "stream clipper" that performs as well as the offline greedy algorithm on document/video summarization in practice. It adds…