Mining interval sequential patterns

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/45504

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45504

Title:	Mining interval sequential patterns
Authors:	Chiang, Rui-dong
Contributors:	淡江大學資訊工程學系
Date:	2005-01-19
Issue Date:	2010-03-26 19:26:03 (UTC+8)
Publisher:	Wiley-Blackwell
Abstract:	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.
Relation:	International Journal of Intelligent Systems 20(3),　p.359-373
DOI:	10.1002/int.20070
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

File	Size	Format
	0Kb	Unknown	334	View/Open