Connection network and optimization of interest metric for one-to-one marketing
Pages 1998 - 2009
Abstract
With the explosive growth of data in electronic commerce, rule finding becomes a crucial part in marketing. In this paper, we discuss the essential limitations of the existing metrics to quantify the interests of rules, and present the need of optimizing the interest metric. We describe the construction of the connection network that represents the relationships between items and propose a natural marketing model using the network. Although simple interest metrics were used, the connection network model showed stable performance in the experiment with field data. By constructing the network based on the optimized interest metric, the performance of the model was significantly improved.
References
[1]
R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pages 207-216, 1993.
[2]
S. Brin, R. Motwani, J.D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pages 255-264, 1997.
[3]
N. Shivakumar and H. Garcia-Molina. Building a scalable and accurate copy detection mechanism. In Proc. Third Int'l Conf. Theory and Practice of Digital Libraries, 1996.
[4]
A. Broder. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences Conf. (SEQUENCES'97), pages 21-29, 1998.
[5]
R. O. Duda and P.E. Hart. Pattern Classification and Scene Analysis. Wiley InterScience, New York, 1973.
[6]
S. Guha, R. Rastogi, and K. Shim. CURE - an efficient clustering algorithm for large databases. In Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pages 73-84, 1998.
[7]
D. Greening. Building Consumer Trust with Accurate Product Recommendations. LikeMinds White Paper LMWSWP-210-6966, 1997.
[8]
C.C. Aggarwal, J.L. Wolf, K. Wu, and P.S. Yu. Horting hatches an egg: A new graph-theoretic approach to collaborative filtering. In Proc. of the fifth ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pages 201-212, 1999.
[9]
D. Goldberg, D. Nichols, B.M. Oki, and D. Terry. Using collaborative filtering to weave an information tapestry. Comm. of the ACM, 35(12):61-70, 1992.
[10]
J.A. Konstan et al. Grouplens: Applying collaborative filtering to usenet news. Comm. of the ACM, 40:77-87, 1997.
[11]
H.R. Varian and P. Resnick. CACM special issue on recommender systems. Comm. of the ACM, 40, 1997.
[12]
E. Cohen et al. Finding interesting associations without support pruning. IEEE Trans. on Knowledge and Data Engineering, 13(1):64-78, 2001.
[13]
C. Silverstein, S. Brin, and R. Motwani. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2:69-96, 1998.
[14]
C. Silverstein, S. Brin, R. Motwani, and J.D. Ullman. Scalable techniques for mining casual structures. In Proc. 24th Int'l Conf. Very Large Data Bases, pages 594-605, 1998.
[15]
R.J. Bayardo Jr. and R. Agrawal. Mining the most interesting rules. In Proc. of the fifth ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pages 145-154, 1999.
[16]
T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Data mining using twodimensional optimized association rules: Scheme, algorithms, and visualization. In Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pages 13-23, 1996.
[17]
G. Piatetsky-Shapiro. Discovery, Analysis, and Presentation of Strong Rules. AAAI/MIT Press, 1991. Chapter 13 of Knowledge Discovery in Databases.
[18]
S. Morishita. On classification and regression. In Proc. First Int'l Conf. on Discovery Science - Lecture Notes in Artificial Intelligence 1532, pages 40-57, 1998.
[19]
Y. Morimoto, T. Fukuda, H. Matsuzawa, T. Tokuyama, and K. Yoda. Algorithms for mining association rules for binary segmentations of huge categorical databases. In Proc. of the 24th Very Large Data Bases Conf., pages 380-391, 1998.
[20]
P. Clark and P. Boswell. Rule induction with CN2: Some recent improvements. In Machine Learning: Proc. of the Fifth European Conference, pages 151-163, 1991.
[21]
G.I. Webb. OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:431-465, 1995.
[22]
International Business Machines. IBM Intelligent Miner User's Guide, 1996. Version 1, Release 1.
[23]
V. Dhar and A. Tuzhilin. Abstract-driven pattern discovery in databases. IEEE Trans. on Knowledge and Data Engineering, 5(6), 1993.
[24]
R. Dewan, B. Jing, and A. Seidmann. One-to-one marketing on the internet. In Proc. of the 20th Int'l Conf. on Information Systems, pages 93-102, 1999.
[25]
M.S. Chen, P.S. Han, and J.Yu. Data mining: An overview from a database perspective. IEEE Trans. on Knowledge and Data Engineering, 8(6):866-883, 1996.
[26]
M. Goebel and L. Gruenwald. A survey of data mining and knowledge discovery software tools. SIGKDD Explorations, 1:20-33, 1999.
[27]
J.L. Herlocker, J.A. Konstan, A. Borchers, and J. Riedl. An algorithmic framework for performing collaborative filtering. In Proc. of the 22nd Annual Int'l ACM SIGIR Conf. on Research and Development in Information Retrieval, pages 230- 237, 1999.
[28]
V. Venugopal and W. Baets. Neural networks and their applications in marketing management. Journal of Systems Management, 45(9):16-21, 1994.
[29]
S. Park. Neural networks and customer grouping in e-commerce: A framework using fuzzy ART. In Proc. Academia/Industry Working Conf. on Research Challenges '00, pages 331-336, 2000.
[30]
Y.K. Kwon and B.R. Moon. Personalized email marketing with a genetic programming circuit model. In Genetic and Evolutionary Computation Conference, pages 1352-1358, 2001.
[31]
M.J. Culnan. "How did they get my name?": An exploratory investigation of customer attitudes toward secondary information use. MIS Quarterly, 17(3):341- 363, 1993.
[32]
J. III Hagel and J.F. Rayport. The coming battle for customer information. Havard Business Review, 75(1):53-65, 1997.
[33]
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolutionary Programs. Springer, 1992.
[34]
D. Cavicchio. Adaptive Search Using Simulated Evolution. PhD thesis, University of Michigan, Ann Arbor, MI, 1970. Unpublished.
[35]
D. Whitley and J. Kauth. Genitor: A different genetic algorithm. In Rocky Mountain Conf. on Artificial Intelligence, pages 118-130, 1988.
- Connection network and optimization of interest metric for one-to-one marketing
Recommendations
Feature-based recommendations for one-to-one marketing
Most recommendation systems face challenges from products that change with time, such as popular or seasonal products, since traditional market basket analysis or collaborative filtering analysis are unable to recommend new products to customers due to ...
Competitive One-to-One Promotions
One-to-one promotions are possible when consumers are individually addressable and firms know something about each customer's preferences. We explore the competitive effects of one-to-one promotions in a model with two competing firms where the firms ...
Dynamic Customer Management and the Value of One-to-One Marketing
The concept of one-to-one marketing is intuitively appealing, but there is little research that investigates the value of individual-level marketing relative to segment-level or mass marketing. In this paper, we investigate the financial benefits of and ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 12 July 2003
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025