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

  title={Finding \$\$k\$\$ k most favorite products based on reverse top- \$\$t\$\$ t queries},
  author={Jia-Ling Koh and Chen-Yi Lin and Arbee L. P. Chen},
  journal={The VLDB Journal},
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$$ 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… CONTINUE READING
11 Citations
25 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 11 extracted citations


Publications referenced by this paper.
Showing 1-10 of 25 references

Approximation Algorithms for NP-Hard Problem

  • Hochbaum, D. ed.
  • PWS Publishing company, Boston, MA
  • 1997
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…