Geography Reference
In-Depth Information
Algorithm The algorithm consists of the following steps (Craw 1989a;
Espinosa Organista et al. 2002; Grehan 2001c; Morrone 2004b; Morrone et
al. 1996):
1. Construct an r × c matrix, where r (rows) represent the localities or distri-
butional areas and c (columns) represent the individual tracks. Each entry
is “1” or “0,” depending on whether the track is present or absent.
2. Use a compatibility program to find the largest clique of compatible tracks.
3. Map out the largest cliques as generalized tracks connecting the localities
or areas.
4. Use a statistical test to evaluate the percentage of randomly generated
matrices where the largest clique size is as large as or larger than the
largest clique in the real data in order to provide a statistical test of the
level at which the largest clique attains significance.
5. Identify baselines (if possible) for the generalized tracks.
6. Represent the generalized tracks, nodes, baselines, and main massings
on a map.
Search WWH ::




Custom Search