arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2502.02530cs.DS
收藏

非对称距离下的最大最小多样化

Max-Min Diversification with Asymmetric Distances

Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti

AI总结:

本文首次研究非对称最大最小多样化(AMMD)问题,利用与最大反链问题的联系提出 $\ rac{1}{6k}$ 近似算法,并在真实与合成数据集上验证其性能。

摘要:

最大最小多样化(MMD)模型是多样性最大化中最著名且最简单的模型之一,已在数据挖掘和数据库文献中得到广泛研究。本文首次研究非对称最大最小多样化(AMMD)问题。输入是一个正整数 $k$ 和一个包含 $n$ 个顶点的完全有向图,以及边上满足有向三角不等式的非负距离函数。目标是选择一个包含 $k$ 个顶点的集合,使得它们之间的最小成对距离最大化。当距离对称时,AMMD 退化为已被广泛研究的 MMD 问题,并且该问题在查询结果多样化、网络搜索和设施选址问题中具有自然应用。尽管 MMD 问题可以通过贪心地选择下一个最远点来获得简单的 $\ rac{1}{2}$ 近似,但这一策略对 AMMD 并不适用,如何为 AMMD 设计良好的近似算法此前仍不清楚。我们利用与最大反链(Maximum Antichain)问题的联系,提出了一个组合的 $\ rac{1}{6k}$ 近似算法。我们讨论了加速该算法的几种方法,并在真实和合成数据集上将其性能与启发式基线进行了比较。

英文摘要:

One of the most well-known and simplest models for diversity maximization is the Max-Min Diversification (MMD) model, which has been extensively studied in the data mining and database literature. In this paper, we initiate the study of the Asymmetric Max-Min Diversification (AMMD) problem. The input is a positive integer $k$ and a complete digraph over $n$ vertices, together with a nonnegative distance function over the edges obeying the directed triangle inequality. The objective is to select a set of $k$ vertices, which maximizes the smallest pairwise distance between them. AMMD reduces to the well-studied MMD problem in case the distances are symmetric, and has natural applications to query result diversification, web search, and facility location problems. Although the MMD problem admits a simple $\frac{1}{2}$-approximation by greedily selecting the next-furthest point, this strategy fails for AMMD and it remained unclear how to design good approximation algorithms for AMMD. We propose a combinatorial $\frac{1}{6k}$-approximation algorithm for AMMD by leveraging connections with the Maximum Antichain problem. We discuss several ways of speeding up the algorithm and compare its performance against heuristic baselines on real-life and synthetic datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑