| Reference : Delay-Tolerant Collaborative Filtering |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/10993/16080 | |||
| Delay-Tolerant Collaborative Filtering | |
| English | |
| Gratz, Patrick [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >] | |
| Leclerc, Tom [> >] | |
| 2009 | |
| Proceedings of the 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems | |
| ACM Press | |
| 109-113 | |
| No | |
| 978-1-60558-617-5 | |
| MSWiM '09: The 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems | |
| October 26-30, 2009 | |
| Tenerife | |
| Spain | |
| [en] Recommender systems using collaborative filtering are a well-established technique to overcome information overload in today's digital society. Currently, predominant collaborative filtering systems mostly depend on huge centralized databases to store user preferences and furthermore are only available when connected to Internet. In this paper, we consider an incremental recommender system for highly dynamic mobile environments where no central global knowledge is available and communication links are rather unreliable in comparison to static networks. We present an algorithm that aims to reach a reasonable prediction coverage and accuracy while keeping the amount of additional network overhead as small as possible, maximizing the performance of our system. For this purpose, the presented algorithm is based on a delay-tolerant broadcasting mechanism on top of a weighted cluster topology. Evaluation results show that in terms of accuracy and coverage the results of the presented algorithm converge on those obtained from a global knowledge scenario, even in the case of message loss. | |
| http://hdl.handle.net/10993/16080 | |
| 10.1145/1641776.1641795 |
There is no file associated with this reference.
All documents in ORBilu are protected by a user license.
