Solving Package Recommendation Problems with Item Relations and Variable Size
In this article, we explore an approach to solve the problem of recommending a package of items (each of them with a score and a cost ) to a user. In our approach, we consider two types of relations between items: dependency and incompatibility; and we also consider that the size of the package is...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2015
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/52090 http://44jaiio.sadio.org.ar/sites/default/files/asai88-95.pdf |
| Aporte de: |
| Sumario: | In this article, we explore an approach to solve the problem of recommending a package of items (each of them with a score and a cost ) to a user.
In our approach, we consider two types of relations between items: dependency and incompatibility; and we also consider that the size of the package is not fixed but cost-driven. To this end, adaptations of existing package recommendation algorithms are proposed. We have evaluated the proposed approach in a specific domain and obtained promising results. |
|---|