Optimizing Keyphrase Ranking for Relevance and Diversity Using Submodular Function Optimization (SFO)
Muhammad Umair, Syed Jalaluddin Hashmi, Young-Koo Lee

TL;DR
This paper introduces a novel submodular function optimization approach for keyphrase ranking that effectively balances relevance and diversity, outperforming existing methods in benchmarks.
Contribution
The paper presents a new method using submodular optimization to enhance keyphrase ranking by explicitly balancing relevance and diversity.
Findings
Outperforms existing methods in relevance and diversity metrics
Achieves state-of-the-art performance in execution time
Demonstrates effectiveness on benchmark datasets
Abstract
Keyphrase ranking plays a crucial role in information retrieval and summarization by indexing and retrieving relevant information efficiently. Advances in natural language processing, especially large language models (LLMs), have improved keyphrase extraction and ranking. However, traditional methods often overlook diversity, resulting in redundant keyphrases. We propose a novel approach using Submodular Function Optimization (SFO) to balance relevance and diversity in keyphrase ranking. By framing the task as submodular maximization, our method selects diverse and representative keyphrases. Experiments on benchmark datasets show that our approach outperforms existing methods in both relevance and diversity metrics, achieving SOTA performance in execution time. Our code is available online.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Text Analysis Techniques
