期刊文献+

基于移动交易序列模式的用户行为模式增益挖掘研究

Research on user behavior pattern mining gain based on mobile transaction sequential patterns
下载PDF
导出
摘要 在移动运算环境中挖掘用户行为模式是目前数据挖掘应用领域新兴的研究热点课题,通过整合商业事务动态路径发现移动商业序列模式,即基于移动用户行为的移动交易序列信息挖掘模式。基于深度优先搜索与宽度优先策略,对单位增益(利润)与类别商品交易量进行关联挖掘,首先是基于增益模式集成挖掘高增益移动行为序列,其次是依赖频次模式挖掘解决不同类型商务模式的顾客行为序列模式,然后是在移动交易环境下验证评价算法的执行效率。提出基于移动商务行为特征数据信息构造树算法,挖掘移动商务行为数据的品类特征信息,在同类算法结果比较中较高水准地表达发掘移动序列行为模式。实验评价实施中分析用户序列商业行为与绩效比较,通过两个典型算法比较,结果表明构造树算法能在综合移动电子商业环境下发现移动商业交易框架下的用户事务行为路径及用户倾向性的交易行为,便于规划及管理现有的移动电子商务平台。 In mobile computing environments mining the user behavior patterns is emerging research hot topic in data mining applications fields,to discover mobile transaction sequence patterns by integrating the dynamic path of business affairs,namely mining mobile purchasing information of transaction sequential based on mobile user behavior.Based on Depth-First-Search and Breadth-First-Strategy association mining the unit gain(profit)and categories of commodity trading volume,the first is mining integrally high gain on mobile behavior sequence based on customer behavior,the second is solving customer behavior sequence model of different types of business model depended on the frequency mining pattern,and then verify the execution efficiency of the algorithms evaluated in mobile transaction environment.Put forward the constructed tree the mining algorithm based on the features data of mobile commerce behavior,work on category of characteristic information in mobile commerce behavior environment,and explore the expression moving sequential patterns of behavior in algorithm comparison result in a higher level.Comparative analysis of user behavior and performance evaluation sequence commercial experimental implementation,the results show that the constructed tree algorithm can fully represent the client's business behavior in the comprehensive mobile electronic business environment,the tree algorithm based on mobile user sequence pattern is more suitable for discovering user transaction behavior path under the framework of mobile business transactions and comprehensive mining user transaction behavior tendency to facilitate the planning and management of existing mobile e-commerce platform.
作者 邓立国
出处 《沈阳师范大学学报(自然科学版)》 CAS 2015年第4期533-539,共7页 Journal of Shenyang Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(61202260) 辽宁省教育厅科学研究一般项目(w2014138)
关键词 增益挖掘 移动序列模式挖掘 移动商业模式 移动序列行为模式 gain mining mining mobile sequential pattern mobile commerce mode mobile sequence patterns of behavior
  • 相关文献

参考文献10

  • 1董杰,韩敏.挖掘事务间频繁闭项集的高效率算法[J].控制与决策,2008,23(9):994-998. 被引量:3
  • 2YUN C H,CHEN MS.Mining mobile sequential patterns in a mobile commerce environment[J].IEEE Trans Syst Man Cybern,2007,37(2):278-295.
  • 3TSENG V S,WU C W,SHIE B E,et al.UP-growth:an efficient algorithm for high utility itemsets mining[C]∥Proceedings of the 16th ACM SIGKDD conference on knowledge discovery and data mining(KDD’10),2010:253-262.
  • 4YANG Jenho,CHANG Chinchen.A low computational-cost electronic payment scheme for mobile commerce with large-scale mobile users[J].Wireless Pers Commun,2012(63):83-99.
  • 5AHMED C F,TANBEER S K,JEONG B S,et al.Efficient tree structures for high utility pattern mining in incremental databases[J].IEEE Trans Knowl Data Eng,2009(12):1708-1721.
  • 6LIN Chunwei,ZHANG Binbin,GAN Wensheng,et al.Updating high-utility pattern trees with transaction modification[EB/OL].[2015-03-27].http:∥link.springer.com/article/10.1007/s11042-014-2178-9/fulltext.html.
  • 7陈耿,朱玉全,杨鹤标,陆介平,宋余庆,孙志挥.关联规则挖掘中若干关键技术的研究[J].计算机研究与发展,2005,42(10):1785-1789. 被引量:62
  • 8ACHAR A,LAXMAN S,SASTRY P S.A unified view of the apriori-based algorithms for frequent episode discovery[J].Knowl Inf Syst,2012(31):223-250.
  • 9刘君强,孙晓莹,庄越挺,潘云鹤.挖掘闭合模式的高性能算法[J].软件学报,2004,15(1):94-102. 被引量:19
  • 10AGRAWAL R,SRIKANT R.Fast algorithms for mining association rules in large databases[C]∥Proceedings of the 20th International Conference on Very Large Data Bases,1994:487-499.

二级参考文献30

  • 1陈耿,朱玉全,杨鹤标,陆介平,宋余庆,孙志挥.关联规则挖掘中若干关键技术的研究[J].计算机研究与发展,2005,42(10):1785-1789. 被引量:62
  • 2[1]Pasquier N, Bastide Y, Taouil R, Lakhal L. Discovering frequent closed itemsets for association rules. In: Beeri C, et al, eds. Proc. of the 7th Int'l. Conf. on Database Theory. Jerusalem: Springer-Verlag, 1999. 398~416.
  • 3[2]Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Beeri C, et al, eds. Proc. of the 20th Int'l. Conf. on Very Large Databases. Santiago: Morgan Kaufmann Publishers, 1994. 487~499.
  • 4[3]Pei J, Han J, Mao R. CLOSET: An efficient algorithm for mining frequent closed itemsets. In: Gunopulos D, et al, eds. Proc. of the 2000 ACM SIGMOD Int'l. Workshop on Data Mining and Knowledge Discovery. Dallas: ACM Press, 2000. 21~30.
  • 5[4]Burdick D, Calimlim M, Gehrke J. MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Georgakopoulos D, et al, eds. Proc. of the 17th Int'l. Conf. on Data Engineering. Heidelberg: IEEE Press, 2001. 443~452.
  • 6[5]Zaki MJ, Hsiao CJ. CHARM: An efficient algorithm for closed itemset mining. In: Grossman R, et al, eds. Proc. of the 2nd SIAM Int'l. Conf. on Data Mining. Arlington: SIAM, 2002. 12~28.
  • 7[6]Liu JQ, Pan YH, Wang K, Han J. Mining frequent item sets by opportunistic projection. In: Hand D, et al, eds. Proc. of the 8th ACM SIGKDD Int'l. Conf. on Knowledge Discovery and Data Mining. Alberta: ACM Press, 2002. 229~238.
  • 8[7]Srikant R. Quest synthetic data generation code. San Jose: IBM Almaden Research Center, 1994. http://www.almaden.ibm.com/ software/quest/Resources/index.shtml
  • 9[8]Blake C, Merz C. UCI Repository of machine learning. Irvine: University of California, Department of Information and Computer Science, 1998. http://www.ics.uci.edu/~mlearn/MLRepository.html
  • 10R. Agrawal, T. Imielinski, A. Swami. Mining association rules between sets of items in large databases. ACM SIGMOD Int'l Conf. Management of Data, Washington, D. C., 1993.

共引文献80

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部