A graph-inspired data structure for determining likely chains of sequences from breadcrumbs of evidence
A graph-inspired data structure for determining likely chains of ordered symbols from breadcrumbs of evidence. Brother to Gretel.
What is it?
Hansel is a probabilistically-weighted, graph-inspired, novel data structure. Hansel is designed to store the number of observed occurrences of a symbol a appearing at some position in space or time i, co-occurring with another symbol b at another position in space or time j.
One may traverse along ordered positions in time or space, each time predicting the next most likely symbol of the sequence to traverse to, given the previously selected symbols in the path. Hansel presents a user-friendly API for managing and interacting with the data stored within.
pip install numpy
pip install hanselx
Hansel and Gretel are distributed under the MIT license, see LICENSE.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size & hash SHA256 hash help||File type||Python version||Upload date|
|hanselx-0.0.7-py2-none-any.whl (7.1 kB) Copy SHA256 hash SHA256||Wheel||2.7|
|hanselx-0.0.7.tar.gz (6.2 kB) Copy SHA256 hash SHA256||Source||None|