%0 Journal Article %1 Peska2017 %A Peska, Ladislav %A Vojtas, Peter %D 2017 %J Journal on Data Semantics %K implicit-feedback recommender social-information-access %N 1 %P 15--30 %R 10.1007/s13740-016-0061-8 %T Using Implicit Preference Relations to Improve Recommender Systems %U http://dx.doi.org/10.1007/s13740-016-0061-8 %V 6 %X Our work is generally focused on making recommendations for small or medium-sized e-commerce portals, where we are facing scarcity of explicit feedback, low user loyalty, short visit durations or a low number of visited objects. In this paper, we present a novel approach to use a specific user behavior pattern as implicit feedback, forming binary relations between objects. Our hypothesis is that if a user selects a specific object from the list of displayed objects, it is an expression of his/her binary preference between the selected object and others that are visible, but ignored. We expand this relation with content-based similarity of objects. We define implicit preference relation (IPR) a partial ordering of objects based on similarity expansion of ignored-selected preference relation. We propose a merging algorithm utilizing the synergic effect of two approaches this IPR partial ordering and a list of recommended objects based on any/another algorithm. We report on a series of offline experiments with various recommending algorithms on two real-world e-commerce datasets. The merging algorithm could improve the ranked list of most of the evaluated algorithms in terms of nDCG. Furthermore, we also provide access to the relevant datasets and source codes for further research.

@article{Peska2017, abstract = {Our work is generally focused on making recommendations for small or medium-sized e-commerce portals, where we are facing scarcity of explicit feedback, low user loyalty, short visit durations or a low number of visited objects. In this paper, we present a novel approach to use a specific user behavior pattern as implicit feedback, forming binary relations between objects. Our hypothesis is that if a user selects a specific object from the list of displayed objects, it is an expression of his/her binary preference between the selected object and others that are visible, but ignored. We expand this relation with content-based similarity of objects. We define implicit preference relation (IPR) a partial ordering of objects based on similarity expansion of ignored-selected preference relation. We propose a merging algorithm utilizing the synergic effect of two approaches this IPR partial ordering and a list of recommended objects based on any/another algorithm. We report on a series of offline experiments with various recommending algorithms on two real-world e-commerce datasets. The merging algorithm could improve the ranked list of most of the evaluated algorithms in terms of nDCG. Furthermore, we also provide access to the relevant datasets and source codes for further research.}, added-at = {2017-05-15T21:47:53.000+0200}, author = {Peska, Ladislav and Vojtas, Peter}, biburl = {https://www.bibsonomy.org/bibtex/2ee6786e87d6ad4228a4f6abee335a333/sdjavadi}, description = {Using Implicit Preference Relations to Improve Recommender Systems | SpringerLink}, doi = {10.1007/s13740-016-0061-8}, interhash = {0d22ec5e2ba75671e09540084ca1528c}, intrahash = {ee6786e87d6ad4228a4f6abee335a333}, issn = {1861-2040}, journal = {Journal on Data Semantics}, keywords = {implicit-feedback recommender social-information-access}, number = 1, pages = {15--30}, timestamp = {2017-05-15T21:47:53.000+0200}, title = {Using Implicit Preference Relations to Improve Recommender Systems}, url = {http://dx.doi.org/10.1007/s13740-016-0061-8}, volume = 6, year = 2017 }