Mining sequential patterns in the B2B environment

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29667

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29667

题名:	Mining sequential patterns in the B2B environment
作者:	Hu,YH;Chen,YL;Tang,K
贡献者:	資訊管理研究所
关键词:	EFFICIENT ALGORITHM;SEQUENCES;DATABASE;GROWTH;RULES
日期:	2009
上传时间:	2010-06-29 20:37:45 (UTC+8)
出版者:	中央大學
摘要:	Sequential pattern mining is a powerful data mining technique for finding time-related behaviour in sequence databases. In this paper, we focus on mining sequential patterns in the business-to-business (B2B) environment. Because customers' sequences in the B2B environment are very long, and almost all items are frequently purchased by all customers, using traditional methods may result in a large number of uninteresting and meaningless patterns and a long computational time. To solve these problems, we introduce three conditions (constraints) - compactness, repetition, and recency - and consider them jointly with frequency in selecting sequential patterns. An efficient algorithm is developed to discover frequent sequential patterns which satisfy the conditions. Empirical results show that the proposed method is computationally efficient and effective in extracting useful sequential patterns in the B2B environment.
關聯:	JOURNAL OF INFORMATION SCIENCE
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	488	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing