readme

经典的数据关联挖掘算法prefixspan

 Usage:
     ./prefixspan [options] < data

     option: 
         -m NUM:   set minimum support        (default 1)
         -M NUM:   set minimum pattern length (default 1)
         -s:       use STRING feature (slow)
	 -d STR    use STR as delimiter between item and freq. (default "/")
         -v:       set verbose mode
	 
  
 * Format of input data:

  1 3 2 4
  3 2 4 6 
  1 3 4
 
  Each line corresponds to the each transaction.
  Each transaction has a set of items separated by single space.
  For example, first transaction has 4 items (1,3,2,4).
  Each item must be represented by positive integer.
  If you want to use any STRING as item, use -s option (it is quit slow).
  If you need not care the sequential order of items, 
  just sort items by numerical order like:

  1 2 3 5
  2 3 4 6
  1 3 4

 * Format of results:
 
  item/freq. item/freq. ...
  item/freq. item/freq. ...
  ..

  Here is an example:
  
  5/187 37613/113
  7/170 37613/134
  30/100
  74731/501 13/232 37613/108
  
  This output descirbes the following results:

   SEQUENTIAL PATTERN   : FREQUENCY
  5                     : 187 times
  5 -> 37613            : 113 times
  7                     : 170 times 
  7 -> 37613            : 113 times
  30                    : 100 times   
  74731 -> 13 -> 37613  : 108 times
  74731 -> 13           : 232 times
  74731                 : 501 times

  Each line represents the longest sequential pattern 
  whose frequency is larger than minsup (-m option).
  Note that any prefix of this pattern are also sequential pattern.
  In the case of using -M NUM option,
  Any patterns which have less than NUM items are not displayed as results.
  By using -d option, you can change the delimiter between item and freq (default is "/")