The PSP approach for mining sequential patterns
Lecture notes in computer sciencePublished 1 January 1998
Florent Masséglia, F. Cathala, Pascal Poncelet
Citations240
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents an approach, called PSP, for mining sequential patterns embedded in a database that resumes the general principles of GSP but makes use of a different intermediary data structure which is proved to be more efficient than in GSP.
Abstract
In this paper, we present an approach, called PSP, for mining sequential patterns embedded in a database. Close to the problem of discovering association rules, mining sequential patterns requires handling time constraints. Originally introduced in [3], the issue is addressed by the GSP approach [10]. Our proposal resumes the general principles of GSP but it makes use of a different intermediary data structure which is proved to be more efficient than in GSP.
Keywords
Computer Science
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Mining sequential patterns
5,115 Citations2002R. K. Agrawal, Ramakrishnan Srikant
Three algorithms are presented to solve the problem of mining sequential patterns over databases of customer transactions, and empirically evaluating their performance using synthetic data shows that two of them have comparable performance.
IEEE ExpertData mining and knowledge discovery: making sense out of data
4,643 Citations1996U.M. Feyyad
Find loads of the data mining and knowledge discovery making sense out of data book catalogues in this site as the choice of you visiting this page.
Lecture notes in computer scienceMining sequential patterns: Generalizations and performance improvements
2,686 Citations1996Ramakrishnan Srikant, Rakesh Agrawal
This work adds time constraints that specify a minimum and/or maximum time period between adjacent elements in a pattern, and relax the restriction that the items in an element of a sequential pattern must come from the same transaction.
Dynamic itemset counting and implication rules for market basket data
1,954 Citations1997Sergey Brin, Rajeev Motwani +2 more
A new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling and a new way of generating “implication rules” which are normalized based on both the antecedent and the consequent.
An Efficient Algorithm for Mining Association Rules in Large Databases
1,598 Citations1995Ashoka Savasere, Edward Omiecinski +1 more
This paper presents an efficient algorithm for mining association rules that is fundamentally different from known algorithms and not only reduces the I/O overhead significantly but also has lower CPU overhead for most cases.
Data Mining and Knowledge DiscoveryDiscovery of Frequent Episodes in Event Sequences
1,445 Citations1997Heikki Mannila, Hannu Toivonen +1 more
This work gives efficient algorithms for the discovery of all frequent episodes from a given class of episodes, and presents detailed experimental results that are in use in telecommunication alarm management.
Sampling Large Databases for Association Rules
1,079 Citations1996Hannu Toivonen
New algorithms that reduce the database activity considerably by picking a Random sample, to find using this sample all association rules that probably hold in the whole database, and then to verify the results with the rest of the database.
Lecture notes in computer scienceAdvances in Knowledge Discovery and Data Mining
436 Citations2004Honghua Dai, Ramakrishnan Srikant
The next chapter focuses on the mining of Evolving Data Streams with Privacy Preservation and the application of Emerging Patterns for Improving the Quality of Rare-Class Classification.
University Libraries (University of Maryland)Fast sequential and parallel algorithms for association rule mining: a comparison
121 Citations1995Andreas Mueller
The performance results show that, while both algorithms parallelize easily and obtain good speedup and scale-up results, the parallel SEAR version performs better than parallel SPEAR, despite the fact that it uses more communication.