Abstract
A major obstacle in data mining applications is the gap between the statistic-based pattern extraction and the value-based decision making. We present a profit mining approach to reduce this gap. In profit mining, we are given a set of past transactions and pre-selected target items, and we like to build a model for recommending target items and promotion strategies to new customers, with the goal of maximizing the net profit. We identify several issues in profit mining and propose solutions. We evaluate the effectiveness of this approach using data sets of a wide range of characteristics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large datasets. SIGMOD 1993, 207–216
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A.I. Verkamo. Fast discovery of association rules. Advances in knowledge discovery and data mining, 307–328, AAAI/MIT Press, 1996
R. Agrawal and R. Srikant. Fast algorithm for mining association rules. VLDB 1994, 487–499
T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: a case study. KDD 1999, 254–260
C.J. Clopper and E.S. Pearson. The use of confidence or Fiducial limits illustrated in the case of the binomial. Biometrika, 26:4, Dec. 1934, 404–413. Also available from http://www.jstor.org/journals/bio.html
J. Han and Y. Fu. Disco very of multiple-level association rules from large databases. VLDB 1995, 420–431
J. Kleinberg, C. Papadimitriou, and P. Raghavan. A microeconomic view of data mining. Journal of Knowledge Discovery and Data Mining, 1998, vol.2, 311–324 (also http://www.cs.berkeley.edu/christos/dm1.ps)
B. Masand and G.P. Shapiro. A comparison of approaches for maximizing business payoff of prediction models. KDD 1996, 195–201
P. Domingos. MetaCost: a general method for making classifiers cost-sensitive. KDD 1999, 155–164
J.R. Quinlan, C4.5: programs for machine learning, Morgan Kaufmann, 1993
P. Resnick and H.R. Varian, Eds. CACM special issue on recommender systems. Communications of the ACM, Vol. 40, No. 3, 56–58, 1997
R. Srikant and R. Agrawal. Mining generalized association rules. VLDB 1995, 407–419
A. Silberschatz and A. Tuzhilin. What makes patterns interresting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering, Vol. 8, No. 6, 1996
Y. Yang and J.O. Pederson. A comparative study on feature selection in text categorization. International Conference on Machine Learning 1997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, K., Zhou, S., Han, J. (2002). Profit Mining: From Patterns to Actions. In: Jensen, C.S., et al. Advances in Database Technology — EDBT 2002. EDBT 2002. Lecture Notes in Computer Science, vol 2287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45876-X_7
Download citation
DOI: https://doi.org/10.1007/3-540-45876-X_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43324-8
Online ISBN: 978-3-540-45876-0
eBook Packages: Springer Book Archive