Talk:Stress majorization

Latest comment: 6 years ago by Uriamor in topic The SMACOF algorithm isn't clear

Speedy deletion

edit

Stress majorization is a very old (1977) and widely used technique for metric multidimensional scaling with a number of other interesting applications. It might take me a few days to put it all together though, please don't delete it! It may be a little stub-like at the moment but I promise to keep expanding it as time permits. Thanks Tgdwyer 07:37, 26 March 2007 (UTC)Reply

Sorry I was a bit hasty on the speedy delete tag. Still, you need to make this a bit less technical so average readers (or below-average readers such as myself) might have a faint clue about this topic. A real-world example might be in order. I realize you'll never dumb it down to an eighth-grade level, and you wouldn't really want to. But still, just a little context for the rest of us would be a good idea. Realkyhick 05:24, 27 March 2007 (UTC)Reply

X'

edit

I can't make out what   is referring to here.   is a configuration matrix. Is   just the transpose of  ? Cai (talk) 16:30, 24 September 2009 (UTC)Reply


Majorization or minimisation?

edit

I expect the description is technically correct but it does read in a bit of an odd way:

"Stress majorization is an optimization strategy used in multidimensional scaling (MDS) where, for a set of n, m-dimensional data items, a configuration X of n points in r(<<m)-dimensional space is sought that minimises the so called stress function σ(X). "

This seems to be saying that "majorization" (which I suspect is not a real word) consists of "minimisation" which sounds very odd to me when I read it. Is there a better way of wording this?90.205.123.105 (talk) 18:36, 9 April 2011 (UTC)Reply

The SMACOF algorithm isn't clear

edit

It states "i.e. for the Hessian matrix V the second term is equivalent to tr X'VX "

What Hessian matrix V? Hessian of which function? — Preceding unsigned comment added by Uriamor (talkcontribs) 19:39, 31 December 2017 (UTC)Reply