2011
DOI: 10.4304/risti.8.15-24
|View full text |Cite
|
Sign up to set email alerts
|

Algoritmo de Recomendação Baseado em Passeios Aleatórios num Grafo Bipartido

Abstract: Resumo: Neste trabalho apresentamos um novo algoritmo de recomendação para aplicações de E-commerce, baseado em passeios aleatórios num grafo bipartido. O desempenho do mesmo é testado com dados provenientes de transações comerciais reais e os resultados comparados com os de cinco outros algoritmos. Por fim, apresentamos possíveis generalizações do algoritmo, tornando-o muito versátil em aplicações práticas.Palavras-chave: Algoritmos de Recomendação, Filtragem Colaborativa, Passeios Aleatórios. Abstract:In thi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…This makes learning and algorithm performance difficult. Thus, it is necessary to use mechanisms that reduce the learning time of the algorithms and predict products the user might need based on the little available information (Gama, 2011).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This makes learning and algorithm performance difficult. Thus, it is necessary to use mechanisms that reduce the learning time of the algorithms and predict products the user might need based on the little available information (Gama, 2011).…”
Section: Introductionmentioning
confidence: 99%
“…There are several types of algorithms, and despite the success of some of them, most of it has problems. Therefore, it is important companies have a consistent and relevant algorithm to recommend products to their users (Gama, 2011).…”
Section: Introductionmentioning
confidence: 99%