15.12.2012 Views

scipy tutorial - Baustatik-Info-Server

scipy tutorial - Baustatik-Info-Server

scipy tutorial - Baustatik-Info-Server

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Parameters<br />

X<br />

SciPy Reference Guide, Release 0.8.dev<br />

[ndarray] An m by n array of m original observations in an n-dimensional space.<br />

metric<br />

[string or function] The distance metric to use. The distance function can be ‘braycurtis’,<br />

‘canberra’, ‘chebyshev’, ‘cityblock’, ‘correlation’, ‘cosine’, ‘dice’, ‘euclidean’, ‘hamming’,<br />

‘jaccard’, ‘kulsinski’, ‘mahalanobis’, ‘matching’, ‘minkowski’, ‘rogerstanimoto’,<br />

‘russellrao’, ‘seuclidean’, ‘sokalmichener’, ‘sokalsneath’, ‘sqeuclidean’, ‘yule’.<br />

w<br />

p<br />

V<br />

VI<br />

Returns<br />

Y<br />

Seealso<br />

[ndarray] The weight vector (for weighted Minkowski).<br />

[double] The p-norm to apply (for Minkowski, weighted and unweighted)<br />

[ndarray] The variance vector (for standardized Euclidean).<br />

[ndarray] The inverse of the covariance matrix (for Mahalanobis).<br />

[ndarray] A condensed distance matrix.<br />

squareform<br />

[converts between condensed distance matrices and] square distance matrices.<br />

rogerstanimoto(u, v)<br />

Computes the Rogers-Tanimoto dissimilarity between two boolean n-vectors u and v, which is defined as<br />

R<br />

cT T + cF F + R<br />

where cij is the number of occurrences of u[k] = i and v[k] = j for k < n and R = 2(cT F + cF T ).<br />

Parameters<br />

u<br />

v<br />

Returns<br />

d<br />

[ndarray] An n-dimensional vector.<br />

[ndarray] An n-dimensional vector.<br />

[double] The Rogers-Tanimoto dissimilarity between vectors u and v.<br />

3.16. Spatial algorithms and data structures (<strong>scipy</strong>.spatial) 413

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!