Popularity
6.2
Declining
Activity
0.0
Stable
16
3
2
Monthly Downloads: 5
Programming language: Haskell
License: MIT License
Tags:
Math
hopfield-networks alternatives and similar packages
Based on the "Math" category.
Alternatively, view hopfield-networks alternatives based on common mentions on social networks and blogs.
-
subhask
Type safe interface for working in subcategories of Hask -
vector
An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework . -
-
statistics
A fast, high quality library for computing with statistics in Haskell. -
HerbiePlugin
GHC plugin that improves Haskell code's numerical stability -
what4
Symbolic formula representation and solver interaction library -
hgeometry
HGeometry is a library for computing with geometric objects in Haskell. It defines basic geometric types and primitives, and it implements some geometric data structures and algorithms. The main two focusses are: (1) Strong type safety, and (2) implementations of geometric algorithms and data structures that have good asymptotic running time guarantees. -
dimensional
Dimensional library variant built on Data Kinds, Closed Type Families, TypeNats (GHC 7.8+). -
computational-algebra
General-Purpose Computer Algebra System as an EDSL in Haskell -
hermit
Haskell Equational Reasoning Model-to-Implementation Tunnel -
-
mwc-random
A very fast Haskell library for generating high quality pseudo-random numbers. -
matrix
A Haskell native implementation of matrices and their operations. -
-
numhask
A haskell numeric prelude, providing a clean structure for numbers and operations that combine them. -
lambda-calculator
An introduction to the Lambda Calculus -
vector-space
Vector & affine spaces, linear maps, and derivatives -
-
poly
Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent) -
cf
"Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct) -
-
bayes-stack
Framework for Gibbs sampling of probabilistic models -
optimization
Some numerical optimization methods implemented in Haskell -
safe-decimal
Safe and very efficient arithmetic operations on fixed decimal point numbers -
rampart
:european_castle: Determine how intervals relate to each other. -
equational-reasoning
Agda-style equational reasoning in Haskell -
monte-carlo
A Monte Carlo monad and transformer for Haskell. -
bed-and-breakfast
Matrix operations in 100% pure Haskell -
simple-smt
A simple way to interact with an SMT solver process. -
sbvPlugin
Formally prove properties of Haskell programs using SBV/SMT. -
monoid-subclasses
Subclasses of Monoid with a solid theoretical foundation and practical purposes -
polynomial
Haskell library for manipulating and evaluating polynomials -
eigen
Haskel binding for Eigen library. Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. -
vector-th-unbox
Deriver for unboxed vectors using Template Haskell -
manifold-random
Coordinate-free hypersurfaces as Haskell types
ONLYOFFICE Docs — document collaboration in your environment
Powerful document editing and collaboration in your app or environment. Ultimate security, API and 30+ ready connectors, SaaS or on-premises
Promo
www.onlyoffice.com
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of hopfield-networks or a related project?
|
TestGPT | Generating meaningful tests for busy devs
sponsored
codium.ai
|
Popular Comparisons
-
hopfield-networksvscomputational-algebra
-
hmatrix-repavshmatrix
-
hTensorvshmatrix
-
eigenvsarrayfire
-
arrayfirevseigen
|
Access the most powerful time series database as a service
sponsored
www.influxdata.com
|
README
Hopfield Networks in Haskell
Hopfield Networks are a simple form of neutral network, that can be understood as a simplified model of memory.
This implementation is based on the description in Information Theory, Inference, and Learning Algorithms by David MacKay, and [John Myles White's][] Julia implementation on Hopfield networks on GitHub.
Installation
cabal install hopfield-networks
Demonstration
If your cabal binary directory is in your $PATH, you can directly
run a demonstration.
$ hopfield_demonstration
Training patterns
--------
|X X|
| X X |
| XX |
| XX |
| XX |
| X X |
|X X|
--------
--------
|XXXXXX|
|X X|
|X X|
|X X|
|X X|
|X X|
|XXXXXX|
--------
Validation
("Corruption error",4.8989797)
("Reproduction error",0.0)
"Original"
--------
|X X|
| X X |
| XX |
| XX |
| XX |
| X X |
|X X|
--------
"Corrupted"
--------
|X XX|
| XX X |
| XXX |
| XX X|
| XX |
| X X |
|XXX X|
--------
"Reproduction"
--------
|X X|
| X X |
| XX |
| XX |
| XX |
| X X |
|X X|
--------
("Corruption error",4.8989797)
("Reproduction error",0.0)
"Original"
--------
|XXXXXX|
|X X|
|X X|
|X X|
|X X|
|X X|
|XXXXXX|
--------
"Corrupted"
--------
|XX XXX|
|XX X|
|X XX|
|XX X|
|X X|
|X X X|
|XXX XX|
--------
"Reproduction"
--------
|XXXXXX|
|X X|
|X X|
|X X|
|X X|
|X X|
|XXXXXX|
--------
