Everything about GSP algorithm
GSP algorithm is an algorithm used for sequence mining. The algorithms for solving sequence mining problems are mostly based on the apriori (level-wise) algorithm. One way to use the level-wise paradigm is to first discover all the frequent items in a level-wise fashion. It simply means counting the occurrences of all singleton elements in the database. Then, the transactions are filtered by removing the non-frequent items. At the end of this step, each transaction consists of only the frequent elements it originally contained. This modified database becomes an input to the GSP algorithm. This process requires one pass over the whole database. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: GSP algorithmA 5-minute orientation
- Read the landmark paper: GSP: an automatic programming technique with gravitational search algorithmCited 17 times
- Go sideways: Apriori algorithmA closely related topic
- Go sideways: Association rule learningA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
GSP: an automatic programming technique with gravitational search algorithm
Analysis of Sequential Book Loan Data Pattern Using Generalized Sequential Pattern (GSP) Algorithm
Near-duplicate Video Detection Algorithm Based on Global GSP Feature and Local ScSIFT Feature Fusion
An Enhanced Approach for Digital Forensics using Innovative GSP Algorithm
GSP-YOLO: An Efficient Tire Detection Algorithm for Truck Scale Scenarios
System Fault Sequence Prediction on CRH2 EMU Based on Improved GSP Algorithm
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Apriori algorithm Apriori is an algorithm for frequent item set mining and association rule learning over relational databases. It proceeds by identifying the frequent individual…
- Association rule learning Association rule learning is a rule-based machine learning method for discovering interesting relations between variables in large databases. It is intended…
- Sequential pattern mining Sequential pattern mining is a topic of data mining concerned with finding statistically relevant patterns between data examples where the values are delivered…
- Streaming algorithm In computer science, streaming algorithms process input data streams as a sequence of items, typically making just one pass (or a few passes) through the…
- Frequent subtree mining In computer science, frequent subtree mining is the problem of finding all patterns in a given database whose support (a metric related to its number of…
- MinHash In computer science and data mining, MinHash (or the min-wise independent permutations locality-sensitive hashing scheme) is a technique for quickly estimating…
- Frequent pattern discovery Frequent pattern discovery (or FP discovery, FP mining, or Frequent itemset mining) is part of knowledge discovery in databases, Massive Online Analysis…
- SUBCLU SUBCLU is an algorithm for clustering high-dimensional data by Karin Kailing, Hans-Peter Kriegel and Peer Kröger. It is a subspace clustering algorithm…