期刊文献+

基于权重的完全图聚类在企业信息系统的应用

The Application of Weighted Complete Graph Aggregation in CIS
下载PDF
导出
摘要 通过对企业信息系统中交易记录的分析,提出基于权重的完全图实现热销商品聚类的方法,充分利用商品的数量间的关系。实验表明其召回率比较高。 After the analysis of the enterprise information system's trade records, the algorithm of weighted complete graph is proposed to aggregate the hot merchandises, which makes the most use of the quantities of different goods. The experimentation implies that the recall rate is very high.
出处 《电脑与电信》 2009年第2期81-83,共3页 Computer & Telecommunication
关键词 完全图 聚类 权重 裁剪 complete graph, aggregation, weight cutting out
  • 相关文献

参考文献4

二级参考文献34

  • 1Rakesh Agrawal, Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. VLDB1994, Santiago,Chile, 1994.
  • 2Heikki Mannila, et al. Search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery,1997, 1(3): 241~258.
  • 3Jong Soo Park, et al. An effective Hash based algorithm for mining association rules. SIGMOD1995, San Jose, USA, 1995.
  • 4Sergey Brin, et al. Dynamic itemset counting and implication rules for market basket data. SIGMOD1997, Tucson, USA,1997.
  • 5Ramesh C. Agarwal, et al. Depth first generation of long patterns, KDD 2000, Boston, USA, 2000.
  • 6Ramesh C. Agarwal, et al. A tree projection algorithm for generation of frequent itemsets. J. of Parallel and Distributed Computing, 2001, 61(3): 350~371.
  • 7Jiawei Han, Jian Pei, Yiwen Yin. Mining frequent patterns without candidate generation. SIGMOD2000, Dallas, USA, 2000.
  • 8J. Pei, et al.. H-Mine: Hyper-structure mining of frequent patterns in large databases. ICDM'01, San Jose, CA, 2001.
  • 9Mike Perkowitz, Oren Etzioni. Adaptive sites: Automatically learning from user access patterns. WWW' 97, Santa Clara, 1997.
  • 10J. Pei, et al.. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. ICDE'01, Heidelberg, 2001.

共引文献47

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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