Jaqueline A. J. PapiniSandra de AmoAllan Kardec S. Soares

NeWG : In Search of the Rat’s World Graph

The traditional preference mining setting, referred to here as the batch setting, has been widely studied in the literature in recent years. However, the dynamic nature of the problem of mining preferences increasingly requires solutions that quickly adapt to change. The main reason for this is that frequently user's preferences are not static and can evolve over time. In this article, we address the problem of mining contextual preferences in a data stream setting. Contextual Preferences have been recently treated in the literature and some methods for mining this special kind of preferences have been proposed in the batch setting. As main contribution of this article, we formalize the contextual preference mining problem in the stream setting and propose an algorithm for solving this problem. We implemented this algorithm and showed its efficiency through a set of experiments over real data.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: