FPSMining: A Fast Algorithm for Mining User Preferences in Data Streams

Abstract

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 mining preferences increasingly requires solutions that quickly adapt to changes. The main reason for this is that 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. The main contributions of this article are the formalization of the contextual preference mining problem in the stream setting and the introduction of two very efficient algorithms for solving this problem. We implemented both algorithms and showed their efficiency and scalability through a set of experiments over synthetic and real datasets.