ASIA unversity:Item 310904400/114421
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 94286/110023 (86%)
造访人次 : 21707217      在线人数 : 254
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    ASIA unversity > 資訊學院 > 資訊工程學系 > 博碩士論文 >  Item 310904400/114421


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/114421


    题名: Finding the Most Profitable Products to Upgrade to Top-k Products on the Market
    作者: Thamrin, Syauki Aulia
    THAMRIN, SYAUKI AULIA
    贡献者: 資訊工程學系碩士在職專班
    关键词: Upgrading Products;Product/Attribute Combinations;Top-k Query;Greedy Algorithm;Optimal Solution
    日期: 2020
    上传时间: 2022-12-19 02:49:27 (UTC+0)
    出版者: 亞洲大學
    摘要: There are products on the market, which can be divided by our products (the products from our company) and competitors’ products. The products can be ranked by scores from a scoring function over the attribute values. The customers tend to buy top-ranked products called top-k products. If our products are not in the top-k products, we can upgrade our products to be top-k products to attract more customers. Upgrading a product needs an upgrading cost for gaining an upgrading benefit. In this thesis, we develop algorithms to upgrade our products to be top-k products on the market with the maximal profit. The upgrading profit is obtained by subtracting the upgrading cost from the upgrading benefit. The na?ve method requires a lot of computations. We propose an optimal solution named Consecutive Upgrading Filtering (CUF) and two greedy approaches named Sorting-Based Upgrading (SBU) and Greedy Attributes Upgrading (GAU). By reducing our problems to Fractional Knapsack Problem, we prove that these two greedy approaches also produce the optimal solution. The experiments are done with different numbers of our products, attributes, products to be upgraded, and the value of k. The execution time of SBU is much faster than the na?ve method and CUF. The GAU is used to reduce the number of attribute combinations. It is used with the na?ve method, CUF, and SBU. The best performance is when we do the upgrading by using SBU with GAU.
    显示于类别:[資訊工程學系] 博碩士論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML37检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.

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