Skip to main content

Learning Context-Aware Ranking

  • Chapter
  • 678 Accesses

Part of the book series: Studies in Computational Intelligence ((SCI,volume 330))

Learning Context-Aware Ranking

In this chapter, we propose a learning method for the problem setting of contextaware ranking. This problem setting has been investigated in detail in the last chapter. We have seen, that a context-aware ranking can be modelled by a real-valued function . Now, we will show how this function can be optimized. The optimization will be done with respect to the pairwise training data d s , that is inferred from the sparse and incomplete observations s. The whole chapter assumes, that y can be expressed as a differentiable, non-recursive function with a finite set of parameters Θ. This assumption holds for many models, including the factorization models that we will introduce in the next chapter.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Herschtal, A., Raskutti, B.: Optimising area under the roc curve using gradient descent. In: ICML 2004: Proceedings of the Twenty-First International Conference on Machine Learning, p. 49. ACM, New York (2004)

    Chapter  Google Scholar 

  • Hu, Y., Koren, Y., Volinsky, C.: Collaborative filtering for implicit feedback datasets. In: IEEE International Conference on Data Mining (ICDM 2008), pp 263–272(2008)

    Google Scholar 

  • Lathauwer, L.D., Moor, B.D., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253–1278 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  • Pan, R., Scholz, M.: Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering. In: KDD 2009: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 667–676. ACM, New York (2009)

    Chapter  Google Scholar 

  • Pan, R., Zhou, Y., Cao, B., Liu, N.N., Lukose, R.M., Scholz, M., Yang, Q.: One-class collaborative filtering. In: IEEE International Conference on Data Mining (ICDM 2008), pp. 502–511 (2008)

    Google Scholar 

  • Srebro, N., Rennie, J.D.M., Jaakola, T.S.: Maximum-margin matrix factorization. In: Advances in Neural Information Processing Systems, vol. 17, pp. 1329–1336. MIT Press, Cambridge (2005)

    Google Scholar 

  • Symeonidis, P., Nanopoulos, A., Manolopoulos, Y.: Tag recommendations based on tensor dimensionality reduction. In: RecSys 2008: Proceedings of the 2008 ACM Conference on Recommender Systems, pp. 43–50. ACM, New York (2008)

    Chapter  Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rendle, S. (2010). Learning Context-Aware Ranking. In: Context-Aware Ranking with Factorization Models. Studies in Computational Intelligence, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16898-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16898-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16897-0

  • Online ISBN: 978-3-642-16898-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics