Algorithm-Cluster
view release on metacpan or search on metacpan
src/cluster.c view on Meta::CPAN
* m is the number of rows of A (and u).
*
* n is the number of columns of A (and u) and the order of v.
*
* u contains the rectangular input matrix A to be decomposed.
*
* On output:
*
* the routine returns an integer ierr equal to
* 0: to indicate a normal return,
* k: if the k-th singular value has not been determined after 30 iterations,
* -1: if memory allocation fails.
*
* w contains the n (non-negative) singular values of a (the
* diagonal elements of s). they are unordered.
* If an error exit is made, the singular values should be correct for
* indices ierr+1, ierr+2, ..., n.
*
* u contains the matrix u (orthogonal column vectors) of the decomposition.
* If an error exit is made, the columns of u corresponding to indices of
* correct singular values should be correct.
src/cluster.c view on Meta::CPAN
nxgrid (input) int
The number of grid cells horizontally in the rectangular topology of clusters.
nygrid (input) int
The number of grid cells horizontally in the rectangular topology of clusters.
inittau (input) double
The initial value of tau, representing the neighborhood function.
niter (input) int
The number of iterations to be performed.
dist (input) char
Defines which distance measure is used, as given by the table:
dist == 'e': Euclidean distance
dist == 'b': City-block distance
dist == 'c': correlation
dist == 'a': absolute value of the correlation
dist == 'u': uncentered correlation
dist == 'x': absolute uncentered correlation
dist == 's': Spearman's rank correlation
( run in 0.516 second using v1.01-cache-2.11-cpan-96521ef73a4 )