Technical Evaluation of Boolean Recommenders

  • S. Chojnacki
  • M. A. Kłopotek
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 99)

Abstract

The purpose of this paper is to describe a new methodology dedicated to the analysis of boolean recommenders. The aim of most recommender system is to suggest interesting items to a given user. The most common criteria utilized to evaluate a system are its statistical correctness and completeness. The two can be measured by accuracy and recall indices. In this paper we argue that technical performance is an important step in the process of recommender system’s evaluation. We focus on four real-life characteristics i.e. time required to build a model, memory consumption of the built model, expected latency of creating a recommendation for a random user and finally the time required to retrain the model with new ratings. We adapt a recently developed evaluation technique, which is based on an iterative generation of bipartite graphs. In this paper we concentrate on a case when preferences are boolean, which is opposite to value-based ratings.

Keywords

Bipartite Graph Recommender System Preferential Attachment Memory Consumption Collaborative Filter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bell and Koren 2007]
    Bell, R.M., Koren, Y.: Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In: Proc. of ICDM, pp. 43–52. IEEE Computer Society, Los Alamitos (2007)Google Scholar
  2. [Chojnacki and Kłopotek 2010a]
    Chojnacki, S., Kłopotek, M.A.: Random graph generator for bipartite networks modeling (2011), http://arxiv.org/abs/1010.5943
  3. [Chojnacki and Kłopotek 2010b]
    Chojnacki, S., Kłopotek, M.A.: Random graphs for performance evaluation of recommender systems (2011), http://arxiv.org/abs/1010.5954
  4. [Herlocker et al. 1999]
    Herlocker, J.L., Konstan, J.A., Borchers, A., et al.: An algorithmic framework for performing collaborativeltering. In: Proc. of the 22nd Annual International ACM SIGIR Conference on Research and Development in Informarmation Retrieval, pp. 230–237. ACM Press, New York (1999)CrossRefGoogle Scholar
  5. [Jahrer et al. 2010]
    Jahrer, M., Toscher, A., Legenstein, R.: Combining predictions for accurate recommender systems. In: KDD, pp. 693–702. ACM Press, New York (2010)Google Scholar
  6. [Lemire and Maclachlan 2005]
    Lemire, D., Maclachlan, A.: Slope one predictors for online rating-based collaborative filtering. In: Proc. of SIAM Data Mining (2005)Google Scholar
  7. [Owen et al. 2010]
    Owen, S., Anil, R., Dunning, T., et al.: Mahout in Action, Manning (2010)Google Scholar
  8. [Zhang et al. 2005]
    Zhang, S., Wang, W., Ford, J., et al.: Using singular value decomposition approximation for collaborative filtering. In: Proc. of the 7th IEEE Conf. on E-Commerce, pp. 257–264 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • S. Chojnacki
    • 1
  • M. A. Kłopotek
    • 1
  1. 1.Institute of Computer SciencePolish Academy of SciencesPoland

Personalised recommendations