Use in Graph Drawing
Stress majorization and algorithms similar to SMACOF also have application in the field of graph drawing. That is, one can find a reasonably aesthetically appealing layout for a network or graph by minimizing a stress function over the positions of the nodes in the graph. In this case, the are usually set to the graph-theoretic distances between nodes i and j and the weights are taken to be . Here, is chosen as a trade-off between preserving long- or short-range ideal distances. Good results have been shown for .
Read more about this topic: Stress Majorization
Famous quotes containing the words graph and/or drawing:
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)
“It is an inexpressible Pleasure to know a little of the World, and be of no Character or Significancy in it. To be ever unconcerned, and ever looking on new Objects with an endless Curiosity, is a Delight known only to those who are turned for Speculation: Nay, they who enjoy it, must value things only as they are the Objects of Speculation, without drawing any worldly Advantage to themselves from them, but just as they are what contribute to their Amusement, or the Improvement of the Mind.”
—Richard Steele (1672–1729)