Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.


Download file Download BibTeX


Collaborative filtering based on bi-relational data representation


[ 1 ] Instytut Automatyki i Inżynierii Informatycznej, Wydział Elektryczny, Politechnika Poznańska | [ P ] employee

Year of publication


Published in

Foundations of Computing and Decision Sciences

Journal year: 2013 | Journal volume: Vol. 38 | Journal number: no. 1

Article type

scientific article

Publication language


  • collaborative filtering
  • personalized recommendation
  • Statistical Relational Learning
  • RDF
  • propositional data representation

EN Widely-referenced approaches to collaborative filtering (CF) are based on the use of an input matrix that represents each user profile as a vector in a space of items and each item as a vector in a space of users. When the behavioral input data have the form of (userX, likes, itemY) and (userX, dislikes, itemY) triples one has to propose a representation of the user feedback data that is more suitable for the use of propositional data than the ordinary user-item ratings matrix. We propose to use an element-fact matrix, in which columns represent RDF-like behavioral data triples and rows represent users, items, and relations. By following such a triple-based approach to the bi-relational behavioral data representation we are able to improve the quality of collaborative filtering. One of the key findings of the research presented in this paper is that the proposed bi-relational behavioral data representation, while combined with reflective matrix processing, significantly outperforms state-of-the-art collaborative filtering methods based on the use of a ‘standard’ user-item matrix.

Pages (from - to)

67 - 83




License type

CC BY-NC-ND (attribution - noncommercial - no derivatives)

Full text of article

Download file

Access level to full text


Ministry points / journal


This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.