
NAME
	mseg - MultiStreamSegment: optimal segmentation using bayesian networks

USAGE
	mseg [options] [input-file]

DESCRIPTION
	mseg segments a file using a bayesian network

OPTIONS

-S s: scoring method, where: 
	s=bic:	
	s=kt:	
	
-K k: maximum number of segments. The algorithm selects the optimal number of segment from 1 to K

-Q q: 	step size for computing the score of a segment only for segment boundaries that are a multiple of Q. 
	The default value of Q is 1 and by setting |Q| > 1 one can achieve a O(1/Q^{2}) speedup of the
	segmentation algorithm

-P p: 	pseudocount for computing the BIC score (s=bic). It sets a pseudocount value for computing the likelihood of 
	a segment given a tree. The default value is 0 and p can range from 0 to 1.

-A a: alphabet size 

-I i: number of streams.

-H h: considers the first h symbols of the input file.

-V: (verbose) print trees corresponding to all segments.



INPUT FILE FORMAT
	An ASCII file, where alphabet symbols as (integer alphabet indexes from 0 to |A|-1)
	are separated with the new line (carriage return) symbol.

RESULTS
	Array containing pairs {partition point, <depth of the corresponding tree>] of the form
	I[k']:[{p1, <d1>}, {p2, <d2>},  {pk', <dk'>}], where k' is the optimal number of partition points

EXAMPLE
	mseg -S bic -K 20 -A 2 -I 3 -Q 100  y.gen


Any suggestions or bug reports are very appreciated.

Thank you,


Robert Gwadera
gwadera@cis.hut.fi 



