Mining sequential patterns in the B2B environment

NCUIR > School of Management at National Central University > Graduate Institute of Information Management > journal & Dissertation > Item 987654321/29667

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29667

Title:	Mining sequential patterns in the B2B environment
Authors:	Hu,YH;Chen,YL;Tang,K
Contributors:	資訊管理研究所
Keywords:	EFFICIENT ALGORITHM;SEQUENCES;DATABASE;GROWTH;RULES
Date:	2009
Issue Date:	2010-06-29 20:37:45 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	JOURNAL OF INFORMATION SCIENCE
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	461	View/Open

社群 sharing