Content and structure coverage: extracting a diverse information subset

DOI10.1287/IJOC.2017.0753MaRDI QIDQ5131695zbMATH OpenOpenAlexFDO

Authors Baojun Ma, Qiang Wei, Jin Zhang, Xunhua Guo, Guoqing Chen

Publication date 9 November 2020

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c4229007c463733f103d05aada85d73429c3059f

zbMATH Keywords

submodularityfast approximationinformation content coverageinformation diversityinformation structure coverage

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Information theory (general) (94A15) Communication networks in operations research (90B18)

Recommendations

• Modelling efficient novelty-based search result diversification in metric spaces
• Max-sum diversification, monotone submodular functions, and dynamic updates
• Multiple Radii DisC Diversity
• Information coverage maximization for multiple products in social networks
• Maximization problems of balancing submodular relevance and supermodular diversity

Cites work

• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• 10.1162/jmlr.2003.3.4-5.993
• A new metric for probability distributions
• A risk minimization framework for information retrieval
• A survey of simulated annealing as a tool for single and multiobjective optimization
• An analysis of approximations for maximizing submodular set functions—I
• Cardinality, quantifiers, and the aggregation of fuzzy criteria
• Empirical and theoretical comparisons of selected criterion functions for document clustering
• Equation of state calculations by fast computing machines
• Fuzzy cardinality and the modeling of imprecise quantification
• Introduction to Information Retrieval
• Introduction to algorithms.
• Okapi
• On Information and Sufficiency
• Optimization by simulated annealing
• Semi-supervised model-based document clustering: a comparative study
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Web data mining. Exploring hyperlinks, contents, and usage data.

Describes a project that uses

Uses Software

• Okapi

This page was built for publication: Content and structure coverage: extracting a diverse information subset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131695)