Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Click here to sign up for SAGE Journal Email Alerts today!

Sign In to gain access to subscriptions and/or personal tools.
Journal of Information Science
This Article
Right arrow Full Text (OnlineFirst PDF)
Right arrow All Versions of this Article:
0165551509103600v1
0165551509103600v2
35/6/677    most recent
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Hu, Y.-H.
Right arrow Articles by Tang, K.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

Article

Mining sequential patterns in B2B environment

Ya-Han Hu, Yen-Liang Chen*, and Kwei Tang

National Central University

* To whom correspondence should be addressed. E-mail: ylchen{at}mgt.ncu.edu.tw.


   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.

First published on May 19, 2009, doi:10.1177/0165551509103600

Journal of Information Science 2009;35:677.

A more recent version of this article appeared on December 1, 2009
This version was published on May 21, 2009


Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?