English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 95844/126434 (76%)
Visitors : 31570172      Online Users : 544
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 期刊論文 >  Item 140.119/75863
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/75863

    Title: Finding k most favorite products based on reverse top-t queries
    Authors: Koh, J.-L.;Lin, C.-Y.;Chen, Arbee L.P.
    Contributors: 資科系
    Keywords: Computational complexity;Query processing;Approximate solution;Greedy algorithms;Maximum coverage;Memory utilization;Multiple components;Potential customers;Quality guaranteed;Reverse top-t query;Sales
    Date: 2014-08
    Issue Date: 2015-06-16 17:34:26 (UTC+8)
    Abstract: 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. © 2013 Springer-Verlag Berlin Heidelberg.
    Relation: VLDB Journal, 23(4), 541-564
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1007/s00778-013-0336-8
    DOI: 10.1007/s00778-013-0336-8
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    541-564.pdf2398KbAdobe PDF531View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback