Skip to main content
Help us improve PyPI by participating in user testing. All experience levels needed!

A graph-inspired data structure for determining likely chains of sequences from breadcrumbs of evidence

Project description

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.

Requirements

pip install numpy

Install

pip install hanselx

Citation

Paper pending…

License

Hansel and Gretel are distributed under the MIT license, see LICENSE.

Project details


Release history Release notifications

This version
History Node

0.0.7

History Node

0.0.4

History Node

0.0.3

History Node

0.0.2

History Node

0.0.1

History Node

0.0.1a0

Download files

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 Mar 12, 2017
hanselx-0.0.7.tar.gz (6.2 kB) Copy SHA256 hash SHA256 Source None Mar 12, 2017

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging CloudAMQP CloudAMQP RabbitMQ AWS AWS Cloud computing Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page