Empirical Comparison of Graph-based Recommendation Engines for an Apps Ecosystem
Recommendation engines (RE) are becoming highly popular, e.g., in the area of e-commerce. A RE offers new items (products or content) to users based on their profile and historical data. The most popular algorithms used in RE are based on collaborative filtering. This technique makes recommendations...
| Autores: | , , , , , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2015 |
| País: | España |
| Recursos: | IMDEA Networks Institute |
| Repositorio: | IMDEA Networks Institute Digital Repository |
| Idioma: | inglés |
| OAI Identifier: | oai:dspace.networks.imdea.org:20.500.12761/8 |
| Acesso em linha: | http://hdl.handle.net/20.500.12761/8 https://dx.doi.org/10.9781/ijimai.2015.324 |
| Access Level: | acceso abierto |
| Palavra-chave: | Recommendation engines smartphone apps graph theory collaborative filtering flow algorithms |
| Resumo: | Recommendation engines (RE) are becoming highly popular, e.g., in the area of e-commerce. A RE offers new items (products or content) to users based on their profile and historical data. The most popular algorithms used in RE are based on collaborative filtering. This technique makes recommendations based on the past behavior of other users and the similarity between users and items. In this paper we have evaluated the performance of several RE based on the properties of the networks formed by users and items. The RE use in a novel way graph theoretic concepts like edges weights or network flow. The evaluation has been conducted in a real environment (ecosystem) for recommending apps to smartphone users. The analysis of the results allows concluding that the effectiveness of a RE can be improved if the age of the data, and if a global view of the data is considered. It also shows that graph-based RE are effective, but more experiments are required for a more accurate characterization of their properties. |
|---|