A Minimum Set-Cover Problem with several constraints

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI:10.15439/2019F2

Jens Dörpinghaus, Carsten Düing, Vera Weil

引用次数: 1

Abstract

A lot of problems in natural language processing can be interpreted using structures from discrete mathematics. In this paper we will discuss the search query and topic finding problem using a generic context-based approach. This problem can be described as a Minimum Set Cover Problem with several constraints. The goal is to find a minimum covering of documents with the given context for a fixed weight function. The aim of this problem reformulation is a deeper understanding of both the hierarchical problem using union and cut as well as the non-hierarchical problem using the union. We thus choose a modeling using bipartite graphs and suggest a novel reformulation using an integer linear program as well as novel graph-theoretic approaches.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

若干约束条件下的最小集覆盖问题

自然语言处理中的许多问题都可以用离散数学的结构来解释。在本文中，我们将使用一种通用的基于上下文的方法来讨论搜索查询和主题查找问题。这个问题可以被描述为具有几个约束条件的最小集覆盖问题。目标是为一个固定权重函数找到具有给定上下文的文档的最小覆盖范围。这种问题重新表述的目的是对使用并集和切集的分层问题以及使用并集的非分层问题有更深的理解。因此，我们选择了使用二部图的建模，并建议使用整数线性规划以及新的图论方法进行新的重新表述。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2019 Federated Conference on Computer Science and Information Systems (FedCSIS)

自引率

0.00%

发文量

期刊最新文献

Efficient Support Vector Regression with Reduced Training Data A Deep Learning and Multimodal Ambient Sensing Framework for Human Activity Recognition Predicting Blood Glucose using an LSTM Neural Network License Plate Detection with Machine Learning Without Using Number Recognition Tool-assisted Surrogate Selection for Simulation Models in Energy Systems