# Mining Frequent Sequential Generator Patterns Using the FEAT Algorithm (SPMF documentation)

This example explains how to run the FEAT algorithm using the SPMF open-source data mining library.

## How to run this example?

• If you are using the graphical interface, (1) choose the "FEAT" algorithm, (2) select the input file "contextPrefixSpan.txt", (3) set the output file name (e.g. "output.txt") (4) set minsup = 50% and (5) click "Run algorithm".
• If you want to execute this example from the command line, then execute this command:
java -jar spmf.jar run FEAT contextPrefixSpan.txt output.txt 50% in a folder containing spmf.jar and the example input file contextPrefixSpan.txt.
• If you are using the source code version of SPMF, launch the file "MainTestFEAT_saveToFile.java" in the package ca.pfv.SPMF.tests.

## What is FEAT?

FEAT is an algorithm for discovering sequential generator patterns in sequence databases, proposed by Gao et al.(2008).

## What is the input of FEAT?

The input is a sequence database and a user-specified threshold named minsup (a value in [0,1] representing a percentage).

A sequence database is a set of sequences where each sequence is a list of itemsets. An itemset is an unordered set of items. For example, the table shown below contains four sequences. The first sequence, named S1, contains 5 itemsets. It means that item 1 was followed by items 1 2 and 3 at the same time, which were followed by 1 and 3, followed by 4, and followed by 3 and 6. It is assumed that items in an itemset are sorted in lexicographical order. This database is provided in the file "contextPrefixSpan.txt" of the SPMF distribution. Note that it is assumed that no items appear twice in the same itemset and that items in an itemset are lexically ordered.

 ID Sequences S1 (1), (1 2 3), (1 3), (4), (3 6) S2 (1 4), (3), (2 3), (1 5) S3 (5 6), (1 2), (4 6), (3), (2) S4 (5), (7), (1 6), (3), (2), (3)

## What is the output of FEAT?

The algorithm discovers all frequent sequential generator patterns that occurs in a sequence database.

To explain more formally what is a sequential generator pattern, it is necessary to review some definition.

A sequential pattern is a sequence. A sequence SA = X1, X2, ... Xk, where X1, X2... Xk are itemsets is said to occur in another sequence SB = Y1, Y2, ... Ym, where Y1, Y2... Ym are itemsets, if and only if there exists integers 1 <= i1 < i2... < ik <= m such that X1 ⊆ Yi1, X2 ⊆ Yi2, ... Xk ⊆ Yik.

The support of a sequential pattern is the number of sequences where the pattern occurs divided by the total number of sequences in the database.

A frequent sequential pattern is a sequential pattern having a support no less than the minsup parameter provided by the user.

A sequential generator pattern is a sequential pattern SA such that there does not exists a smaller pattern SB having the same support and such that SB occurs in SA.

Why using FEAT? It can be shown that the set of sequential generator patterns is generally much smaller than the set of all sequential patterns. Moreover, sequential generator patterns are minimal patterns. In some cases, it is interesting to discover minimal patterns. For example, generator patterns could be used to generate sequential rules with a minimal antecedent.

For example, if we run FEAT with minsup= 50 % on the sequence database, 24 patterns are found.

 ID Sequential Generator Pattern Support S1 empty sequence 100 % S2 (4) 75 % S3 (6) 75 % S4 (5) 75 % S5 (1), (1) 50 % S6 (2), (1) 50 % S7 (2, 3) 50 % S8 (3), (1) 50 % S9 (1,4) 50 % S10 (1), (6) 50 % S11 (1,2) 50% S12 (2), (4) 50% S13 (2), (6) 50% S14 (4), (2) 50% ... ... ... S24 (1), (2), (3) 50%

For instance, the sequential pattern "(1),(2),(3)" appears in the first and fourth sequence (it has therefore a support of 50%).

## Optional parameters

The algorithm implementation allows to specify additional optional parameter(s) :

• "maximum pattern length" allows to specify the maximum number of items that patterns found should contain.
• "show sequences ids?" (true/false) This parameter allows to specify that sequence ids of sequences containing a pattern should be output for each pattern found. For example, if the parameter is set to true, each pattern in the output file will be followed by the keyword #SID followed by a list of sequences ids (integers separated by space). For example, a line terminated by "#SID: 0 2" means that the pattern on this line appears in the first and the third sequences of the sequence database.

These parameters are available in the GUI of SPMF and also in the example "MainTestFEAT ....java" provided in the source code of SPMF.

If you want to use these optional parameters in the command line, it can be done as follows. Consider the command:
java -jar spmf.jar run FEAT contextPrefixSpan.txt output.txt 50% 6 true
It means that the user want to apply the algorithm on the file "contextPrefixSpan.txt" and output the results to "output.txt". Moreover, the user wants to find patterns with a support of at least 50 % having a maximum length of 6 items. Moreover, sequence ids should be output for each pattern found.

## Input file format

The input file format is defined as follows. It is a text file where each line represents a sequence from a sequence database. Each item from a sequence is a postive integer and items from the same itemset within a sequence are separated by single space. Note that it is assumed that items within a same itemset are sorted according to a total order and that no item can appear twice in the same itemset. The value "-1" indicates the end of an itemset. The value "-2" indicates the end of a sequence (it appears at the end of each line). For example, the input file "contextPrefixSpan.txt" contains the following four lines (four sequences).

1 -1 1 2 3 -1 1 3 -1 4 -1 3 6 -1 -2
1 4 -1 3 -1 2 3 -1 1 5 -1 -2
5 6 -1 1 2 -1 4 6 -1 3 -1 2 -1 -2
5 -1 7 -1 1 6 -1 3 -1 2 -1 3 -1 -2

The first line represents a sequence where the itemset {1} is followed by the itemset {1, 2, 3}, followed by the itemset {1, 3}, followed by the itemset {4}, followed by the itemset {3, 6}. The next lines follow the same format.

Note that it is also possible to use a text file containing a text (several sentences) if the text file has the ".text" extension, as an alternative to the default input format. If the algorithm is applied on a text file from the graphical interface or command line interface, the text file will be automatically converted to the SPMF format, by dividing the text into sentences separated by ".", "?" and "!", where each word is considered as an item. Note that when a text file is used as input of a data mining algorithm, the performance will be slightly less than if the native SPMF file format is used because a conversion of the input file will be automatically performed before launching the algorithm and the result will also have to be converted. This cost however should be small.

## Output file format

The output file format is defined as follows. It is a text file. Each line is a frequent sequential pattern. Each item from a sequential pattern is a postive integer and items from the same itemset within a sequence are separated by single spaces. The value "-1" indicates the end of an itemset. On each line, the sequential pattern is first indicated. Then, the keyword " #SUP: " appears followed by an integer indicating the support of the pattern as a number of sequences. For example, a few lines from the output file from the previous example are shown below:

6 -1 3 -1 SUP: 2
3 -1 2 -1 SUP: 3
1 -1 2 -1 3 -1 SUP: 2

The third line indicates that the frequent sequential pattern consisting of the itemset {1}, followed by the itemset {2}, followed by the itemset {3} has a support of 2 sequences. The other lines follow the same format.

## Optional feature: giving names to items

Some users have requested the feature of given names to items instead of using numbers. This feature is offered in the user interface of SPMF and in the command line of SPMF. To use this feature, your file must include @CONVERTED_FROM_TEXT as first line and then several lines to define the names of items in your file. For example, consider the example database "contextPrefixSpan.txt". Here we have modified the file to give names to the items:

@CONVERTED_FROM_TEXT
@ITEM=1=apple
@ITEM=2=orange
@ITEM=3=tomato
@ITEM=4=milk
@ITEM=6=noodle
@ITEM=7=rice
@ITEM=-1=|
1 -1 1 2 3 -1 1 3 -1 4 -1 3 6 -1 -2
1 4 -1 3 -1 2 3 -1 1 5 -1 -2
5 6 -1 1 2 -1 4 6 -1 3 -1 2 -1 -2
5 -1 7 -1 1 6 -1 3 -1 2 -1 3 -1 -2

In this file, the first line indicates, that it is a file where names are given to items. Then, the second line indicates that the item 1 is called "apple". The third line indicates that the item 2 is called "orange". The 9th line indicates that the symbol "-1" must be replaced by "|". Then the following lines define four sequences in the SPMF format.

Then, if we apply a sequential pattern mining algorithm using this file using the user interface of SPMF or the command line, the output file contains several patterns having this format:

apple | #SUP: 4
orange | #SUP: 4
tomato | #SUP: 4
apple | orange | #SUP: 4

Note that this feature could be also used from the source code of SPMF using the ResultConverter class. However, there is currently no example provided.

## Performance

FEAT is one of the first algorithms for mining sequential generator patterns. The VGEN algorithm is usually much faster.

## Implementation details

Note that there is a test file in the SPMF distribution to run the FEAT algorithm and keep the result into memory and print the results to the console, instead of saving it to a file (MainTestFEAT_saveToMemory.java).