Copyright © 2007-2014 Zuse Institute Berlin
Version: $Id$
Authors: Marie Hoffmann (ozymandiaz147@googlemail.com).
vector() = [number(), ...]
median/1 | Median of an unsorted non-empty list of numbers, i.e. |
vecAdd/2 | Add two vectors X,Y, i.e. |
vecSub/2 | Substract two vectors X,Y, i.e. |
vecMult/2 | Multiply vector V with a scalar S. |
vecWeightedAvg/4 | |
euclideanDistance/1 | Euclidean distance between origin and V. |
euclideanDistance/2 | Euclidean distance between two vectors. |
u/1 | Unit vector u(v) = v/||v||. |
nearestCentroid/2 | Get the nearest centroid to U from the list Centroids, including the euclidian distance. |
closestPoints/1 | Find indices of closest centroids. |
zeros_feeder/1 | |
zeros/1 | Create a list with N zeros. |
aggloClustering/2 | Get closest centroids and merge them if their distance is within Radius. |
binomial_coeff/2 | Calculates the binomial coefficient of n over k for n >= k. |
binomial_coeff_feeder/2 | |
factorial_feeder/1 | |
factorial/1 | calculates N! |
gcd/2 | Calculates the greatest common divisor of two integers. |
median(L :: vector()) -> number()
Median of an unsorted non-empty list of numbers, i.e. a vector.
Add two vectors X,Y, i.e. X + Y.
Substract two vectors X,Y, i.e. X - Y.
Multiply vector V with a scalar S.
euclideanDistance(V :: vector()) -> Distance :: float()
Euclidean distance between origin and V.
Euclidean distance between two vectors.
Unit vector u(v) = v/||v||
nearestCentroid(U :: dc_centroids:centroid(), T :: dc_centroids:centroids()) -> {Distance :: float(), NearestCentroid :: dc_centroids:centroid()} | none
Get the nearest centroid to U from the list Centroids, including the euclidian distance. The function returns 'none' if no nearest centroid can be found. Ambiguity is resolved by picking the first one of the nearest centroids.
closestPoints(Centroids :: dc_centroids:centroids()) -> {dc_centroids:centroid(), dc_centroids:centroid()} | none
Find indices of closest centroids.
zeros_feeder(N :: 0..10000) -> {0..10000}
zeros(N :: 0) -> []
Create a list with N zeros.
aggloClustering(Centroids :: dc_centroids:centroids(), Radius :: number()) -> dc_centroids:centroids()
Get closest centroids and merge them if their distance is within Radius.
binomial_coeff(N :: non_neg_integer(), K :: non_neg_integer()) -> integer()
Calculates the binomial coefficient of n over k for n >= k. see http://rosettacode.org/wiki/Evaluate_binomial_coefficients#Erlang
binomial_coeff_feeder(X :: 0..100, Y :: 0..100) -> {non_neg_integer(), non_neg_integer()}
factorial_feeder(N :: 0..20) -> {0..20}
factorial(N :: non_neg_integer()) -> pos_integer()
calculates N!
gcd(A :: non_neg_integer(), B :: non_neg_integer()) -> non_neg_integer()
Calculates the greatest common divisor of two integers.
Generated by EDoc, Sep 11 2020, 15:25:25.