Mining sequential patterns in the B2B environment

  • Authors:
  • Ya-Han Hu;Yen-Liang Chen;Kwei Tang

  • Affiliations:
  • Department of Information Management, National ChungCheng University, Taiwan;Department of Information Management, National CentralUniversity, Taiwan;Krannert School of Management, Purdue University, USA

  • Venue:
  • Journal of Information Science
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.