论文信息 - SATTY : Word Sense Induction Application in Web Search Clustering

SATTY : Word Sense Induction Application in Web Search Clustering

The aim of this paper is to perform Word Sense induction (WSI); which clusters web search results and produces a diversified list of search results. It describes the WSI system developed for Task 11 of SemEval - 2013. This paper implements the idea of monotone submodular function optimization using greedy algorithm.

Ganesh Ramakrishnan | Ramakrishna Bairi | Upasana Gaikwad | Satyabrata Behera

[1] Hui Lin,et al. A Class of Submodular Functions for Document Summarization , 2011, ACL.

[2] Roberto Navigli,et al. Clustering and Diversifying Web Search Results with Graph-Based Word Sense Induction , 2013, CL.

[3] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[4] Jingrui He,et al. GenDeR: A Generic Diversified Ranking Algorithm , 2012, NIPS.

[5] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.

[6] Roberto Navigli,et al. SemEval-2013 Task 11: Word Sense Induction and Disambiguation within an End-User Application , 2013, SemEval@NAACL-HLT.

[7] Hui Lin,et al. Learning Mixtures of Submodular Shells with Application to Document Summarization , 2012, UAI.