{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/hsgsom","name":"hsgsom","description":"The growing self organising map (GSOM) algorithm is a clustering algorithm\nworking on a set of n-dimensional numeric input vectors. It's output is a\nnetwork of nodes laid out in two dimensions where each node has a weight\nvector associated with it. This weight vector has the same dimension as the\ninput vectors and is meant to be intepreted as a cluster center, i.e. it\nrepresents those input vectors whose distance to the node's weight vector\nis minimal when compared to the distance to the other nodes weight vectors.\nSee http://en.wikipedia.org/wiki/GSOM for an explanation of the algorithm.\nThe algorithm was introduced in:\nAlahakoon, D., Halgamuge, S. K. and Sirinivasan, B. (2000)\nDynamic Self Organizing Maps With Controlled Growth\nfor Knowledge Discovery,\nIEEE Transactions on Neural Networks,\nSpecial Issue on Knowledge Discovery and Data Mining, 11, pp 601-614.","version":"0.2.0","softwareVersion":"0.2.0","license":"https://spdx.org/licenses/BSD-3-Clause","keywords":["bsd3","clustering","data-mining","library","Propose Tags"],"maintainer":[{"@type":"Person","name":"StephanGuenther"}],"author":[{"@type":"Person","name":"StephanGuenther"}],"copyrightHolder":[{"@type":"Person","name":"StephanGuenther"}],"dateCreated":"2009-04-27","dateModified":"2011-02-10","datePublished":"2011-02-10","copyrightYear":2009,"downloadUrl":"https://hackage.haskell.org/package/hsgsom-0.2.0/hsgsom-0.2.0.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","sameAs":["https://hackage.haskell.org/package/hsgsom"]}