Module: DiagEM | compClust/mlx/wrapper/DiagEM.py | |||||||
---|---|---|---|---|---|---|---|---|
Usage: DiagEM.py parameter_filename input_filename output_filenameWrapper for diagonal em algorithm Depends on the following environment variables: DIAGEM_COMMAND (e.g., /proj/cluster_gazing2/bin/diagem) Brief Algorithm Description:Performs EM segmentation of an array of feature vectors. The algorithm is from Bishop's "Neural Networks for Pattern Recognition", page 65. This particular EM algorithm fits Gaussians to the data. Each element of the feature vector is assumed to be independent (i.e. independent channels). Required Parameters: (note: the list enclosed in the brakets are possible values each one of parameters can take ) k = <x>x is the number of clusters to find num_iterations = <x>Where x is the number of iteration to perform over the data set distance_metric = [correlation, correlation_centered, euclidean]The correlation metric is actually Euclidean distance on the data set mapped to the surface of a hypersphere. This approximates the correlation metric. init_method = [church_means, random_means, random_point, random_range, random_sample, file] Optional / Dependent Parameters: k_strict = [
|
Imported modules | ||
---|---|---|
import Numeric from compClust.mlx import ML_Algorithm from compClust.mlx.datasets import Dataset from compClust.mlx.labelings import Labeling from compClust.mlx.models import MixtureOfDiagonalGaussians import compClust.mlx.wrapper from compClust.util import Verify, Usage, WrapperUtil from compClust.util.TimeStampedPrintStream import TimeStampedPrintStream import os import re import string import sys import tempfile | ||
Classes | ||
|