Matrix manipulation and computation library
Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)
Function to sum the y values if the x values are equals. The x array has to be ordered.
Integrates y values. The x array has to be ordered and increasing.
Compute a distance/similarity matrix
Principal component analysis
Hierarchical clustering algorithms
Tanimoto similarity and distance methods
Self-organizing map (SOM) / Kohonen network
Expectation Maximization algorithm
Preprocess functions to improve the representation and quality of data