1. NCCU Academic Hub
  2. Publications
  3. College of Science
  4. Periodical Articles
  5. Item

Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Determining k-Most Demanding Products with Maximum Expected Number of Total Customers
作者 陳良弼
J.L. Koh
C.Y. Lin
貢獻者 資科系
日期 2013
上傳時間 13-Nov-2014 17:23:58 (UTC+8)
摘要 In this paper, a problem of production plans, named k-most demanding products (k-MDP) discovering, is formulated. Given a set of customers demanding a certain type of products with multiple attributes, a set of existing products of the type, a set of candidate products that can be offered by a company, and a positive integer k, we want to help the company to select k products from the candidate products such that the expected number of the total customers for the k products is maximized. We show the problem is NP-hard when the number of attributes for a product is 3 or more. One greedy algorithm is proposed to find approximate solution for the problem. We also attempt to find the optimal solution of the problem by estimating the upper bound of the expected number of the total customers for a set of k candidate products for reducing the search space of the optimal solution. An exact algorithm is then provided to find the optimal solution of the problem by using this pruning strategy. The experiment results demonstrate that both the efficiency and memory requirement of the exact algorithm are comparable to those for the greedy algorithm, and the greedy algorithm is well scalable with respect to k.
關聯 IEEE Transactions on Knowledge and Data Engineering, 25(8), 1732-1747
資料類型 article
DOI http://dx.doi.org/10.1109/TKDE.2012.53
dc.contributor 資科系en_US
dc.contributor -
dc.creator (作者) 陳良弼zh_TW
dc.creator (作者) J.L. Kohen_US
dc.creator (作者) C.Y. Linen_US
dc.date (日期) 2013en_US
dc.date.accessioned 13-Nov-2014 17:23:58 (UTC+8)-
dc.date.available 13-Nov-2014 17:23:58 (UTC+8)-
dc.date.issued (上傳時間) 13-Nov-2014 17:23:58 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/71423-
dc.description.abstract (摘要) In this paper, a problem of production plans, named k-most demanding products (k-MDP) discovering, is formulated. Given a set of customers demanding a certain type of products with multiple attributes, a set of existing products of the type, a set of candidate products that can be offered by a company, and a positive integer k, we want to help the company to select k products from the candidate products such that the expected number of the total customers for the k products is maximized. We show the problem is NP-hard when the number of attributes for a product is 3 or more. One greedy algorithm is proposed to find approximate solution for the problem. We also attempt to find the optimal solution of the problem by estimating the upper bound of the expected number of the total customers for a set of k candidate products for reducing the search space of the optimal solution. An exact algorithm is then provided to find the optimal solution of the problem by using this pruning strategy. The experiment results demonstrate that both the efficiency and memory requirement of the exact algorithm are comparable to those for the greedy algorithm, and the greedy algorithm is well scalable with respect to k.en_US
dc.format.extent 128 bytes-
dc.format.mimetype text/html-
dc.language.iso en_US-
dc.relation (關聯) IEEE Transactions on Knowledge and Data Engineering, 25(8), 1732-1747en_US
dc.title (題名) Determining k-Most Demanding Products with Maximum Expected Number of Total Customersen_US
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1109/TKDE.2012.53en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1109/TKDE.2012.53en_US