Fast self-organization by query-based algorithm and its applications

A query-based algorithm is introduced to Kohonen´s self-organizing feature maps for finding the best matching neurons with their desire states. It is different from the original self-organization algorithm which finds the best matching neurons with neurons´ current states. The proposed method with a batch view of the self-organization process is a variant of Kohonen´s algorithm. Thus, it can be applied to solve the data clustering problem with pre-specified input vectors. Moreover, the VLSI circuit placement problem without pre-specified input vectors can also be successfully resolved. Comparisons have been made with the original self-organization algorithm, and shown to be better