You are here

Design of Knowledge Based System for Direct Marketing

Journal Name:

Publication Year:

Abstract (2. Language): 
Since recommendation systems have been increasing gradually, it is difficult for decision makers to find the customers which interest them as well as representative lists. How to utilize meaningful information effectively to improve the service quality of recommendation system appears to be very important. The purpose of this paper is to provide recommendation system architecture to promote direct marketing services in electronic commerce. In the proposed architecture, a two-phase data mining process used by association rule and clustering methods is designed to generate a recommendation system. The process considers not only the relationship of a cluster of customers but also the associations among the information accessed. The recommendation supported by the proposed system architecture would be closely served to meet customers’ needs. This paper not only constructs a recommendation system for decision makers to search customers but takes the initiative in finding the most suitable customers for them as well. Furthermore, managers are expected to contact with core customers from a limited budget to maintain and satisfy the requirements along with promoting direct marketing
58-61

REFERENCES

References: 

[1] Agrawal, R. and Srikant, R., 1994. Fast algorithms for mining
association rules, Proceedings of the 20th VLDB Conference, Santiago,
487-99.
[2] Agrawal, R., Imielinski, T. and Swami, A., 1993. Mining association
rules between sets of items in large databases, Proceedings of the ACM
SIGMOD Conference on Management of Data, Washington, DC, 207-16.
[3] Berry, M. and Linoff, G., 1997. Data Mining Techniques for
Marketing, Sales, and Customer Support, Wiley, New York,
NY.
[4] Edelstein, H., 2000. Building Profitable Customer Relationships
with Data Mining, white paper, SPSS, Inc., Chicago, IL.
[5] Fayyad, U., Piatetsky-Shapiro, G. and Smyth, P. 1996, From Data
Mining to Knowledge Discovery in Databases, American Association
for Artificial Intelligence, Menlo Park, CA, 37-54.
[6] Fong, A.C.M., Hui, S.C. and Jha, G., 2002. Data mining for decision
support, IEEE IT Professional, 4. 2, 9-17.
[7] Heylighen, F. and Bollen, J.2002. Hebbian algorithms for a digital
library recommendation system, Proceedings of International
Conference on Parallel Processing Workshops, Vancouver, 439-44.
[8] Han, J. and Chang, K.C.-C. 2002, Data mining for web intelligence,
IEEE Computer, 35. 11. 64-70.
[9] Han, J. and Kamber, M. 2006. Data Mining: Concepts and Techniques,
San Mateo, CA.
[10] Hui, S.C. and Jha, G. 2000. Data mining for customer service support,
Information and Management, 38. 1, 1-13.
[11] Leguizamon, G. and Michalewicz, Z. 1999, A new version of ant system
for subset problems, Proceedings of the Congress on Evolutionary
Computation, Washington, DC, 1459-64.
[12] Mitra, S., Pal, S.K. and Mitra, P. 2002. Data mining in soft computing
framework: a survey, IEEE Transactions on Neural Networks, 13. 1, 3-14.

Thank you for copying data from http://www.arastirmax.com