Difference between revisions of "Kohonen Network (KN)/Self Organizing Maps (SOM)"

From
Jump to: navigation, search
(Created page with "[http://www.youtube.com/results?search_query=Kohonen+Network+KN+slef+organizing+maps+somYouTube search...] * [http://www.asimovinstitute.org/author/fjodorvanveen/ Neural Netw...")
 
m (Text replacement - "http:" to "https:")
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
[http://www.youtube.com/results?search_query=Kohonen+Network+KN+slef+organizing+maps+somYouTube search...]
+
{{#seo:
 +
|title=PRIMO.ai
 +
|titlemode=append
 +
|keywords=artificial, intelligence, machine, learning, models, algorithms, data, singularity, moonshot, Tensorflow, Google, Nvidia, Microsoft, Azure, Amazon, AWS
 +
|description=Helpful resources for your journey with artificial intelligence; videos, articles, techniques, courses, profiles, and tools
 +
}}
 +
[https://www.youtube.com/results?search_query=Kohonen+Network+KN+self+organizing+maps+SOM YouTube search...]
 +
[https://www.google.com/search?q=Kohonen+Network+KN+self+organizing+maps+SOM+deep+machine+learning+ML+artificial+intelligence ...Google search]
  
* [http://www.asimovinstitute.org/author/fjodorvanveen/ Neural Network Zoo | Fjodor Van Veen]
+
* [https://www.asimovinstitute.org/author/fjodorvanveen/ Neural Network Zoo | Fjodor Van Veen]
  
Message queuing service that makes it easy to decouple and scale microservices, distributed systems, and serverless applications. Two types of message queues. Standard queues offer maximum throughput, best-effort ordering, and at-least-once delivery. SQS FIFO queues are designed to guarantee that messages are processed exactly once, in the exact order that they are sent, with limited throughput.  
+
Kohonen networks (KN, also self organising (feature) map, SOM, SOFM) “complete” our zoo. KNs utilise competitive learning to classify data without supervision. Input is presented to the network, after which the network assesses which of its neurons most closely match that input. These neurons are then adjusted to match the input even better, dragging along their neighbours in the process. How much the neighbours are moved depends on the distance of the neighbours to the best matching units. KNs are sometimes not considered neural networks either. Kohonen, Teuvo. “Self-organized formation of topologically correct feature maps.” Biological cybernetics 43.1 (1982): 59-69.
 +
 
 +
https://www.asimovinstitute.org/wp-content/uploads/2016/09/kn.png
  
 
<youtube>GdZckTLNqsY</youtube>
 
<youtube>GdZckTLNqsY</youtube>
 
<youtube>_Euwc9fWBJw</youtube>
 
<youtube>_Euwc9fWBJw</youtube>
 
<youtube>H9H6s-x-0YE</youtube>
 
<youtube>H9H6s-x-0YE</youtube>
<youtube>_Euwc9fWBJw</youtube>
+
<youtube>HKj2ASG0DKQ</youtube>

Latest revision as of 20:59, 28 March 2023

YouTube search... ...Google search

Kohonen networks (KN, also self organising (feature) map, SOM, SOFM) “complete” our zoo. KNs utilise competitive learning to classify data without supervision. Input is presented to the network, after which the network assesses which of its neurons most closely match that input. These neurons are then adjusted to match the input even better, dragging along their neighbours in the process. How much the neighbours are moved depends on the distance of the neighbours to the best matching units. KNs are sometimes not considered neural networks either. Kohonen, Teuvo. “Self-organized formation of topologically correct feature maps.” Biological cybernetics 43.1 (1982): 59-69.

kn.png