Category : Word Processors
Archive   : HYPELNK.ZIP
Filename : MAPPING
³Similarity Mapping³
ÀÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÙ
The function of this routine is to convert the semantic
measurements, calculated for all pairs of items (or a lesser set if some
form of hierarchic grouping is utilized), into a visual display. The values
are kept in a distance
produce a map with the following characteristics:
þ Based on the information passed to this routine, it will evaluate the
a hierarchic map, or a connectivity net, with values either scattered around
an area, or in straight-line groupings. If the routine cannot determine the
best form, it will query the user to indicate what form of map is more
appropriate. Bad, or simply too complex, data can produce
ÚÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄ¿
³ InfoMaps may remind you of
³ This is not a coincidence. The map of the London Underground is a classic ³
³ example of the advantage of stylized maps. Supposedly most Londoners "see"³
³ their city in terms of this map, rather than possible exact renderings. We³
³ deliberately chose a scheme that has been helpful to so many for so long. ³
ÀÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÄÙ
Any automatic decision can be overridden by the user. The user can also
determine where to locate a starting point (center of area, upper left
corner, center of top line, center of left line), and the manner in which
each topic is identified--reference number, name abbreviation, use of icon
or box to differentiate between classes or types of objects (items). Other
rules can be imposed. For instance, if the items have a time or value
feature, the routine can respect this in the arrangement, e.g., no later
item can precede an earlier item. The user also decides the application map
type.
þ The routine which indicates connections between the various items by
drawing lines between them is optional. Either all mutually referenced items
can be connected, or the procedure can decide to connect only the closest
items based on a hierarchy decision. The user can also decide whether
crossing links are permitted, or set restrictions on the number of links
drawn.
þ Any inadequacies in the generated maps can be corrected by means of
capabilities, have special features for similarity mapping.
þ For large datasets, the similarity map can be restricted to only certain
items--either by class (importance, time or value range), or by similarity
to specified items. If the routine detects that it is requested to perform
computations that could exceed a parameter-set limit, it will first request
confirmation--see preparation.
þ At the heart of the mapping routine are several algorithms geared toward
producing "neat" displays. In similarity maps, the goal is to achieve the
smallest total distance error, subject to maintaining a minimal separation
between non-identical items. In the concept connection maps, the goal is
achieving a network representation with a minimum of links and very few
crossing links. Similar optimization objectives apply to other map displays.
For more on maps as the basis for organizing "practically anything," see
R. Abler, J. Adams, P. Gould: Spatial Organization--the geographer's
view of the world, Prentice-Hall, 1971.
Other capabilities and considerations will become apparent from the
several application !
Very nice! Thank you for this wonderful archive. I wonder why I found it only now. Long live the BBS file archives!
This is so awesome! 😀 I’d be cool if you could download an entire archive of this at once, though.
But one thing that puzzles me is the “mtswslnkmcjklsdlsbdmMICROSOFT” string. There is an article about it here. It is definitely worth a read: http://www.os2museum.com/wp/mtswslnk/