Finding k most favorite products based on reverse top-t queries

Jia-Ling Koh, Chen Yi Lin, Arbee L.P. Chen

研究成果: 雜誌貢獻文章

18 引文 斯高帕斯(Scopus)

摘要

A reverse top-t query for a product returns a set of customers, named potential customers, who regard the product as one of their top-t favorites. Given a set of customers with different preferences on the features of the products, we want to select at most k products from a pool of candidate products such that their total number of potential customers is maximized. Two versions of the problem are defined according to whether the competitive existing products are given. For solving this NP-hard problem, we first propose an incremental greedy approach to find an approximate solution of the problem with quality guaranteed. For further speeding up this basic greedy approach, we exploit several properties of the top-t queries and skyline queries to reduce the solution space of the problem. In addition, an upper bound of the potential customers is estimated to reduce the cost of computing the reverse top-t queries for the candidate products. Finally, when the candidate products are formed from multiple component tables, we propose a strategy to reduce the number of the accessed tuples in the component tables such that only the tuples that are possibly components of the top-t favorites of the customers need to be accessed. By applying these pruning strategies, we propose another faster greedy approach. The experiment results demonstrate that the proposed pruning strategies work very well and make the faster greedy algorithms for both versions of the problem achieve excellent performance on both efficiency and memory utilization.

原文英語
頁(從 - 到)541-564
頁數24
期刊VLDB Journal
23
發行號4
DOIs
出版狀態已發佈 - 2014 一月 1

ASJC Scopus subject areas

  • Information Systems
  • Hardware and Architecture

指紋 深入研究「Finding k most favorite products based on reverse top-t queries」主題。共同形成了獨特的指紋。

  • 引用此