NDLI: Mining non-redundant time-gap sequential patterns

Content Provider	Springer Nature Link
Author	Yen, Show Jane Lee, Yue Shi
Copyright Year	2013
Abstract	Mining sequential patterns is to discover sequential purchasing behaviors for most of the customers from a large amount of customer transactions. An example of such a pattern is that most of the customers purchased item B after purchasing item A, and then they purchased item C after using item B. The manager can use this information to promote item B and item C when a customer purchased item A and item B, respectively. However, the manager cannot know what time the customers will need these products if we only discover the sequential patterns without any extra information. In this paper, we develop a new algorithm to discover not only the sequential patterns but also the time interval between any two items in the pattern. We call this information the time-gap sequential patterns. An example of time-gap sequential pattern is that most of the customers purchased item A, and then they bought item B after m to n days, and then after p to q days, they bought item C. When a customer bought item A, the information about item B can be sent to this customer after m to n days, that is, we can provide the product information in which the customer is interested on the appropriate date.
Starting Page	727
Ending Page	738
Page Count	12
File Format	PDF
ISSN	0924669X
Journal	Applied Intelligence
Volume Number	39
Issue Number	4
e-ISSN	15737497
Language	English
Publisher	Springer US
Publisher Date	2013-02-27
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Data mining Frequent sequence Time-gap sequential pattern Transaction database Artificial Intelligence (incl. Robotics) Mechanical Engineering Manufacturing, Machines, Tools
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An efficient approach for finding weighted sequential patterns from sequence databases

An efficient algorithm for incrementally mining frequent closed itemsets

Mining sequential patterns with periodic wildcard gaps

An efficient method for mining frequent sequential patterns using multi-Core processors

Mining non-redundant sequential rules with dynamic bit vectors and pruning techniques

Mining frequent closed inter-sequence patterns efficiently using dynamic bit vectors

Mining top-k frequent patterns with combination reducing techniques

Incremental high utility pattern mining with static and dynamic databases

Stream mining on univariate uncertain data

Mining non-redundant time-gap sequential patterns

Similar Documents

An efficient approach for finding weighted sequential patterns from sequence databases

An efficient algorithm for incrementally mining frequent closed itemsets

Mining sequential patterns with periodic wildcard gaps

An efficient method for mining frequent sequential patterns using multi-Core processors

Mining non-redundant sequential rules with dynamic bit vectors and pruning techniques

Mining frequent closed inter-sequence patterns efficiently using dynamic bit vectors

Mining top-k frequent patterns with combination reducing techniques

Incremental high utility pattern mining with static and dynamic databases

Stream mining on univariate uncertain data

Mining non-redundant time-gap sequential patterns