Global Mapping Analysis: Stochastic Gradient Algorithm in SSTRESS and Classical MDS Stress
We propose a new on-line processing algorithm for solving multidimensional scaling, which is named global mapping analysis (GMA.) In GMA, stochastic gradient algorithm is applied to minimizing two well-known MDS criteria: SSTRESS 15 and classical MDS stress 16, 6. By use of GMA on the two criteria, the required memory space is reduced from the square order of the number of signals to the linear one. We also show that GMA on classical MDS is equivalent to Ojas symmetrical PCA network rule 12, and it always converges to the global optimum. The numerical experiments on 1000000 controlled signals showed that weakly correlated signals are clustered clearly by GMA.
Yoshitatsu Matsuda Kazunori Yamaguchi
Laboratory Department of Graphic and Computer Science College of Arts and Sciences The University of Tokyo 3-8-1, Komaba, Meguro-ku, Tokyo, 153-8902, Japan
国际会议
8th International Conference on Neural Information Processing(ICONIP 2001)(第八届国际神经信息处理大会)
上海
英文
140-145
2001-11-14(万方平台首次上网日期,不代表论文的发表时间)