svm
HSGEP
| svm | HSGEP | |
|---|---|---|
| - | - | |
| 33 | 10 | |
| - | - | |
| 0.0 | 0.0 | |
| over 13 years ago | about 6 years ago | |
| Haskell | Mathematica | |
| GNU General Public License v3.0 only | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
svm
We haven't tracked posts mentioning svm yet.
Tracking mentions began in Dec 2020.
HSGEP
We haven't tracked posts mentioning HSGEP yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
nn - A tiny neural network ðŸ§
creatur - Framework for artificial life and other evolutionary algorithms.
hnn - haskell neural network library
genprog - Genetic programming library
heukarya - genetic programming in haskell
hopfield - hopfield
csp - Constraint satisfaction problem (CSP) solvers for Haskell
tensor-safe - A Haskell framework to define valid deep learning models and export them to other frameworks like TensorFlow JS or Keras.
grenade - Deep Learning in Haskell
svm-simple - Simplified interface to bindings-svm
moo - Genetic algorithm library for Haskell. Binary and continuous (real-coded) GAs. Binary GAs: binary and Gray encoding; point mutation; one-point, two-point, and uniform crossover. Continuous GAs: Gaussian mutation; BLX-α, UNDX, and SBX crossover. Selection operators: roulette, tournament, and stochastic universal sampling (SUS); with optional niching, ranking, and scaling. Replacement strategies: generational with elitism and steady state. Constrained optimization: random constrained initialization, death penalty, constrained selection without a penalty function. Multi-objective optimization: NSGA-II and constrained NSGA-II.