Mining interval sequential patterns

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/71514

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/71514

题名:	Mining interval sequential patterns
作者:	Chiang, Rui-dong
贡献者:	淡江大學資訊工程學系
日期:	2005-01-19
上传时间:	2011-10-24 01:17:17 (UTC+8)
出版者:	Wiley Periodicals
摘要:	The main task of mining sequential patterns is to analyze the transaction database of a company in order to find out the priorities of items that most customers take when consuming. In this article, we propose a new method—the ISP Algorithm. With this method, we can find out not only the order of consumer items of each customer, but also offer the periodic interval of consumer items of each customer. Compared with other previous periodic association rules, the difference is that the period the algorithm provides is not the repeated purchases in a regular time, but the possible repurchases within a certain time frame. The algorithm utilizes the transaction time interval of individual customers and that of all the customers to find out when and who will buy goods, and what items of goods they will buy. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 359–373, 2005.
關聯:	Internal Journal of Intelligent System 20(3),　p.359-373
DOI:	10.1002/int.20070
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
Mining Interval Seqential Patterns.pdf		269Kb	Adobe PDF	24	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章