Optimizing word set coverage for multi-event summarization

DOI10.1007/s10878-015-9855-0zbMath1333.90113OpenAlexW2112890282MaRDI QIDQ887893

Ming Gao, Chengyu Wang, Aoying Zhou, Wenliang Cheng, Jun Liu, Jihong Yan

Publication date: 3 November 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9855-0

zbMATH Keywords

optimizationset coverageevent summarizationword set

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (3)

Optimizing model parameter for entity summarization across knowledge graphs ⋮ Analysis of cough detection index based on decision tree and support vector machine ⋮ Fitting PB1-p62 filaments model structure into its electron microscopy based on an improved genetic algorithm

Uses Software

• AS 136

Cites Work

• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• Surrogate constraint normalization for the set covering problem
• Computational experience with general cutting planes for the set covering problem
• A set covering approach for multi-depot train driver scheduling
• Tight approximation bounds for combinatorial frugal coverage algorithms
• Divergence measures based on the Shannon entropy
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• 10.1162/jmlr.2003.3.4-5.993
• A Heuristic Method for the Set Covering Problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

This page was built for publication: Optimizing word set coverage for multi-event summarization