Diverse Retrieval via Greedy Optimization of Expected 1-call@k in a Latent Subtopic Relevance Model

Simple item page
dc.contributor.authorSanner, Scott
dc.contributor.authorGuo, Shengbo
dc.contributor.authorGraepel, Thore
dc.contributor.authorKharazmi, Sadegh
dc.contributor.authorKarimi, Sarvnaz
dc.coverage.spatialGlasgow UK
dc.date.accessioned2015-12-10T21:54:49Z
dc.date.createdOctober 24-28 2011
dc.date.issued2011
dc.date.updated2015-12-09T07:29:09Z
dc.identifier.isbn9781450307178
dc.identifier.urihttp://hdl.handle.net/1885/39100
dc.publisherAssociation for Computing Machinery Inc (ACM)
dc.relation.ispartofseriesACM Conference on Information and Knowledge Management (CIKM 2011)
dc.sourceDiverse Retrieval via Greedy Optimization of Expected 1-call@k in a Latent Subtopic Relevance Model
dc.titleDiverse Retrieval via Greedy Optimization of Expected 1-call@k in a Latent Subtopic Relevance Model
dc.typeConference paper
local.bibliographicCitation.startpage4
local.contributor.affiliationSanner, Scott, College of Engineering and Computer Science, ANU
local.contributor.affiliationGuo, Shengbo, Xerox Research Centre
local.contributor.affiliationGraepel, Thore, Microsoft Research
local.contributor.affiliationKharazmi, Sadegh, RMIT University
local.contributor.affiliationKarimi, Sarvnaz, University of Melbourne
local.contributor.authoruidSanner, Scott, u1817461
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080109 - Pattern Recognition and Data Mining
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationu4963866xPUB171
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Sanner_Diverse_Retrieval_via_Greedy_2011.pdf
Size:
253.37 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2025 LYRASIS