What is ml-distance?
The ml-distance npm package provides a collection of functions to calculate various types of distances between vectors. It is useful for tasks in machine learning, data analysis, and other fields where measuring similarity or dissimilarity between data points is important.
What are ml-distance's main functionalities?
Euclidean Distance
Calculates the Euclidean distance between two vectors. This is the straight-line distance in Euclidean space.
const distance = require('ml-distance');
const euclidean = distance.euclidean([1, 2], [4, 6]);
console.log(euclidean); // Output: 5
Manhattan Distance
Calculates the Manhattan distance between two vectors. This is the sum of the absolute differences of their Cartesian coordinates.
const distance = require('ml-distance');
const manhattan = distance.manhattan([1, 2], [4, 6]);
console.log(manhattan); // Output: 7
Cosine Similarity
Calculates the cosine similarity between two vectors. This measures the cosine of the angle between them, which is useful for determining how similar two vectors are.
const distance = require('ml-distance');
const cosine = distance.cosine([1, 2], [4, 6]);
console.log(cosine); // Output: 0.9838699100999074
Jaccard Index
Calculates the Jaccard index between two sets. This is the size of the intersection divided by the size of the union of the sets.
const distance = require('ml-distance');
const jaccard = distance.jaccard([1, 2, 3], [2, 3, 4]);
console.log(jaccard); // Output: 0.5
Other packages similar to ml-distance
compute-distance
The compute-distance package provides a variety of distance metrics similar to ml-distance, including Euclidean, Manhattan, and Chebyshev distances. It is a good alternative for users looking for a different implementation or additional distance metrics.
ml-matrix
The ml-matrix package offers a comprehensive set of matrix operations, including distance calculations. It is more feature-rich compared to ml-distance, providing additional functionalities for matrix manipulation and linear algebra.
distance
The distance package focuses on string distance metrics like Levenshtein, Jaro-Winkler, and Hamming distances. While it overlaps with ml-distance in some areas, it is more specialized in string comparison.
ml-distance
Distance functions to compare vectors
Installation
$ npm install ml-distance
Methods
Distances
Returns the euclidean distance between vectors p and q
Returns the city block distance between vectors p and q
Returns the Minkowski distance between vectors p and q for order d
Returns the Chebyshev distance between vectors p and q
Returns the Sørensen distance between vectors p and q
Returns the Gower distance between vectors p and q
Returns the Soergel distance between vectors p and q
Returns the Kulczynski distance between vectors p and q
Returns the Canberra distance between vectors p and q
Returns the Lorentzian distance between vectors p and q
Returns the Intersection distance between vectors p and q
Returns the Wave Hedges distance between vectors p and q
Returns the Czekanowski distance between vectors p and q
Returns the Motyka distance between vectors p and q
Returns the Ruzicka similarity between vectors p and q
tanimoto(p, q, [bitVector])
Returns the Tanimoto distance between vectors p and q, and accepts the bitVector use, see the test case for an example
Returns the Inner Product similarity between vectors p and q
Returns the Harmonic mean similarity between vectors p and q
Returns the Cosine similarity between vectors p and q
Returns the Kumar-Hassebrook similarity between vectors p and q
Returns the Jaccard distance between vectors p and q
Returns the Dice distance between vectors p and q
Returns the Fidelity similarity between vectors p and q
Returns the Bhattacharyya distance between vectors p and q
Returns the Hellinger distance between vectors p and q
Returns the Matusita distance between vectors p and q
Returns the Squared-chord distance between vectors p and q
Returns the squared euclidean distance between vectors p and q
Returns the Pearson distance between vectors p and q
Returns the Neyman distance between vectors p and q
Returns the Squared distance between vectors p and q
probabilisticSymmetric(p, q)
Returns the Probabilistic Symmetric distance between vectors p and q
Returns the Divergence distance between vectors p and q
Returns the Clark distance between vectors p and q
Returns the Additive Symmetric distance between vectors p and q
Returns the Kullback-Leibler distance between vectors p and q
Returns the Jeffreys distance between vectors p and q
Returns the K divergence distance between vectors p and q
Returns the Topsøe distance between vectors p and q
Returns the Jensen-Shannon distance between vectors p and q
Returns the Jensen difference distance between vectors p and q
Returns the Taneja distance between vectors p and q
Returns the Kumar-Johnson distance between vectors p and q
Returns the average of city block and Chebyshev distances between vectors p and q
Similarities
Returns the Intersection similarity between vectors p and q
Returns the Czekanowski similarity between vectors p and q
Returns the Motyka similarity between vectors p and q
Returns the Kulczynski similarity between vectors p and q
Returns the Squared-chord similarity between vectors p and q
Returns the Jaccard similarity between vectors p and q
Returns the Dice similarity between vectors p and q
tanimoto(p, q, [bitVector])
Returns the Tanimoto similarity between vectors p and q, and accepts the bitVector use, see the test case for an example
tree(a,b, from, to, [options])
Refer to ml-tree-similarity
Contributing
A new metric should normally be in its own file in the src/dist directory. There should be a corresponding test file in test/dist.
The metric should be then added in the exports of src/index.js with a relatively small but understandable name (use camelCase).
It should also be added to this README with either a link to the formula or an inline description.
Test
$ npm install
$ npm test
Authors
License
MIT