Effective page recommendation algorithms based on distributed learning automata

Rana Forsati, Afsaneh Rahbar, Mehrdad Mahdavi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Different efforts have been done to address the problem of information overload on the Internet. Recommender systems aim at directing users through this information space, toward the resources that best meet their needs and interests by extracting knowledge from the previous users' interactions. In this paper, we propose an algorithm to solve the web page recommendation problem. In our algorithm, we use distributed learning automata to learn the behavior of previous users' and recommend pages to the current user based on learned pattern. Our experiments on real data set show that the proposed algorithm performs better than the other algorithms that we compared to and, at the same time, it is less complex than other algorithms with respect to memory usage and computational cost too.

Original languageEnglish (US)
Title of host publication4th International Multi-Conference on Computing in the Global Information Technology, ICCGI 2009
Pages41-46
Number of pages6
DOIs
StatePublished - 2009
Event4th International Multi-Conference on Computing in the Global Information Technology, ICCGI 2009 - Cannes, La Bocca, France
Duration: Aug 23 2009Aug 29 2009

Publication series

Name4th International Multi-Conference on Computing in the Global Information Technology, ICCGI 2009

Conference

Conference4th International Multi-Conference on Computing in the Global Information Technology, ICCGI 2009
Country/TerritoryFrance
CityCannes, La Bocca
Period8/23/098/29/09

All Science Journal Classification (ASJC) codes

  • Biotechnology
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Software

Fingerprint

Dive into the research topics of 'Effective page recommendation algorithms based on distributed learning automata'. Together they form a unique fingerprint.

Cite this