Skip to main content

Reverse Top-k Query on Uncertain Preference

  • Conference paper
  • First Online:
Web and Big Data (APWeb-WAIM 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10988))

  • 1686 Accesses

Abstract

As a reverse rank-aware query, reverse top-k query returns the user preferences which make the given object belong to the top-k result set. This paper studies the reverse top-k query on uncertain preferences for the first time. A user’s uncertain preference consists of several probable preference instances, which reflects the user’s potential consumption tendency. In this paper, we design an optimization algorithm BBUPR based on the proposed RUI-tree index. Our experiment results show that BBUPR outperforms the other algorithms.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://www.yelp.com.

References

  1. Wang, X., Yan, J.: Reverse top-k query on uncertain data. Comput. Sci. (Chin.) 39, 191–194 (2012)

    Google Scholar 

  2. Jin, C., Zhang, R., Kang, Q., Zhang, Z., Zhou, A.: Probabilistic reverse top-k queries. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) DASFAA 2014, pp. 406–419. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05810-8_27

    Chapter  Google Scholar 

  3. Vlachou, A., Doulkeridis, C., Kotidis, Y., Norvag, K.: Monochromatic and bichromatic reverse top-k queries. In: Proceedings TKDE (2011)

    Article  Google Scholar 

  4. Vlachou, A., Doulkeridis, C., Kjetil, N., Kotidis, Y.: Branch-and-bound algorithm for reverse top-k queries. In: Proceedings SIGMOD (2013)

    Google Scholar 

  5. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings SIGMOD, pp. 47–57 (1984)

    Google Scholar 

  6. Soliman, M.A., Ilya, I.F., K.C., Chang, C.: Top-k query processing in uncertain databases. In: Proceedings ICDE (2007)

    Google Scholar 

  7. Zhang, Y., Lai, G., Ma, S.: Explicit factor models for explainable recommendation based on phrase-level sentiment analysis. In: Proceedings SIGIR 2014, pp. 83–92 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaosong Zhao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, G., Chen, Q., Zheng, B., Zhao, X. (2018). Reverse Top-k Query on Uncertain Preference. In: Cai, Y., Ishikawa, Y., Xu, J. (eds) Web and Big Data. APWeb-WAIM 2018. Lecture Notes in Computer Science(), vol 10988. Springer, Cham. https://doi.org/10.1007/978-3-319-96893-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-96893-3_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-96892-6

  • Online ISBN: 978-3-319-96893-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics