Skip to main content

Understanding Transparent and Complicated Users as Instances of Preference Learning for Recommender Systems

  • Conference paper
Mathematical and Engineering Methods in Computer Science (MEMICS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9548))

  • 536 Accesses

Abstract

In this paper we are concerned with user understanding in content based recommendation. We assume having explicit ratings with time-stamps from each user. We integrate three different movie data sets, trying to avoid features specific for single data and try to be more generic. We use several metrics which were not used so far in the recommender systems domain. Besides classical rating approximation with RMSE and ratio of order agreement we study new metrics for predicting Next-k and (at least) 1-hit at Next-k. Using these Next-k and 1-hit we try to model display of our recommendation – we can display k objects and hope to achieve at least one hit.

We trace performance of our methods and metrics also as a distribution along each single user. We define transparent and complicated users with respect to number of methods which achieved at least one hit.

We provide results of experiments with several combinations of methods, data sets and metrics along these three axes.

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

References

  1. Amatriain, X., Pujol, J.M., Oliver, N.: I like it… i like it not: evaluating user ratings noise in recommender systems. In: Houben, G.-J., McCalla, G., Pianesi, F., Zancanaro, M. (eds.) UMAP 2009. LNCS, vol. 5535, pp. 247–258. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Chapman, P.: The CRISP-DM user guide. In: 4th CRISP-DM SIG Workshop in Brussels in March 1999 (1999). http://en.wikipedia.org/wiki/Cross_Industry_Standard_Process_for_Data_Mining

  3. Guillou, F., Gaudel, R., Mary, J., Preux, P.: User engagement as evaluation: a ranking or a regression problem? In: ACM 2014, pp. 7–12 (2014)

    Google Scholar 

  4. Horváth, T., Vojtáš, P.: Induction of fuzzy and annotated logic programs. In: Muggleton, S.H., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol. 4455, pp. 260–274. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. J. Logic Programm. 12(4), 335–367 (1992)

    Article  MathSciNet  Google Scholar 

  6. Kopecky, M., Peska, L., Vojtas, P., Vomlelova, M.: Monotonization of user preferences. In: Andreasen, T., et al. (eds.) FQAS 2015. AISC, vol. 400, pp. 29–40. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  7. Peska, L., Vojtas, P.: Hybrid recommending exploiting multiple DBPedia language editions. In: ESWC 2014 Linked Open Data-enabled Recommender Systems Challenge (2014)

    Google Scholar 

  8. Peska, L., Vojtas, P.: Hybrid biased k-NN to predict movie tweets popularity, poster. http://2014.recsyschallenge.com/program/SemWexMFF_short_09-21.pdf

  9. RecSysChallenge2014: http://2014.recsyschallenge.com/leaderboard/, http://2014.recsyschallenge.com/

  10. Smith-Miles, K.: Understanding strengths and weaknesses of optimization algorithms with new visualization tools and methodologies. In: IFORS Conference Plenary Session, Barcelona, July 2014. http://www.ifors2014.org/files2/KateSmithMiles.pdf

  11. Vomlelova, M., Kopecky, M., Vojtas, P.: Transformation and aggregation preprocessing for top-k recommendation GAP rules induction. In: CEUR Proceedings Vol-1417 Rule Challenge and Doctoral Consortium @ RuleML 2015, Track 2: Rule-based Recommender Systems for the Web of Data. http://ceur-ws.org/Vol-1417/paper18.pdf

  12. Kuchar, J.: Augmenting a feature set of movies using linked open data. In: CEUR Proceedings Vol-1417 Rule Challenge and Doctoral Consortium @ RuleML 2015, Track 2: Rule-based Recommender Systems for the Web of Data. http://ceur-ws.org/Vol-1417/paper16.pdf, Dataset http://nbviewer.ipython.org/urls/s3-eu-west-1.amazonaws.com/recsysrules2015/RecSysRules2015-Dataset.ipynb

Download references

Acknowledgment

This work was supported by Czech grants P103-15-19877S and P46.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. Vojtas .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Vojtas, P., Kopecky, M., Vomlelova, M. (2016). Understanding Transparent and Complicated Users as Instances of Preference Learning for Recommender Systems. In: Kofroň, J., Vojnar, T. (eds) Mathematical and Engineering Methods in Computer Science. MEMICS 2015. Lecture Notes in Computer Science(), vol 9548. Springer, Cham. https://doi.org/10.1007/978-3-319-29817-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29817-7_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29816-0

  • Online ISBN: 978-3-319-29817-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics