Intractable problems in novelty and diversity
Entity
UAM. Departamento de Ingeniería InformáticaPublisher
Universidad de CoruñaDate
2011Citation
Jornadas de Ingeniería del Software y Bases de Datos (JISBD). A Coruña: Universidad, 2011. 87-100ISBN
978-84-9749-486-1Funded by
This work was supported in part by the Ministerio de Educaci´on y Ciencia under the grant N. MEC TIN2008-06566-C04-02.Editor's Version
http://lbd.udc.es/jornadas2011/actas/JISBD/JISBD/S1/Regulares/jisbd2011_submission_57.pdfSubjects
InformáticaNote
Versión electrónica de la ponencia presentada en la XVI Jornadas de Ingeniería del Software y de Bases de Datos (JISBD 2011), celebrada en 2011 en A CoruñaRights
© Universidade da CoruñaAbstract
Information retrieval’s basic problem is retrieving a set of documents
relevant for a given query. Here, we present three classes of methods that appeared
in the liteature, as well as a new one, which is an improvement of the one
the three, to retrieve result sets that, in addition to relevance, try to maximize diversity
and novelty. We analyze the complexity of these problems and show that
whenever relevance, diversity, and novelty are considered together, the methods
are all NP-complete.
Files in this item
Google Scholar:Santini, Simone
-
Castells Azpilicueta, Pablo
This item appears in the following Collection(s)
Related items
Showing items related by title, author, creator and subject.