Rodrigo A. Botafogo
Ben Shneiderman
Abstract
Hypertext users often suffer from the “lost in hyperspace” problem: disorientation from too many jumps while traversing a complex network. One solution to this problem is improved authoring to create more comprehensible structures. This paper proposes several authoring tools, based on hypertext structure analysis.
In many hypertext systems authors are encouraged to create hierarchical structures, but when writing, the hierarchy is lost because of the inclusion of cross-reference links. The first part of this paper looks at ways of recovering lost hierarchies and finding new ones, offering authors different views of the same hypertext. The second part helps authors by identifying properties of the hypertext document. Multiple metrics are developed including compactness and stratum. Compactness indicates the intrinsic connectedness of the hypertext, and stratum reveals to what degree the hypertext is organized so that some nodes must be read before others.
Several existing hypertexts are used to illustrate the benefits of each technique. The collection of techniques provides a multifaceted view of the hypertext, which should allow authors to reduce undesired structural complexity and create documents that readers can traverse more easily.
- 1 BOTAFOGO, R.A. Structural ana}ysis of hypertexts. Unpublished Master's Thesis, Umv. of Maryland, College Park, 1990.Google Scholar
- 2 BOTAEO(~O, R. A, AND SHNEIDERMAN, B. Identifying aggregates in hypertext structures. In Procee&ngs of the tIypertext '91 Conference. ACM, New York, 1991, pp. 63-74. Google Scholar
- 3 BROWN, P.J. Do we need maps to navigate round hypertext documents? Electron. Pubhsh~ ing2, 2 (1989), 91-100. Google Scholar
- 4 CttARNEY, D. Comprehending non-linear text: The role of discourse cues and reading strategies. In Proceedlngs of the Hypertext '87 Conference (Charlotte, N.C., Nov. 13-15, 1987). ACM, New York, 1987, pp. 109-120. Google Scholar
- 5 CON~LIN, J., AND BEGEMAN, M. gIBIS: A tool for exploratory policy discussion, ACM Trans Offzce Inf. Syst. 6, 4 (1988), 303-331. Google Scholar
- 6 EGAN, D. E., RErdDE, J. R., GOMEZ, L. M., LANDAUER, T. K., EBER~A~m', J., AND LOCHBLM, C. C Formative design-evaluation of SuperBook, ACM Trans. Inf. Syst. 7, 1 (1989), 30-57 Google Scholar
- 7 FLOYD, R.W. Algorithm 97: Shortest path Commun. ACM. 5, 6 (1962), 345 Google Scholar
- 8 FUR~AS, G W. Generalized fisheye views. In Proceedings of the CHI '86 Conference (Boston, Apr. 13 17, 1986) ACM, New York, 1986, pp. 16-23. Google Scholar
- 9 HALASZ, F. G., MORAN, T. P., ANn TRIne, R.H. NoteCards in a nutshell In Proceedings of the ACM CHI + GI '87 Con/~rence (Toronto, Ont , Apr. 5-9, 1987). ACM, New York, 1987, pp 45-52 Google Scholar
- 10 HALASZ, F.G. Reflection on NoteCards: Seven msues for the next generation of hypermedia systems. Commun. ACM 31, 7 (1988), 836-852 Google Scholar
- 11 HARARY, F. Status and contrastatus Sociometry 22 (1959), 23-43.Google Scholar
- 12 HARARY, F., NORMAN, R. Z., AND CARTWRIGHT, D. Structural models. An Introduction to the Theory of D~rected Graphs. Wiley, New York, 1965Google Scholar
- 13 KAUFMANN, A. Graphs, dynamic programming and finite gaines. In Mathematzcs *n Sczence and Engineering 36. Academic Press, New York 1967.Google Scholar
- 14 KINTSCH, W , AND VAN DIJK, T. Toward a model of text comprehensmn and production Psychol. Rev. 85 (1978), 363-394.Google Scholar
- 15 MARSHALL, C. C Guided Tours and on-line presentations: }tow authors make existing hypertext intelligible for readers. In Proceedings of the Hypertext '89 Conference (Pittsburgh, Pa., Nov. 5-8, 1989). ACM, New York, 1989, pp. 15-26. Google Scholar
- 16 MOFFAT, A. AND TAKAOKA, T An all pairs shortest path algomthm with expected running time O(n2 log n). In Proceedmgs of the 26th Annual Sympostum on Foundations of Computer Smence, 1985, pp. 101 105.Google Scholar
- 17 NIELSEN, J. The art of navigating through hypertext Cornmun. ACM33, 3 (1990), 296-310. Google Scholar
- 18 NIELSEN, J. Hypertext & Hypermedia. Academic Press, New York, 1990. Google Scholar
- 19 NEUWIRTH, C., KAUFER, D., CHIMERA, R., AND TERILYN, G. The notes program: A hypertext application for writing from source texts In Proceedings of the Hypertext '87 Conference, ACM, New York, 1987, pp. 121-135. Google Scholar
- 20 PAUSCH, R., AND DETMER, J Node populamty as a hypertext browsing aid. Electron. Pubhshmg' Omginal Dzssemmatmn Des. 3, 4 (1990), pp. 227-234. Google Scholar
- 21 PLAISAN% C. Guide to Opportunities in volunteer archaeology--Case study of the use of a hypertext system in a museum exhibit. In Hypertext/Hypermedia Handbook, E. Berk and J. Devlin, Eds., McGraw-Hill, New York, 1991, pp. 498 505. Google Scholar
- 22 SALTON, G Automatic Text Processing. AddisomWesley, Reading, Mass., 1989. Google Scholar
- 23 SHNEIDERMAN, B , AND KEARSLEY, G. Hypertext Hands-On/Addison-Wesley, Reading, Mass, 1989Google Scholar
- 24 SIRA, P.M. A new algorithm for finding all shortest paths in a graph of posture arcs in average time O(n2 tog2 n), SIAM J. Comput. 2, I (1973), 28-32.Google Scholar
- 25 STOTTS, P. D., AND FU~UTA, R. Petm-net-based hypertext: Document structure with browsing semantics ACM Trans Inf Sy.st. 7, i (1989), 3-29 Google Scholar
- 26 S'rOTTS, P D , ANn FURUTA, R Hierarchy, composition, scripting languages, and translators for structure hypertext. In Proceedings of the European Conference on Hypertext (Paris, 1990) pp. 180-193. Google Scholar
- 27 TRmG, R, AND IRISh, P Hypertext habitats: Experiences of writers in NoteCards In Proceedings of the Hypertext '87 Conference (Charlotte, N.C., Nov 13-15, 1987) ACM, New York, 1987, pp. 89-108 Google Scholar
- 28 VALnEZ, F , AN~ CHI~NELL, M Browsing models for bypermedia databases. In Proceedings of the Human Factors Soczety, 32nd Annual Meeting (Santa Monica, Calif., 1988), Human Factors Society, 1988, pp. 318 322.Google Scholar
- 29 VAN DIJK, T, AND KINTSCm W Strategzes of Discourse Comprehensmn. Academic Press, New York, 1983.Google Scholar
- 30 ZELLWt~GER, P T. Scripted documents: A hypermedm path mechanism In Proceedzngs of Hypertext '89 Conference (Pittsburgh, Pa., Nov. 5-8, 1989). ACM, New York, 1989, pp. 1 14 Google Scholar
Index Terms
- Structural analysis of hypertexts: identifying hierarchies and useful metrics
Recommendations
Development and evaluation of hypermedia for museum education: validation of metrics
To define a hypermedia system's ease of use from the user's point of view, we propose three evaluation metrics: an interface shallowness metric, a downward compactness metric, and a downward navigability metric. These express both the cognitive load on ...
Feral hypertext: when hypertext literature escapes control
HYPERTEXT '05: Proceedings of the sixteenth ACM conference on Hypertext and hypermediaThis paper presents a historical view of hypertext looking at pre-web hypertext as a domesticated species bred in captivity, and arguing that on the web, some breeds of hypertext have gone feral. Feral hypertext is no longer tame and domesticated, but ...
Towards structural computing design
MIS '05: Proceedings of the 2005 symposia on MetainformaticsStructural computing consists of both theory and practices to support all hypertext domains in a native way. Component-Based Open Hypermedia Systems (CB-OHS) constitute the incarnation of this discipline. Nevertheless, CB-OHSs lack support for ...
Comments