{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T15:52:00Z","timestamp":1779119520389,"version":"3.51.4"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T00:00:00Z","timestamp":1430697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2015,5,15]]},"abstract":"<jats:p>The multinomial language model has been one of the most effective models of retrieval for more than a decade. However, the multinomial distribution does not model one important linguistic phenomenon relating to term dependency\u2014that is, the tendency of a term to repeat itself within a document (i.e., word burstiness). In this article, we model document generation as a random process with reinforcement (a multivariate P\u00f3lya process) and develop a Dirichlet compound multinomial language model that captures word burstiness directly.<\/jats:p>\n          <jats:p>We show that the new reinforced language model can be computed as efficiently as current retrieval models, and with experiments on an extensive set of TREC collections, we show that it significantly outperforms the state-of-the-art language model for a number of standard effectiveness metrics. Experiments also show that the tuning parameter in the proposed model is more robust than that in the multinomial language model. Furthermore, we develop a constraint for the verbosity hypothesis and show that the proposed model adheres to the constraint. Finally, we show that the new language model essentially introduces a measure closely related to idf, which gives theoretical justification for combining the term and document event spaces in tf-idf type schemes.<\/jats:p>","DOI":"10.1145\/2746231","type":"journal-article","created":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T12:32:26Z","timestamp":1430829146000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["A P\u00f3lya Urn Document Language Model for Improved Information Retrieval"],"prefix":"10.1145","volume":"33","author":[{"given":"Ronan","family":"Cummins","sequence":"first","affiliation":[{"name":"University of Cambridge, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaul H.","family":"Paik","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanhua","family":"Lv","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA460118"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582416"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348408"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-011-9172-x"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071389.2071390"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1351324900000139"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646280"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835490"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-010-9143-7"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009122"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-008-9074-5"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571986"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398662"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148200"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143881"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009004"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076116"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700068"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009024"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021075"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 21st Text Retrieval Conference (TREC'12)","author":"Han Zhongyuan","year":"2012","unstructured":"Zhongyuan Han , Xuwei Li , Muyun Yang , Haoliang Qi , Sheng Li , and Tiejun Zhao . 2012 . Hit at TREC 2012 microblog track . In Proceedings of the 21st Text Retrieval Conference (TREC'12) . Zhongyuan Han, Xuwei Li, Muyun Yang, Haoliang Qi, Sheng Li, and Tiejun Zhao. 2012. Hit at TREC 2012 microblog track. In Proceedings of the 21st Text Retrieval Conference (TREC'12)."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630260402"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630260504"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646631.699450"},{"key":"e_1_2_1_25_1","volume-title":"Using Language Models for Information Retrieval. Grafisch Centrum Twent","author":"Hiemstra Djoerd","unstructured":"Djoerd Hiemstra . 2001. Using Language Models for Information Retrieval. Grafisch Centrum Twent , Enschede, Netherlands . Djoerd Hiemstra. 2001. Using Language Models for Information Retrieval. Grafisch Centrum Twent, Enschede, Netherlands."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 21st Text Retrieval Conference (TREC'12)","author":"Kim Yubin","year":"2012","unstructured":"Yubin Kim , Reyyan Yeniterzi , and Jamie Callan . 2012 . Overcoming vocabulary limitations in Twitter microblogs . In Proceedings of the 21st Text Retrieval Conference (TREC'12) . Yubin Kim, Reyyan Yeniterzi, and Jamie Callan. 2012. Overcoming vocabulary limitations in Twitter microblogs. In Proceedings of the 21st Text Retrieval Conference (TREC'12)."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243266"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383972"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646259"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571994"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835546"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063584"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28997-2_21"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102420"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076115"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129088"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699669"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793274.1793321"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484070"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-PS094"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291008"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1108\/00220410410560582"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'94)","author":"Stephen","unstructured":"Stephen E. Robertson and Steve Walker. 1994. Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval . In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'94) . ACM, New York, NY, 232--241. Stephen E. Robertson and Steve Walker. 1994. Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval. In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'94). ACM, New York, NY, 232--241."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 3rd Text Retrieval Conference (TREC'94)","author":"Robertson Stephen E.","year":"1994","unstructured":"Stephen E. Robertson , Steve Walker , Susan Jones , Micheline M. Hancock-Beaulieu , and Mike Gatford . 1994 . Okapi at TREC-3 . In Proceedings of the 3rd Text Retrieval Conference (TREC'94) . 109--126. Stephen E. Robertson, Steve Walker, Susan Jones, Micheline M. Hancock-Beaulieu, and Mike Gatford. 1994. Okapi at TREC-3. In Proceedings of the 3rd Text Retrieval Conference (TREC'94). 109--126."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348535"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390409"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/42.3-4.425"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243206"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb026526"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(00)00015-7"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS'07)","author":"Sunehag Peter","year":"2007","unstructured":"Peter Sunehag . 2007 . Emerge and spread models and word burstiness . In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS'07) . 540--547. Peter Sunehag. 2007. Emerge and spread models and word burstiness. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS'07). 540--547."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009983"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148204"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390408"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2009.12.004"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000008"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/502585.502654"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.384019"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/984321.984322"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571993"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746231","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:44Z","timestamp":1750227404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,4]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5,15]]}},"alternative-id":["10.1145\/2746231"],"URL":"https:\/\/doi.org\/10.1145\/2746231","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,4]]},"assertion":[{"value":"2014-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-05-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}