期刊文献+

电信客户服务需求的关联规则挖掘 被引量:1

Association Rules Mining for the Demand of Telecommunication Customer Service
下载PDF
导出
摘要 本文对电信业务中客户服务的关联规则进行挖掘,对电信客户的服务需求进行预测。根据针对电信客户服务需求数据库的特点,我们我们对对Apriori算法的不足进行了适当改进,进行适当改进,并提出了基于表操作的数据频繁项集的方法,从而有效地挖掘电信客户的服务需求关联规则。 This essay makes researches on association rules mining for the demand of telecommunication customer service, and forecasts demand of the customers. According to the characteristics of the database of telecommunication customer service demand, we improve Apriori algorithm appropriately, and put forward the method of frequent itemset based on form operation, so as to mine the association rules of telecommunication customer service demand effectively.
作者 徐艳 陈崚
出处 《信息通信》 2008年第5期53-56,共4页 Information & Communications
基金 国家自然科学基金(60673060) 江苏省自然科学基金 南京大学软件新技术国家重点实验室开放基金
关键词 电信客户服务需求 关联规则挖掘 APRIORI算法 数据挖掘 demand of telecommunication customer service association rules mining Apriori algorithm data mining.
  • 相关文献

参考文献2

二级参考文献42

  • 1Hong Hai Do,Erhard Rahm,COMA-A System for Flexible Combination of Schema Matching Approaches, VLDB2002, Hongkong.
  • 2Heam-Geun Kang, Chin-Wan Chung, Exploiting Veasions for On-line Data Warehouse Maintenance in MOLAP Servers,VLDB2002,Hongkong.
  • 3Haixun Wang, Wei Wang, Jiong Yang philip Yu, Clustering by Pattern Similarity in Large Data Sets,Sigmod 2002, Madison,Wisconsin.
  • 4J. Naughton, D DeWitt, D. Maier and et al. The Niagara Internet Query System. 2000.
  • 5Jiong Yang, Wei Wang, Philip Yu, Jiawei Han, Mining Long Sequential Patterns in a Noisy Environment, Sigmod 2002, Madison,Wisconsin.
  • 6Lukasz Golab, M.Tamer Ozsu, Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams, VLDB 2003, Berlin.
  • 7Liang-Huai Yang, Mong Li Lee, Wynne Hsu, Efficient Mining of XML Query Patterns for Caching, VLDB 2003, Berlin.
  • 8Laks V. S. Lakshmanan, Raymond T. Ng, Chrisitne Xing Wang, Xiaodong Zhou,Theodore Johnson,The Generalized MDL Approach for Sum.marlzation, VLDB2002,Hongkong
  • 9Laks V. S. Lakshmanan, Jian Pei, Jiawei Hart, Quotient Cube: How to Summarize the Semantics of a Data Cube, VLDB2002, Hongkong.
  • 10Laks V. S. Lakshmanan, Jian Pei, Yah Zhao, QC-Trees: An Efficient Summary Structure for Semantic OLAP, Sigmod 2003, San Diego, California

共引文献33

同被引文献3

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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