KMEANS_SEQ(1)

NAME
kmeans_seq - Binary Splitting Kmeans Clusterer for sequence data

SYNOPSIS
A program for finding cluster centers for sequence data using a Euclidian distance to assign sequence frames to centers in iterative training of the means.

kmeans_seq [ -ncenters n ] [ -ncenters_list n[,n]... ]
[ -split_percentage x ] [ -add_random_offset ]
[ -max_iteration n ] [ -stop_percentage x ]
[ -reduce_step n ] [ -sequence_options ]

EXAMPLE
kmeans_seq -pathdata $LNKHOME/data/seq \
-finput gender.train -fdescribe gender.defaults -ncenters 32

DESCRIPTION
This kmeans mapping program works in the same way as the kmeans program for classification data. The only differences are that this program expects to be given mapping data and that this clusterer cannot do clustering by class.

OPTIONS
The algorithm specific options are those available for the program kmeans.

-sequence_options
    kmeans_seq accepts the general sequence classifier arguments described on the sequence(1) manual page rather than the classifier options used by kmeans.

REFERENCE
Richard O. Duda and Peter E. Hart, Pattern Classification and Scene Analysis, John Wiley & Sons, New York, 1973. Pages 225-228.

SEE ALSO
sequence(1), kmeans(1)

HISTORY
First written 5 November 1992 by Linda Kukolich

BUGS
Send bug reports to Linda Kukolich (kukolich@sst.ll.mit.edu)