GSP algorithm
GSP algorithm (Generalized Sequential Pattern 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.
- Comment
- enGSP algorithm (Generalized Sequential Pattern 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.
- Has abstract
- enGSP algorithm (Generalized Sequential Pattern 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. GSP algorithm makes multiple database passes. In the first pass, all single items (1-sequences) are counted. From the frequent items, a set of candidate 2-sequences are formed, and another pass is made to identify their frequency. The frequent 2-sequences are used to generate the candidate 3-sequences, and this process is repeated until no more frequent sequences are found. There are two main steps in the algorithm. * Candidate Generation. Given the set of frequent (k-1)-frequent sequences Fk-1, the candidates for the next pass are generated by joining F(k-1) with itself. A pruning phase eliminates any sequence, at least one of whose subsequences is not frequent. * Support Counting. Normally, a hash tree–based search is employed for efficient support counting. Finally non-maximal frequent sequences are removed.
- Is primary topic of
- GSP algorithm
- Label
- enGSP algorithm
- Link from a Wikipage to an external page
- doi.org/10.1023/A:1007652502315
- www.rakesh.agrawal-family.com/papers/edbt96seq_rj.pdf
- www.philippe-fournier-viger.com/spmf/
- Link from a Wikipage to another Wikipage
- Algorithm
- Apriori algorithm
- Category:Articles with example pseudocode
- Category:Data mining algorithms
- Database
- Hash tree (persistent data structure)
- PrefixSpan
- Sequence mining
- Transaction (database)
- SameAs
- 4jcD2
- GSP algorithm
- Q5514602
- Subject
- Category:Articles with example pseudocode
- Category:Data mining algorithms
- WasDerivedFrom
- GSP algorithm?oldid=1064021860&ns=0
- WikiPageLength
- 4152
- Wikipage page ID
- 6897364
- Wikipage revision ID
- 1064021860
- WikiPageUsesTemplate
- Template:Cite book
- Template:Google books
- Template:More citations needed