ON THE CREATION OF HYPERTEXT LINKS IN FULL-TEXT DOCUMENTS - MEASUREMENT OF INTER-LINKER CONSISTENCY

被引:19
作者
ELLIS, D [1 ]
FURNERHINES, J [1 ]
WILLETT, P [1 ]
机构
[1] UNIV SHEFFIELD,DEPT INFORMAT STUDIES,SHEFFIELD S10 2TN,S YORKSHIRE,ENGLAND
关键词
D O I
10.1108/eb026925
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An important stage in the process of retrieval of objects from a hypertext database is the creation of a set of inter-nodal links that are intended to represent the relationships existing between objects; this operation is often undertaken manually, just as index terms are often manually assigned to documents in a conventional retrieval system. Studies of conventional systems have suggested that a degree of consistency in the terms assigned to documents by indexers is positively associated with retrieval effectiveness. It is thus of interest to investigate the consistency of assignment of links in separate hypertext versions of the same full-text document, since a measure of agreement may be related to the subsequent utility of the resulting hypertext databases. The calculation of values indicating the degree of similarity between objects is a technique that has been widely used in the fields of textual and chemical information retrieval; in this paper, we describe the application of arithmetic coefficients and topological indices to the measurement of the degree of similarity between the sets of inter-nodal links in hypertext databases. We publish the results of a study in which several different sets of links are inserted, by different people, between the paragraphs of each of a number of full-text documents. Our results show little similarity between the sets of has identified by different people; this finding is comparable with those of studies of inter-indexer consistency, where it has been found that there is generally only a low level of agreement between the sets of index terms assigned to a document by different indexers.
引用
收藏
页码:67 / 98
页数:32
相关论文
共 50 条
[1]   PARAGRAPH-BASED ACCESS TO FULL-TEXT DOCUMENTS USING A HYPERTEXT SYSTEM [J].
ALHAWAMDEH, S ;
SMITH, G ;
WILLETT, P .
PROGRAM-AUTOMATED LIBRARY AND INFORMATION SYSTEMS, 1991, 25 (02) :119-131
[2]  
[Anonymous], 1973, NUMERICAL TAXONOMY P
[3]   TOPOLOGICAL INDEXES - THEIR NATURE, MUTUAL RELATEDNESS, AND APPLICATIONS [J].
BASAK, SC ;
NIEMI, GJ ;
REGAL, RR ;
VEITH, GD .
MATHEMATICAL MODELLING, 1987, 8 :300-305
[4]  
BERK E, 1991, HYPERTEXT HYPERMEDIA
[5]  
BERNSTEIN M, 1992, ECHT 92 P 4 ACM C HY, P161
[6]  
BORKO H, 1974, INFORMATION UTILITIE, V11, P50
[7]   STRUCTURAL-ANALYSIS OF HYPERTEXTS - IDENTIFYING HIERARCHIES AND USEFUL METRICS [J].
BOTAFOGO, RA ;
RIVLIN, E ;
SHNEIDERMAN, B .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 1992, 10 (02) :142-180
[8]   HAM - A GENERAL-PURPOSE HYPERTEXT ABSTRACT MACHINE [J].
CAMPBELL, B ;
GOODMAN, JM .
COMMUNICATIONS OF THE ACM, 1988, 31 (07) :856-861
[9]  
CLIFFORD H. T., 1975, INTRO NUMERICAL CLAS
[10]  
CONKLIN J, 1987, COMPUTER, V20, P17, DOI 10.1109/MC.1987.1663693