Abstract
Many different algorithms are studied on association rules in the literature of data mining. Some researchers are now focusing on the application of association rules. In this paper, we will study one of the application called Item Selection for Marketing (ISM) with cross-selling effect consideration. The problem ISM is to find a subset of items as marketing items in order to boost the sales of the store. We prove a simple version of this problem is NP-hard. We propose an algorithm to deal with this problem. Experiments are conducted to show that the algorithms are effective and efficient.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Rajagopalan, S., Srikant, R., Xu, Y.: Mining newsgroups using networks arising from social behavior. In: Proc. of WWW (2003)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of VLDB (1994)
Blischok, T.: Every transaction tells a story. Chain Store Age Executive with Shop** Center Age 71(3), 50–57 (1995)
Brijs, T., Goethals, B., Swinnen, G., Vanhoof, K., Wets, G.: A data mining framework for optimal product selection in retail supermarket data: The generalized profset model. In: Proc. of SIGKDD (2000)
Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Using association rules for product assortment decisions: A case study. In: Proc. of SIGKDD (1999)
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. of SIGKDD (2001)
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of np-completeness. Freeman, New York (1979)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of SIGMOD (2000)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proc. of SIGKDD (2003)
Kleinberg, J., Papadimitriou, C., Raghavan, P.: A microeconomic view of data mining. Knowledge Discovery and Data Mining 2(4), 254–260 (1998)
Kohavi, R., Brodley, C., Frasca, B., Mason, L., Zheng, Z.: KDDCup 2000 organizers’ report: Peeling the onion. SIGKDD Explorations 2(2), 86–98 (2000)
Mannila, H.: Methods and problems in data mining. In: Proc. of Int. Conf. on Database Theory (1997)
Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: Proc. of KDD (1994)
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proc. of SIGKDD (2002)
Taylor, B.W.: Chapter 16: Inventory management. In: Introduction to Management Science, 7th edn., Prentice-Hall, Englewood Cliffs (2001)
Wang, K., Su, M.Y.: Item selection by ”hub-authority” profit ranking. In: Proc. of SIGKDD (2002)
Wong, R.C.W., Fu, A.W.C., Wang, K.: Mpis: Maximal-profit item selection with cross-selling considerations. In: ICDM (2003)
Wu, X., Tuzhilin, A., Shavlik, J. (eds.): Third IEEE international conference on data mining. In: ICDM (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wong, R.CW., Fu, A.WC. (2004). ISM: Item Selection for Marketing with Cross-Selling Considerations. In: Dai, H., Srikant, R., Zhang, C. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2004. Lecture Notes in Computer Science(), vol 3056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24775-3_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-24775-3_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22064-0
Online ISBN: 978-3-540-24775-3
eBook Packages: Springer Book Archive