-
Rada, R.; Murphy, C.: Searching verses browsing in hypertext (1992)
0.08
0.07622548 = product of:
0.11433822 = sum of:
0.08728119 = weight(_text_:book in 3317) [ClassicSimilarity], result of:
0.08728119 = score(doc=3317,freq=2.0), product of:
0.2237077 = queryWeight, product of:
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.050679956 = queryNorm
0.39015728 = fieldWeight in 3317, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.0625 = fieldNorm(doc=3317)
0.027057027 = product of:
0.054114055 = sum of:
0.054114055 = weight(_text_:search in 3317) [ClassicSimilarity], result of:
0.054114055 = score(doc=3317,freq=2.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.30720934 = fieldWeight in 3317, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0625 = fieldNorm(doc=3317)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Attemps to elaborate the relationships among tasks, user types, and tools for hypertext. A computer system was built for automatically converting books into hypertext and one book converts into Emaccs-Info, Guide, HyperTies, and a variant of SuperBook, called MaxiBook. Compares the performance of 3 classes of users - expers, novices and trainees - with different tasks on these different delivery vehicles, the tasks involving one search question and one browse question
-
Catenazzi, N.; Sommaruga, L.: Hyper-book : a formal model for electronic books (1994)
0.07
0.071264796 = product of:
0.21379438 = sum of:
0.21379438 = weight(_text_:book in 1107) [ClassicSimilarity], result of:
0.21379438 = score(doc=1107,freq=12.0), product of:
0.2237077 = queryWeight, product of:
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.050679956 = queryNorm
0.9556863 = fieldWeight in 1107, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.0625 = fieldNorm(doc=1107)
0.33333334 = coord(1/3)
- Abstract
- Presents a model for an electronic book (hyper-book). Hyper-books are electronic books defined on the basis of the paper book metaphor. Gives a formal definition of the hyper-book model as a dynamic system. The model was implemented in a working system, and evaluated with a group of users. The evaluation has confirmed that the adoption of the book metaphor is very effective, as it guarantees ease of using and understanding the system
-
Dimitroff, A.; Wolfram, D.: Searcher response in a hypertext-based bibliographic information retrieval system (1995)
0.05
0.054386526 = product of:
0.16315958 = sum of:
0.16315958 = sum of:
0.10822811 = weight(_text_:search in 187) [ClassicSimilarity], result of:
0.10822811 = score(doc=187,freq=8.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.6144187 = fieldWeight in 187, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0625 = fieldNorm(doc=187)
0.054931477 = weight(_text_:22 in 187) [ClassicSimilarity], result of:
0.054931477 = score(doc=187,freq=2.0), product of:
0.17747258 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050679956 = queryNorm
0.30952093 = fieldWeight in 187, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=187)
0.33333334 = coord(1/3)
- Abstract
- This article examines searcher behavior and affective response to a hypertext-based bibliographic information retrieval system called HyperLynx for searchers with different search skills and backgrounds. Search times and number of nodes visited were recorded for five specified search queries, and views of the system were recorded for each searcher. No significant differences were found in search times or user satisfaction with the system, indicating that a hypertext-based approach to bibliographic retrieval could be appropriate for a variety of searcher experience levels
- Source
- Journal of the American Society for Information Science. 46(1995) no.1, S.22-29
-
Franklin, C.: ¬A bibliography on hypertext and hypermedia with selected annotations (1990)
0.04
0.036367163 = product of:
0.10910148 = sum of:
0.10910148 = weight(_text_:book in 3511) [ClassicSimilarity], result of:
0.10910148 = score(doc=3511,freq=2.0), product of:
0.2237077 = queryWeight, product of:
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.050679956 = queryNorm
0.4876966 = fieldWeight in 3511, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.078125 = fieldNorm(doc=3511)
0.33333334 = coord(1/3)
- Abstract
- The bibliography is arranged under the following headings: alternatives to HyperCard, bibliographies, biographies, books and book reviews, dictionaries, hardware, interviews, library applications, optical disc-related, theoretical and technical aspects and user's groups.
-
Maislin, S.: Ripping out the pages (2000)
0.04
0.036367163 = product of:
0.10910148 = sum of:
0.10910148 = weight(_text_:book in 220) [ClassicSimilarity], result of:
0.10910148 = score(doc=220,freq=8.0), product of:
0.2237077 = queryWeight, product of:
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.050679956 = queryNorm
0.4876966 = fieldWeight in 220, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.0390625 = fieldNorm(doc=220)
0.33333334 = coord(1/3)
- Abstract
- When the Web was invented, it was touted as a novel nonlinear medium for the written word. No longer would we be constrained by linear presentations! Hyperlinks would allow us to jump haphazardly from page to page, chapter to chapter, idea to idea! Texts would no longer need to run from beginning to end! This is misleading. A printed book is also multidimensional and potentially nonlinear. We can open it to any page, from any other page, for any reason. We can open several books at once. In fact, what makes a book special is its combination of linear structure (the order of the words) and nonlinear physicality (the bound papers). This linear/nonlinear duality is enhanced further by the index, which maps linearly sequenced pages in a nonlinear, informationally ordered structure (architecture). In truth, the online environment is crippled by an absence of linear structure. Imagine selecting a hard cover book, tearing off the covers, ripping pages into small pieces, and throwing them in a box. That box is like a computer file system, and the paper scraps are Web documents. Only one scrap can be retrieved from the box at a time, and it must be replaced before another can be accessed. Page numbers are meaningless. Global context is destroyed. And without page numbers or context, what happens to the index?
- Issue
- Beyond book indexing: how to get started in Web indexing, embedded indexing and other computer-based media. Ed. by D. Brenner u. M. Rowland.
-
Milosavljevic, M.; Oberlander, J.: Dynamic catalogues on the WWW (1998)
0.04
0.036348514 = product of:
0.109045535 = sum of:
0.109045535 = sum of:
0.054114055 = weight(_text_:search in 3594) [ClassicSimilarity], result of:
0.054114055 = score(doc=3594,freq=2.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.30720934 = fieldWeight in 3594, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0625 = fieldNorm(doc=3594)
0.054931477 = weight(_text_:22 in 3594) [ClassicSimilarity], result of:
0.054931477 = score(doc=3594,freq=2.0), product of:
0.17747258 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050679956 = queryNorm
0.30952093 = fieldWeight in 3594, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=3594)
0.33333334 = coord(1/3)
- Abstract
- Natural language generation techniques can be used to dynamically produce hypertext dynamic catalogues on the Web, resulting in DYNAMIC HYPERTEXT. A dynamic hypertext document can be tailored more precisely to a particular user's needs and background, thus helping the user to search more effectively. Describes the automatic generation of WWW documents and illustrates with 2 implemented systems
- Date
- 1. 8.1996 22:08:06
-
Rada, R.: Hypertext writing and document reuse : the role of a semantic net (1990.)
0.03
0.029093731 = product of:
0.08728119 = sum of:
0.08728119 = weight(_text_:book in 5911) [ClassicSimilarity], result of:
0.08728119 = score(doc=5911,freq=2.0), product of:
0.2237077 = queryWeight, product of:
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.050679956 = queryNorm
0.39015728 = fieldWeight in 5911, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.0625 = fieldNorm(doc=5911)
0.33333334 = coord(1/3)
- Abstract
- When document components are classified and then recombined during document re-use, a semantic net may serve as the classification language. A theory of analogical inheritance, applied to this semantic net, guides the reorganisation of document components. Authors index paragraphs from various sources with node-link-node triples from a semantic net and then use programs to transverse the semantic net and generate various outlines. The program examines node and link names in deciding which path to take. Describes how these techniques helped in the re-use: parts of an existing book to write a new one
-
Carmel, E.; Crawford, S.; Chen, H.: Browsing in hypertext : a cognitive study (1992)
0.03
0.027387565 = product of:
0.08216269 = sum of:
0.08216269 = sum of:
0.047830522 = weight(_text_:search in 7469) [ClassicSimilarity], result of:
0.047830522 = score(doc=7469,freq=4.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.27153727 = fieldWeight in 7469, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=7469)
0.034332175 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
0.034332175 = score(doc=7469,freq=2.0), product of:
0.17747258 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050679956 = queryNorm
0.19345059 = fieldWeight in 7469, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=7469)
0.33333334 = coord(1/3)
- Abstract
- With the growth of hypertext and multimedia applications that support and encourage browsing it is time to take a penetrating look at browsing behaviour. Several dimensions of browsing are exemined, to find out: first, what is browsing and what cognitive processes are associated with it: second, is there a browsing strategy, and if so, are there any differences between how subject-area experts and novices browse; and finally, how can this knowledge be applied to improve the design of hypertext systems. Two groups of students, subject-area experts and novices, were studied while browsing a Macintosh HyperCard application on the subject The Vietnam War. A protocol analysis technique was used to gather and analyze data. Components of the GOMS model were used to describe the goals, operators, methods, and selection rules observed: Three browsing strategies were identified: (1) search-oriented browse, scanning and and reviewing information relevant to a fixed task; (2) review-browse, scanning and reviewing intersting information in the presence of transient browse goals that represent changing tasks, and (3) scan-browse, scanning for interesting information (without review). Most subjects primarily used review-browse interspersed with search-oriented browse. Within this strategy, comparisons between subject-area experts and novices revealed differences in tactics: experts browsed in more depth, seldom used referential links, selected different kinds of topics, and viewed information differently thatn did novices. Based on these findings, suggestions are made to hypertext developers
- Source
- IEEE transactions on systems, man and cybernetics. 22(1992) no.5, S.865-884
-
Yang, C.C.; Liu, N.: Web site topic-hierarchy generation based on link structure (2009)
0.03
0.027387565 = product of:
0.08216269 = sum of:
0.08216269 = sum of:
0.047830522 = weight(_text_:search in 2738) [ClassicSimilarity], result of:
0.047830522 = score(doc=2738,freq=4.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.27153727 = fieldWeight in 2738, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=2738)
0.034332175 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
0.034332175 = score(doc=2738,freq=2.0), product of:
0.17747258 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.050679956 = queryNorm
0.19345059 = fieldWeight in 2738, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=2738)
0.33333334 = coord(1/3)
- Abstract
- Navigating through hyperlinks within a Web site to look for information from one of its Web pages without the support of a site map can be inefficient and ineffective. Although the content of a Web site is usually organized with an inherent structure like a topic hierarchy, which is a directed tree rooted at a Web site's homepage whose vertices and edges correspond to Web pages and hyperlinks, such a topic hierarchy is not always available to the user. In this work, we studied the problem of automatic generation of Web sites' topic hierarchies. We modeled a Web site's link structure as a weighted directed graph and proposed methods for estimating edge weights based on eight types of features and three learning algorithms, namely decision trees, naïve Bayes classifiers, and logistic regression. Three graph algorithms, namely breadth-first search, shortest-path search, and directed minimum-spanning tree, were adapted to generate the topic hierarchy based on the graph model. We have tested the model and algorithms on real Web sites. It is found that the directed minimum-spanning tree algorithm with the decision tree as the weight learning algorithm achieves the highest performance with an average accuracy of 91.9%.
- Date
- 22. 3.2009 12:51:47
-
Kinnell, S.K.; Franklin, C.: Hypertext and hypercard : early development (2009)
0.03
0.025457015 = product of:
0.076371044 = sum of:
0.076371044 = weight(_text_:book in 3788) [ClassicSimilarity], result of:
0.076371044 = score(doc=3788,freq=2.0), product of:
0.2237077 = queryWeight, product of:
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.050679956 = queryNorm
0.34138763 = fieldWeight in 3788, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.414126 = idf(docFreq=1454, maxDocs=44218)
0.0546875 = fieldNorm(doc=3788)
0.33333334 = coord(1/3)
- Footnote
- Vgl.: http://www.tandfonline.com/doi/book/10.1081/E-ELIS3.
-
Fox, E.A.; Chen, Q.F.; France, R.K.: Integrating search and retrieval with hypertext (1991)
0.02
0.01803802 = product of:
0.054114055 = sum of:
0.054114055 = product of:
0.10822811 = sum of:
0.10822811 = weight(_text_:search in 5671) [ClassicSimilarity], result of:
0.10822811 = score(doc=5671,freq=2.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.6144187 = fieldWeight in 5671, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.125 = fieldNorm(doc=5671)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
-
Ritchie, I.: Hypermedia: search by natural association (1991)
0.02
0.015943509 = product of:
0.047830522 = sum of:
0.047830522 = product of:
0.095661044 = sum of:
0.095661044 = weight(_text_:search in 4875) [ClassicSimilarity], result of:
0.095661044 = score(doc=4875,freq=4.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.54307455 = fieldWeight in 4875, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.078125 = fieldNorm(doc=4875)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- Hypermedia supports an unstructured search for information by association and enables retrieval of information in the order and to the detail required. Discusses the origings of hypermedia and examines applications of the technology in the area of financial planning. Also discusses hypermedia in the context of training and discusses its benefite to users, producers and distributors of information
-
Girill, T.R.; Griffin, T.; Jones, R.B.: Extended subject access to hypertext online documentation : pts.1.2: the search-support and maintenance problems (1991)
0.02
0.015783267 = product of:
0.0473498 = sum of:
0.0473498 = product of:
0.0946996 = sum of:
0.0946996 = weight(_text_:search in 193) [ClassicSimilarity], result of:
0.0946996 = score(doc=193,freq=2.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.5376164 = fieldWeight in 193, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.109375 = fieldNorm(doc=193)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
-
Faloutsos, C.; Shneiderman, B.; Lee, R.; Plaisant, C.: Incorporating string search in a hypertext system : user interface and signature file design issues (1990)
0.02
0.015783267 = product of:
0.0473498 = sum of:
0.0473498 = product of:
0.0946996 = sum of:
0.0946996 = weight(_text_:search in 2758) [ClassicSimilarity], result of:
0.0946996 = score(doc=2758,freq=8.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.5376164 = fieldWeight in 2758, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0546875 = fieldNorm(doc=2758)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- Hypertext systems provide an appealing mechanism for informally browsing databases by traversing selectable links. However, in many fact finding situations string searching is an effective complement to browsing. Describes the application of the signature file method to achieve rapid and convenient strung search in small personal computer hypertext environments. The method has been implemented to a prototype, as well as in a commercial product. Presents performance data for search times and storage space from a commercial hypertext database and discusses user interface issues. Experience with the string search interface indicates that it was used successfully by novice users
-
Khan, K.; Locatis, C.: Searching through cyberspace : the effects of link display and link density on information retrieval from hypertext on the World Wide Web (1998)
0.02
0.015125338 = product of:
0.045376014 = sum of:
0.045376014 = product of:
0.09075203 = sum of:
0.09075203 = weight(_text_:search in 446) [ClassicSimilarity], result of:
0.09075203 = score(doc=446,freq=10.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.51520574 = fieldWeight in 446, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=446)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- This study investigated information retrieval from hypertext on the WWW. Significant main and interaction effects were found for both link density (number of links per display) and display format (in paragraphs or lists) on search performance. Low link densities displayed in list format produced the best overall results, in terms of search accuracy, search time, number of links explored, and search task prioritization. Lower densities affected user ability to prioritize search tasks and produced more accurate searches, while list displays positively affected all aspects of searching except task prioritization. The performance of novices and experts, in terms of their previous experience browsing hypertext on the WWW, was compared. Experts performed better, mostly because of their superior task prioritization
-
Rittberger, M.: Support of online database selection in KHS (1994)
0.01
0.013668711 = product of:
0.041006133 = sum of:
0.041006133 = product of:
0.082012266 = sum of:
0.082012266 = weight(_text_:search in 8577) [ClassicSimilarity], result of:
0.082012266 = score(doc=8577,freq=6.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.46558946 = fieldWeight in 8577, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0546875 = fieldNorm(doc=8577)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- The Konstanz-Hypertext-System (KHS) is an open hypertext system which employs internal and external information sources to satisfy the user's need for information when navigating through a hypertext. E-mail, Gopher and online databases are available in KHS as external information sources. The main tasks which must be carried out during an online search are analysis of the question, selection of the databases, formulation of a search strategy, online search, feedback and the presentation of the results. All of these tasks are supported within KHS, but special emphasis is given to database selection. Introduces a new method for selecting relevant online databases with KHS using the database descriptions from several hosts
-
Hanai, U.: Intelligent hypertext : a framework for automatic search guidance system (1995)
0.01
0.013668711 = product of:
0.041006133 = sum of:
0.041006133 = product of:
0.082012266 = sum of:
0.082012266 = weight(_text_:search in 3839) [ClassicSimilarity], result of:
0.082012266 = score(doc=3839,freq=6.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.46558946 = fieldWeight in 3839, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0546875 = fieldNorm(doc=3839)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- Presents a new way to tackle the well known 'getting lost sydrome' in hypertext systems by using expertext, or the integration of expert systems with hypertext. Focuses on automatic users' guidance. Presents intelligent Automatic Search Guidance which applies a frame-based representation scheme and object oriented techniques to incorporate an intelligent thesaurus into a meta system for powerful search guidance. It also integrates any specific knowledge that is stored in the information scientist's expertise, terms similarity, and any other data that was gathered in past research trials
-
Gallagher, L.; Furuta, R.; Stotts, P.D.: Increasing the power of hypertext search with relational queries (1990)
0.01
0.012754805 = product of:
0.038264416 = sum of:
0.038264416 = product of:
0.07652883 = sum of:
0.07652883 = weight(_text_:search in 4920) [ClassicSimilarity], result of:
0.07652883 = score(doc=4920,freq=4.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.43445963 = fieldWeight in 4920, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0625 = fieldNorm(doc=4920)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- Describes an SGL relational database schema for representing the objects in HyperCard, along with a technique for automatically populating this schema from a HyperCard stack using the facilities in HyperTalk with calls to the database manager. The stabndard relational database query language SQL can then be used to perform more general hypertext searches than are possible with the string search feature found in most hypertext browsing environments. These techniques, although demonstrated specially usinf HyperCard and Oracle for Macintosh, are generally applicable to a wide range of hypertext systems and relational databases
-
Savoy, J.: Effectiveness of information retrieval systems used in a hypertext environment (1993)
0.01
0.012754805 = product of:
0.038264416 = sum of:
0.038264416 = product of:
0.07652883 = sum of:
0.07652883 = weight(_text_:search in 6511) [ClassicSimilarity], result of:
0.07652883 = score(doc=6511,freq=4.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.43445963 = fieldWeight in 6511, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0625 = fieldNorm(doc=6511)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- In most hypertext systems, information retrieval techniques emphasize browsing or navigational methods which are not thorough enough to find all relevant material, especially when the number of nodes and/or links becomes very large. Reviews the main query-based search techniques currently used in hypertext environments. Explains the experimental methodology. Concentrates on the retrieval effectiveness of these retrieval strategies. Considers ways of improving search effectiveness
-
Marchionini, G.; Xia, L.; Dwiggins, S.: Efforts of search and subject expertise on information seeking in a hypertext environment (1990)
0.01
0.011716037 = product of:
0.03514811 = sum of:
0.03514811 = product of:
0.07029622 = sum of:
0.07029622 = weight(_text_:search in 4873) [ClassicSimilarity], result of:
0.07029622 = score(doc=4873,freq=6.0), product of:
0.17614716 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.050679956 = queryNorm
0.39907667 = fieldWeight in 4873, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=4873)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- As part of ongoing investigation of information seeking behaviour of end users in electronic environments, a comparison was made of those users having expertise in a topic area and those with expertise in online searching. Computer scientists and online search specialists conducted assigned searches in a HyperCard database on the topic of hypertext. Both groups of experts were able to conduct successful searches and outperformed a novice control group. Search specialists took slightly less time tahn the domain experts, modified queries by adding terms found in the text, and tended to focus on query formulation. Domain experts focused on the text and used their domain knowledge for further question answering
