Skip to main content

Improving Retrieval Quality Using PRF Mechanism from Event Perspective

  • Conference paper
  • First Online:
Natural Language Processing and Chinese Computing (NLPCC 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10619))

  • 3219 Accesses

Abstract

Pseudo-relevance feedback (PRF) has proven to be an effective mechanism for improving retrieval quality. However, using general PRF mechanism would usually be demonstrated with poor performance when the retrieval objective is an event. Intuitively, event-oriented query often involves special properties of event object, which cannot easily be expressed with keyword-based event query, and might cause the deviation from target event to feedback documents. In this paper, an original, simple yet effective event-oriented PRF mechanism (EO-PRF) that takes into account the drawbacks of PRF mechanism from an event perspective to improve retrieval quality is proposed. This EO-PRF mechanism innovates by making use of some extra event knowledge to improve retrieval quality by integrating target event information with the initial query. Empirical evaluations based on TREC-TS 2015 dataset and standard benchmarks, namely mainstream non-feedback retrieval method, and state-of-the-art pseudo feedback methods, demonstrate the effectiveness of the proposed EO-PRF mechanism in event-oriented retrieval.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For the sake of efficiency, the language model presented in this paper is always a unigram language model.

  2. 2.

    This is reasonable as, in general, we only need to confirm \(\theta _{e_{estimate}}\notin \{\theta _{e_i}\}_{i=1}^k\) if \(e_{estimate}=e_{u}\), however, the term distribution in whole document set can be seen as a mixture of multiple events, so it would not be consistent with any known event language model.

  3. 3.

    http://www.trec-ts.org/.

  4. 4.

    Available at http://lucene.apache.org/.

References

  1. Lv, Y., Zhai, C.: Revisiting the divergence minimization feedback model. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 1863–1866. ACM (2014)

    Google Scholar 

  2. Duan, H., Zhai, C., Cheng, J., Gattani, A.: A probabilistic mixture model for mining and analyzing product search log. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 2179–2188. ACM (2013)

    Google Scholar 

  3. Yang, W., Li, R., Li, P., Zhou, M., Wang, B.: Event related document retrieval based on bipartite graph. In: Cui, B., Zhang, N., Xu, J., Lian, X., Liu, D. (eds.) WAIM 2016. LNCS, vol. 9658, pp. 467–478. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39937-9_36

    Google Scholar 

  4. Glavaš, G., Šnajder, J.: Event-centered information retrieval using kernels on event graphs. In: TextGraphs-8 at Empirical Methods in Natural Language Processing (EMNLP 2013) (2013)

    Google Scholar 

  5. Zhong, Z., Zhu, P., Li, C., Guan, Y., Liu, Z.: Research on event-oriented query expansion based on local analysis. J. China Soc. Sci. Tech. Inf. 31(2), 151–159 (2012)

    Google Scholar 

  6. Zhong, Z., Li, C., Guan, Y., Liu, Z.: A method of query expansion based on event ontology. J. Converg. Inf. Technol. 7(9), 364–371 (2012)

    Google Scholar 

  7. Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B (Methodol.) 39, 1–38 (1977)

    MathSciNet  MATH  Google Scholar 

  8. Zhai, C., Lafferty, J.: A study of smoothing methods for language models applied to ad hoc information retrieval. In: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 334–342. ACM (2001)

    Google Scholar 

  9. Tao, T., Zhai, C.: A mixture clustering model for pseudo feedback in information retrieval. In: Banks, D., McMorris, F.R., Arabie, P., Gaul, W. (eds.) Classification, Clustering, and Data Mining Applications, pp. 541–551. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-642-17103-1_51

    Chapter  Google Scholar 

Download references

Acknowledgment

This work was supported by the National Natural Science Foundation of China (61572494), the National Key Research and Development Program of China (grant No. 2016YFB0801003), the National Natural Science Foundation of China (61462027) and the fund project of Jiangxi Province Education Office (GJJ160529).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pengming Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, P., Li, P., Li, R., Wang, B. (2018). Improving Retrieval Quality Using PRF Mechanism from Event Perspective. In: Huang, X., Jiang, J., Zhao, D., Feng, Y., Hong, Y. (eds) Natural Language Processing and Chinese Computing. NLPCC 2017. Lecture Notes in Computer Science(), vol 10619. Springer, Cham. https://doi.org/10.1007/978-3-319-73618-1_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73618-1_49

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73617-4

  • Online ISBN: 978-3-319-73618-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics