Splitting algorithm using total information gain for a market segmentation problem

Splitting algorithm using total information gain for a market segmentation problem

0.00 Avg rating0 Votes
Article ID: iaor19941032
Country: South Korea
Volume: 18
Issue: 2
Start Page Number: 183
End Page Number: 203
Publication Date: Aug 1993
Journal: Journal of the Korean ORMS Society
Authors: , ,
Abstract:

One of the most difficult and time-consuming stages in the development of the knowledge-based system is a knowledge acquisition. A splitting algorithm is developed to infer a rule-tree which can be converted to a rule-typed knowledge. A market segmentation may be performed in order to establish market strategy suitable to each market segment. As the sales data of a product market is probabilistic and noisy, it becomes necessary to prune the rule-tree at an acceptable level while generating a rule-tree. A splitting algorithm is developed using the pruning measure based on a total amount of information gain and the measure of existing algorithms. A user can easily adjust the size of the resulting rule-tree according to his (her) preferences and problem domains. The algorithm is applied to a market segmentation problem of a medium-large computer market. The algorithm is illustrated step by step with a sales data of a computer market and is analyzed.

Reviews

Required fields are marked *. Your email address will not be published.