Identifying aggregates in hypertext structures

Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this same freedom and flexibility is the cause of one of its main problem: the “lost in hyperspace” problem. One reason for the complexity of hypertext databases is the large number of nodes and links that compose them. To simplify this structure we propose that nodes and links be clustered forming more abstract structures. An abstraction is the concealment of all but relevant properties from an object or concept. One type of abstraction is called an aggregate. An aggregate is a set of distinct concepts that taken together form a more abstract concept. For example, two legs, a trunk, two arms and a head can be aggregate together in a single higher level object called a “body.” In this paper we will study the hypertext structure, i.e., the way nodes are linked to each other in order to find aggregates in hypertext databases. Two graph theoretical algorithms will be used: biconnected components and strongly connected components.

[1]  Ben Shneiderman,et al.  Structural analysis of hypertexts: identifying hierarchies and useful metrics , 1992, TOIS.

[2]  Carolyn J. Crouch,et al.  The use of cluster hierarchies in hypertext information retrieval , 1989, Hypertext.

[3]  Peter J. Brown.  Do We Need Maps to Navigate Round Hypertext Documents? , 1988, Electron. Publ..

[4]  ShneidermanBen,et al.  Structural analysis of hypertexts , 1992 .

[5]  Catherine C. Marshall,et al.  Guided tours and on-line presentations: how authors make existing hypertext intelligible for readers , 1989, Hypertext.

[6]  Jakob Nielsen,et al.  The art of navigating through hypertext , 1990, CACM.

[7]  G. Halasz Frank,et al.  Reflections on NoteCards: seven issues for the next generation of hypermedia systems , 1988 .

[8]  Polle Zellweger.  Scripted documents: a hypermedia path mechanism , 1989, Hypertext.

[9]  Randall H. Trigg.  Guided tours and tabletops: tools for communicating in a hypertext environment , 1988, TOIS.

[10]  P. Gács,et al.  Algorithms , 1992 .

[11]  Peter J. Brown.  Assessing the Quality of Hypertext Documents , 1990, ECHT.

[12]  Douglas C. Engelbart.  Authorship Provisions in Augment , 1984, COMPCON.

[13]  David H. Jonassen,et al.  HyperText/Hypermedia , 1989 .

[14]  DianeC . P. Smith,et al.  Database Abstractions: Aggregation and Generalization , 1989 .

[15]  Diane C. P. Smith,et al.  Database abstractions: aggregation , 1977, CACM.

[16]  Steven K. Feiner,et al.  An experimental system for creating and presenting interactive graphical documents , 1982, TOGS.

[17]  Jakob Nielsen,et al.  Hypertext and hypermedia , 1990 .

[18]  Frank G. Halasz,et al.  Reflections on NoteCards: seven issues for the next generation of hypermedia systems , 1987, CACM.

[19]  Diane C. P. Smith,et al.  Database abstractions: aggregation and generalization , 1977, TODS.

[20]  Steven Feiner.  Seeing the forest for the trees: hierarchical displays of hypertext structures , 1988 .