Item-based-adp: análise e melhoramento do algoritmo de filtragem colaborativa item-based
Carregando...
Data
2014-09-02
Autores
Título da Revista
ISSN da Revista
Título de Volume
Editor
Universidade Federal de Goiás
Resumo
Memory-based algorithms are the most popular among the collaborative filtering algorithms. They use as input a table containing ratings given by users to items, known as the
rating matrix. They predict the rating given by user a to an item i by computing similarities of the ratings among users or similarities of the ratings among items. In the first case
Memory-Based algorithms are classified as User-based algorithms and in the second one
they are labeled as Item-based algorithms. The prediction is computed using the ratings
of k most similar users (or items), also know as neighbors. Memory-based algorithms are
simple to understand and to program, usually provide accurate recommendation and are
less sensible to data change. However, to obtain the most similar neighbors for a prediction they have to process all the data which is a serious scalability problem. Also they
are sensitive to the sparsity of the input. In this work we propose an efficient and effective Item-Based that aims at diminishing the sensibility of the Memory-Based approach
to both problems stated above. The algorithm is faster (almost 50%) than the traditional
Item-Based algorithm while maintaining the same level of accuracy. However, in environments that have much data to predict and few to train the algorithm, the accuracy of
the proposed algorithm surpass significantly that of the traditional Item-based algorithms.
Our approach can also be easily adapted to be used as User-based algorithms.
Descrição
Palavras-chave
Citação
ALEIXO, Everton Lima. Item-based-adp: análise e melhoramento do algoritmo de filtragem colaborativa item-based. 2014. 96 f. Dissertação (Mestrado em Ciência da Computação) - Universidade Federal de Goiás, Goiânia, 2014.