期刊文献+

一种基于增长模式的交易序列聚类算法 被引量:1

A Clustering Algorithm for Transaction Sequences Based on Growth Patterns
下载PDF
导出
摘要 对交易序列进行各种挖掘分析能为商家制定营销策略提供量化依据.文中从销售量及变化趋势角度研究交易序列数据集的内在结构,定义了一种反映价格变化趋势的增长模式及其错位组合距离和角度向量距离两种相似性度量,在此基础上设计一个考虑时限约束的目标函数进行聚类研究.实验数据采用真实的商品交易序列集,结果表明,在时限约束的条件下,增长模式这种特征提取方式及其模式间的两种距离函数能较好地产生聚类结果,且这些聚类结果能得到较好地解释. Mining and analysis of transaction sequences provide quantifiable schemes for decision makers to generate sales strategies. By studying the structure of transaction sequence sets according to the commodity sales amount and their variation trend, a kind of growth pattern is defined which reflects the variation trend of commodity price, as well as two methods of similarity measure, shifted window combined distance and angle vector distance, are defined. Based on those definitions, a clustering research is conducted by a goal function with time constraints. The experiments are conducted on the real commodity transaction sequence datasets. The results show that, combined with the growth patterns of two functions, it produces better clustering results under the condition of the time constraint, which could be well explained in practice.
出处 《模式识别与人工智能》 EI CSCD 北大核心 2013年第5期467-473,共7页 Pattern Recognition and Artificial Intelligence
基金 上海市重点学科建设基金资助项目(No.B114)
关键词 聚类 交易序列 时限约束 增长模式 Clustering, Transaction Sequence, Time Constraint, Growth Pattern
  • 相关文献

参考文献12

  • 1Bemdt D J, Clifford J. Finding Patterns in Time Series: A Dynamic Programming Approach//Proc of the International Conference on Knowledge Discovery and Data Mining. Menlo Park, USA, 1996: 229 -248.
  • 2Sakoe H, Chiba S. Dynamic Programming Algorithm Optimization for Spoken Word Recognition. IEEE Trans on Acoustics, Speech and Signal Processing, 1978, 26( 1 ) : 43-49.
  • 3Nikolov V. Optimizations in Time Series Clustering and Prediction //Proc of the 11 th International Conference on Computer Systems and Technologies. Sofia, Bulgaria, 2010 : 528-533.
  • 4Mt~ller-Levet C S, Klawonn F, Cho K H, et al. Fuzzy Clustering of Short Time-Series and Unevenly Distributed Sampling Points//Proc of the International Symposium on Intelligent Data Analysis. Berlin, Germany, 2003:330-340.
  • 5Kumar M, Patel N R, Woo J. Clustering Seasonality Patterns in the Presence of Errors//Proc of the International Conference on Knowl- edge Discovery and Data Mining. Edmorton, Canada, 2002: 557- 563.
  • 6Xiong Yimin, Yeung D Y. Time Series Clustering with ARMA Mix- tures. Pattern Recognition, 2004, 37(8): 1675-1689.
  • 7Smyth P. Clustering Sequences with Hidden Markov Models//Proc of the Conference on Advances in Neural Information Processing Sys- tems. Cambridge, USA: MIT Press, 1997:648-654.
  • 8Li C, Biswas G. A Bayesian Approach to Temporal Data Clustering Using Hidden Markov Models// Proc of the International Confer- ence on Machine Learning. San Franciso, USA: Morgan Kaufman Publishers, 2000:543-550.
  • 9Alon J, Sclaroff, Kollios G, et al. Discovering Clusters in Motion Time-Series Data//Proc of the Computer Vision and Pattern Recog- nition. Madison, USA, 2003, I: 375-381.
  • 10Guralnik V, Karypis G. A Scalable Algorithm for Clustering Sequential Data//Proc of the IEEE Intemational Conference on Data Mining. Washington, USA, 2001:179-186.

同被引文献9

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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