Langford, D.: Broadbutton node linking : a generalised approach to hyperbase navigation (1990)
0.02
0.019988567 = product of:
0.1199314 = sum of:
0.1199314 = weight(_text_:ranking in 4919) [ClassicSimilarity], result of:
0.1199314 = score(doc=4919,freq=4.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.5916125 = fieldWeight in 4919, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0546875 = fieldNorm(doc=4919)
0.16666667 = coord(1/6)
- Abstract
- Efficient link building in hypertext systems might be greatly facilitated, and existing systems given greater functionality, if 2 related modifications could be made: (1) more general or 'broad-button' nodal links could be created; the Phrase 'broad-button' linking describes ranking connections between areas of a hyperbase. Broad-button links would offer users the choice of a ranked list of destinations from any point within any node. (2) were nodes to be ranked in order of probalble user choice, allowing users a degree of feedback following selection of a node would permit such ranking to be dynamically organised. Feedback of this kind might also assist automatic establishment of appropriate new links between nodes. Describes how such modifications might be organised and some experiments currently being planned and undertaken to evaluate 'broad-button linking'
