臺灣博碩士論文加值系統

For superior decision making, the mining of interesting patterns and rules becomes one of the most indispensible tasks in today’s business environment. Although there have been many successful customer relationship management (CRM) applications based on sequential pattern mining techniques, they basically assume that the importance of each customer are the same. Many studies in CRM show that not all customers have the same contribution to business, and, to maximize business profit, it is necessary to evaluate customer value before the design of effective marketing strategies. In this study, we include the concepts of RFM analysis into sequential pattern mining process. For a given subsequence, each customer sequence contributes its own recency, frequency, and monetary scores to represent customer importance. An efficient algorithm is developed to discover sequential patterns with high recency, frequency, and monetary scores. Empirical results show that the proposed method is more advantageous than conventional sequential pattern mining.

1 Introduction
2 Related Work
2.1 Customer relationship management using sequential pattern mining
2.2 Elicitation of sequential patterns with constraints
3 Problem Definition
4 The RFM-PostfixSpan Algorithm
4.1 Find 1-length RF sequential patterns
4.2 Divide and search
4.3 Find subsets of sequential pattern
5 Experiment Evaluation
6 Conclusion
7 Reference

[1]M. S. Chen, J. Han, and P. S. Yu, “Data Mining: an Overview from A Database Perspective,” IEEE Transaction on Knowledge and Data Engineering, vol. 8, pp. 866-886, 1996.
[2]Y.L. Chen and T.C. Huang, “Discovering Fuzzy Time-interval Sequential Patterns in Sequence Databases,” in IEEE Trans. on Systems, Man, and Cybernetics, vol. 35, no. 5, pp.959-972, 2005.
[3]W. J. Frawley G. Piatetsky-Shapiro and C. J. Matheus, "Knowledge Discovery in Databases: An Overview," Knowledge Discovery in Databases, G. Piatetsky-Shapiro and W .J. Frawley, eds., pp. 1-27. AAAI/MIT Press, 1991.
[4]J. W. Han and M. Kamber, “Data Mining: Concepts and Techniques,” Academic Press, New York, 2001.
[5]R. Agrawal and R. Srikant, “Mining Sequential Patterns,” In Proc. of Int. Conj. Data Engineering, pp. 3-14, 1995.
[6]E. Chen, H. Cao, Q. Li, and T. Qian, “Efficient Strategies for Tough Aggregate Constraint-based Sequential Pattern Mining,” Information Science, vol. 178, pp. 1498-1518, 2008.
[7]D. A. Chiang, C.T. Wang, S. P. Chen, and C. C. Chen, “The Cyclic Model Analysis on Sequential Patterns,” IEEE transactions on knowledge and data engineering, vol. 21, no. 11, 2009.
[8]T. Denoeux , “A K-nearest neighbor classification rule based on Dempster–Shafer theory,” IEEE Transactions on Systems, Man and Cybernetics, vol. 25, no. 5, pp. 804-813 ,1995.
[9]M. N. Garofalakis, R. Rastogi, and K. Shim, “SPIRIT: Sequential Pattern Mining with Regular Expression Constraints,” in: The VLDB Journal, Edinburgh, Scotland, pp. 223-234, 1999.
[10]B. Liu, W. Hsu, S. Chen and Y. Ma, “Analyzing the subjective interestingness of association rules,” IEEE Intelligent Systems, vol. 15, no. 5, pp. 47-55, 2000.
[11]Y. L. Chen, M. C. Chiang, and M. T. Ko, “Discovering Time-interval Sequential Patterns in Sequence Databases,” Expert Systems with Applications, vol. 25, pp. 343-354, 2003.
[12]C. L. Huang and W. L. Huang, “Handling sequential pattern decay: Developing a two-stage collaborative recommender system,” Electronic Commerce Research and Applications, vol. 8, no. 3, 2010.
[13]F. R. Lin, K. J. Huang, and N. S. Chen, “Integrating Information Retrieval and Data Mining to Discover Project Team Coordination Patterns,” Decision Support Systems, vol. 42, no. 2, pp. 745-758, November 2006.
[14]H. Mannila, H. Toivonen, and A. I. Verkamo, “Discovery of Frequent Episodes in Event Sequences,” Data Mining and Knowledge Discovering, vol. 1, pp. 259-289, 1997.
[15]M. J. Zaki, “Sequence Mining in Categorical Domains: Incorporating Efficient Algorithms for Mining Sequential Patterns with Time Constraints,” in Proceedings of the 9th International Conference on Information and Knowledge Management, McLean, Virginia, USA, pp. 422-429, 2000.
[16]R. Cooley, B. Mobasher, and J. Srivastava, “Data Preparation for Mining World Wide Web Browsing Patterns,” In Journal of Knowledge & Information Systems, vol. 1, no. 1, 1999.
[17]M. Ester, “A Top-down Method for Mining Most Specific Frequent Patterns in Biological Sequence Data,” in: Proc. the fourth SIAM International Conference on Data Mining, pp.90-104, 2004.
[18]C.A. Kulikowski, “Pattern Recognition Approach to Medical Diagnosis,” IEEE Trans Syst Man Cybern, vol.6, pp. 173-178, 1970.
[19]S. Vijayalakshmi, V. Mohan, and S.Suresh Raja, “Mining Constraint-based Multidimensional Frequent Sequential Pattern in Web Logs,” European Journal of Scientific Research, vol. 36, no.3, pp. 480-490, 2009.
[20]K. Wang, Y. Xu, and J.X. Yu, “Scalable Sequential Pattern Mining for Biological Sequences,” in: Proc. the Sixth ACM SIGKDD International Conference on Knowledge Management, pp.178-187, 2004.
[21]M. Eirinaki and M. Vazirgiannis, “Web Mining for Web Personalization,” ACM Transactions on Internet Technology (TOIT), vol. 3, no. 1, pp.1-27, 2003.
[22]D.R. Liu and Y.Y. Shih, “Integrating AHP and Data Mining for Product Recommendation Based on Customer Lifetime Value,” Information and Management, vol. 42, iss.3, pp. 387-400, 2005.
[23]D.R. Liu and Y.Y. Shih, “Hybrid Approaches to Product Recommendation Based on Customer Lifetime Value and Purchase Preferences,” The Journal of Systems & Software, vol. 77, iss. 2, pp. 181–191, 2005.
[24]S. Gupta, D. Hanssens, B. Hardie, W. Kah, V. Kumar and N. Lin, “Modelling Customer Life-Time Value,” Journal of Service Research, vol. 9, iss. 2, pp. 139-155, 2006.
[25]Y. L. Chen and Y. H. Hu, “Constraint-based Sequential Pattern Mining: The Consideration of Recency and Compactness,” Decision Support Systems, vol. 42, no. 2, pp.1023-1215, 2006.
[26]Y. L. Chen, M. H. Kuo, S. Y. Wu, and K. Tang, “Discovering Recency, Frequency, and Monetary (RFM) Sequential Patterns from Customer’s Purchasing Data,” Electronic Commerce Research and Application, vol. 8, pp. 241-251, 2009.
[27]C. H. Cheng and Y. S. Chen, “Classifying The Segmentation of Customer Value via RFM Model and RS Theory,” Expert Systems with Applications, vol. 36, pp.4176-4184, 2009.
[28]D.R. Liu, C.H. Lai, and W.J. Lee, “A Hybrid of Sequential Rules and Collaborative Filtering for Product Recommendation,” Information Sciences, vol. 179, pp. 3505-3519, 2009.
[29]C.H. Cheng and Y.S. Chen, “Classifying the segmentation of customer value via RFM model and RS theory,” Expert systems with Applications, pp. 4176-4184, 2009.
[30]J.T. Wei, S.Y. Lin and H.H. Wu, “A review of the application of RFM model,” African journal of business management, vol. 4, iss. 19, pp. 4199-4206, 2010.
[31]A.M. Hughes, “Boosting response with RFM,” American Demographics, pp. 4-9, 1996.
[32]I.C. Yeh, K.J. Yang and T.M. Ting, “Knowledge discovering on RFM model using Bernoulli sequence,” Expert System with Applications, vol. 36, pp. 5866-5871, 2009.
[33]S.C. Huang, E.C. Chang and H.H. Wu, “A case study of applying data mining techniques in an outfitter’s customer value analysis,” Expert System Application, vol. 36, pp. 5909-5915, 2009.
[34]A. M. Hughes, “Strategic database marketing,” Probus Publishing Company, 1994.
[35]John R. Miglautsch, “Application of RFM Principles: What to Do with 1-1-1 Customers?” Journal of Database Marketing, vol. 9, no. 4, pp. 319-324, 2002.
[36]H. Mannila, “Database Methods for Data Mining,” In ACM SIGKDD Conference on Knowledge Discovery & Data Mining, New York, USA, 1998.
[37]M.J. Shaw, C. Subramaniam, G.W. Tan and M.E. Welge, “Knowledge Management and Data Mining for Marketing,” Decision Support Systems, vol. 31, iss. 1, pp. 127-137, 2001.
[38]B. Stone, “Successful Direct Marketing Methods,” 4ed.: NTC Business Books, 1989.
[39]J. Pei, J. Han, B. Mortazavi-Asl and H. Zhu, ”Mining access patterns efficiently from web logs”, In: Proceeding of the 2000 Pacific-Asia conference on knowledge discovery and data mining(PAKDD’00), Kyoto, Japan, pp. 396-407, 2000.
[40]R. Srikant and Y. Yang, “Mining Web Logs to Improve Website Organization,” In Proceedings of the 10th International World Wide Web Conference, Hong Kong, pp. 430-437, 2001.
[41]Y.H. Tao, T.P. Hong and Y.M. Su, “Web Usage Mining with Intentional Browsing Data,” Expert Systems with Applications, vol. 34, iss. 3, pp. 1893-1904, 2008.
[42]J. Tsai, S. Egelman, L. Cranor and A. Acquisti, “The Effect of Online Privacy Information on Purchasing Behavior: An Experimental Study,” The 6th Workshop on the Economics of Information Security (WEIS), 2007.
[43]E.C. Chang, S.C. Huang and H.H. Wu, “Using K-means method and spectral clustering technique in an outfitter’s value analysis,” Qual Quant., vol. 44, iss. 4, pp. 807-815, 2010.
[44]F. Newell, “The New Rules of Marketing: How to Use One-to-one Relationship Marketing to Be The Leader in Your Industry,” New York: McGraw-Hills Companies Inc, 1997.
[45]J. Wu and Z. Lin, “Research on Customer Segmentation Model by Clustering,” ACM International Conference Proceeding Series, pp. 113, 2005.
[46]R.U. Kiran and P.K. Reddy, “An Improved Multiple Minimum Support Based Approach to Mine Rare Association Rules,” In IEEE Symposium on Computational Intelligence and Data Mining, Nashville, TN, USA, pp. 340-347, 2009.
[47]J. Pei, J. Han and W. Wang, “ Mining Sequential Patterns with Constraints in Large Databases,” In Proceedings of the 11th International Conference on Information and Knowledge Management, pp. 18-25, 2002.
[48]M. Seno and G. Karypis, “Finding Frequent Patterns Using Length-decreasing Support Constraints,” Data Mining and Knowledge Discovery, vol. 10, iss. 3, pp. 197-228, 2005.
[49]U. Yun, “An Efficient Mining of Weighted Frequent Patterns with Length Decreasing Support Constraints,” Knowledge-Based Systems, vol. 21, iss. 8, pp. 741-752, 2008.
[50]R. Srikant and R. Agrawal, “Mining Sequential Patterns: Generalizations and Performance Improvements,” In Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology, pp. 3-17, 1996.
[51]R.T. Ng, L.V.S. Lakshmanan, J. Han and A. Pang, ”Exploratory mining and pruning optimizations of constrained associations rules,” In Proceedings ACM SIGMOD International Conference on Management of Data, vol. 27, iss. 2, pp. 13-24, 1998.
[52]F. Bonchi and C. Lucchese, “Extending the state-of-the-art of constraint-based pattern discovery,” Data & Knowledge Engineering, vol. 60, iss. 2, pp. 377-399, 2007.
[53]J.W. Han, L.V.S. Lakshmanan and R.T. Ng, “Constraint-Based, Multidimensional Data Mining,” Computer, vol. 32, iss. 8, pp. 46-50, 1999.