Given a network, its Pathfinder network is the combination of all its minimum spanning trees. Alternatively, a Pathfinder is also defined as a network scaling process. The process removes links in a network that violate the triangular inequality assumption. The network with the remaining links is the Pathfinder network. A Pathfinder network can be considered as a compromise between a network with an excessive number of links and its potentially arbitrarily chosen minimum spanning tree.
CiteSpace allows users to prune a network, i.e. to reduce the number of links and retain the most salient ones. A network can be pruned to a Pathfinder network scaling or a minimum spanning tree, especially the total number of links in the network is excessive.
References
- Schvaneveldt, R. W. (ed.), Pathfinder Associative Networks: Studies in Knowledge Organization. Ablex Publishing Corporations, Norwood, New Jersey, 1990.
- Chen, C. (1997) Structuring and visualizing the WWW by Generalized Similarity Analysis. ACM Conference on Hypertext (Hypertext’97). Southampton, UK. ACM Press. pp. 177-186. http://www.pages.drexel.edu/~cc345/papers/ht97.pdf
- Chen, C. (1998) Generalized similarity analysis and Pathfinder network scaling. Interacting with Computers, 10, 107-128. http://www.pages.drexel.edu/~cc345/papers/iwc98a.pdf
- Chen, C. & Paul, R. J. (2001) Visualizing a knowledge domain’s intellectual structure. IEEE Computer, 34(3), 65-71.