English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6480/11652
Visitors : 20232335      Online Users : 312
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/15882

Title: Discovering Generalized Profile-Association Rules for the Targeted Advertising of New Products
Authors: Hwang, San-Yih;Yang, Wan-Shiou
Contributors: 資訊管理學系
Keywords: Data mining;Profile-association rules;Generalized profile-association rules;Fractional 0–1 knapsack problem;Greedy algorithms;Targeted advertising;Recommender systems
Date: 2008
Issue Date: 2013-03-27T06:47:52Z
Publisher: INFORMS
Abstract: We propose a data-mining approach for the targeted marketing of new products that have never been rated or purchased by customers. This approach uncovers associations between customer types and product genres that frequently occurred in previous transaction records. Customer types are defined in terms of demographic attribute values that can be aggregated through concept hierarchies; product types can be generalized through product taxonomies. We use generalized profile-association rules (GP association rules) to identify the advertising targets for a given new product. In addition, we propose two algorithms—GP-Apriori and Merge-prune—to mine GP association rules and develop a value-based targeted advertising algorithm to select prospective customers of a new product on the basis of the discovered rules. We evaluate the proposed approach using both synthetic data and library-circulation data.
Relation: INFORMS Journal on Computing, 20(1): 34-45
Appears in Collections:[資訊管理學系所] 期刊論文

Files in This Item:

File SizeFormat
2060300810002.pdf25KbAdobe PDF353View/Open


All items in NCUEIR are protected by copyright, with all rights reserved.

 


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