Abstract
Usage of Self-Organizing Map (SOM) for clustering vertices of any given graph. Simultaneously its input is observed and worked in terms of weight matrix, learning rate and final resultant matrix, which helps to form a cluster. The purpose of this paper is to introduce a procedure of SOM for clustering and observed impact corresponding to varied weight class for simple graph or vector matrix using Euclidean distance. A simple vector matrix problem is solved by using 2, 3 & 4 weight class matrix. By adopting a different weight matrix class with same vector matrix has presented a clustering and visualization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Applications Technology and Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
