Using association rules for product assortment decisions: a case study
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
A Microeconomic View of Data Mining
Data Mining and Knowledge Discovery
Mining Multiple-Level Association Rules in Large Databases
IEEE Transactions on Knowledge and Data Engineering
Data mining of association structures to model consumer behaviour
Computational Statistics & Data Analysis - Nonlinear methods and data mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
IEEE Transactions on Knowledge and Data Engineering
A microeconomic data mining problem: customer-oriented catalog segmentation
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Decision support system induced guidance for model formulation and solution
Decision Support Systems
Customer-oriented catalog segmentation: effective solution approaches
Decision Support Systems
Using customer knowledge in designing electronic catalog
Expert Systems with Applications: An International Journal
Designing evolving user profile in e-CRM with dynamic clustering of Web documents
Data & Knowledge Engineering
On-line personalized sales promotion in electronic commerce
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Hi-index | 12.05 |
Analysis of customer interactions for electronic customer relationship management (e-CRM) can be performed by way of using data mining (DM), optimization methods, or combined approaches. The microeconomic framework for data mining addresses maximizing the overall utility of an enterprise where transaction of a customer is a function of the data available on that customer. In this paper, we investigate an alternative problem formulation for the catalog segmentation problem. Moreover, a self-adaptive genetic algorithm has been developed to solve the problem. It includes clever features to avoid getting trapped in a local optimum. The results of an extensive computational study using real and synthetic data sets show the performance of the algorithm. In comparison with classical catalog segmentation algorithms, the proposed approach achieves better performance in Fitness and CPU-time.