som-9.0.3: som.cabal
name: som
version: 9.0.3
cabal-version: >=1.10
build-type: Simple
license: BSD3
license-file: LICENSE
copyright: (c) 2010-2017 Amy de Buitléir
maintainer: amy@nualeargais.ie
homepage: https://github.com/mhwombat/som#readme
bug-reports: https://github.com/mhwombat/som/issues
synopsis: Self-Organising Maps.
description:
A Kohonen Self-organising Map (SOM) maps input patterns
onto a regular grid (usually two-dimensional) where each
node in the grid is a model of the input data, and does
so using a method which ensures that any topological
relationships within the input data are also represented
in the grid. This implementation supports the use of
non-numeric patterns.
.
In layman's terms, a SOM can be useful when you you want
to discover the underlying structure of some data.
.
The userguide is available at
<https://github.com/mhwombat/som/wiki>.
category: Math
author: Amy de Buitléir
source-repository head
type: git
location: https://github.com/mhwombat/som
library
exposed-modules:
Data.Datamining.Clustering.SOM
Data.Datamining.Clustering.SOMInternal
Data.Datamining.Clustering.DSOM
Data.Datamining.Clustering.DSOMInternal
Data.Datamining.Clustering.SGM
Data.Datamining.Clustering.SGMInternal
Data.Datamining.Clustering.Classifier
Data.Datamining.Pattern
build-depends:
assert >=0.0.1.2 && <0.1,
base >=4.9.1.0 && <4.10,
containers >=0.5.7.1 && <0.6,
deepseq >=1.4.2.0 && <1.5,
grid >=7.8.8 && <7.9,
MonadRandom >=0.5.1 && <0.6
default-language: Haskell2010
hs-source-dirs: src
ghc-options: -Wall
test-suite som-test
type: exitcode-stdio-1.0
main-is: Main.hs
build-depends:
assert >=0.0.1.2 && <0.1,
base ==4.9.*,
test-framework-quickcheck2 >=0.3.0.3 && <0.4,
QuickCheck >=2.9.2 && <2.10,
test-framework >=0.8.1.1 && <0.9,
som >=9.0.3 && <9.1,
containers >=0.5.7.1 && <0.6,
grid >=7.8.8 && <7.9,
MonadRandom >=0.5.1 && <0.6,
random ==1.1.*
default-language: Haskell2010
hs-source-dirs: test
ghc-options: -threaded -rtsopts -with-rtsopts=-N -Wall