Clustering using Self Organized Map on Rmesh
Clustering finds its applications in image processing, business, and bioinformatics. In this paper two Self Organized map algorithms on Reconfigurable mesh with buses will be presented. These algorithms use M×K PEs and M×N×K PEs. The former has time complexity of 0(logM)for process one pattern. The latter has time complexity of O(logMN) for processing N patterns.
MSU Digital Commons Citation
Jenq, John, "Clustering using Self Organized Map on Rmesh" (2005). Department of Computer Science Faculty Scholarship and Creative Works. 169.