Search (170 results, page 1 of 9)

0.08744855 = product of:
  0.21862137 = sum of:
    0.0935889 = weight(_text_:retrieval in 1169) [ClassicSimilarity], result of:
      0.0935889 = score(doc=1169,freq=8.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.6684181 = fieldWeight in 1169, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.078125 = fieldNorm(doc=1169)
    0.12503247 = weight(_text_:semantic in 1169) [ClassicSimilarity], result of:
      0.12503247 = score(doc=1169,freq=4.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.64966565 = fieldWeight in 1169, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.078125 = fieldNorm(doc=1169)
  0.4 = coord(2/5)

Abstract

It is shown how the semantic content of hypertext links can be used for retrieval purposes. Indexing and retrieval algorithms are presented that exploit the link content in addition to the content of the nodes. The results of some retrieval experiments in a hypertext test collection are presented

0.07571522 = product of:
  0.18928805 = sum of:
    0.06551223 = weight(_text_:retrieval in 4715) [ClassicSimilarity], result of:
      0.06551223 = score(doc=4715,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.46789268 = fieldWeight in 4715, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.109375 = fieldNorm(doc=4715)
    0.12377582 = weight(_text_:semantic in 4715) [ClassicSimilarity], result of:
      0.12377582 = score(doc=4715,freq=2.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.64313614 = fieldWeight in 4715, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.109375 = fieldNorm(doc=4715)
  0.4 = coord(2/5)

0.07166186 = product of:
  0.11943643 = sum of:
    0.028076671 = weight(_text_:retrieval in 734) [ClassicSimilarity], result of:
      0.028076671 = score(doc=734,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.20052543 = fieldWeight in 734, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=734)
    0.075019486 = weight(_text_:semantic in 734) [ClassicSimilarity], result of:
      0.075019486 = score(doc=734,freq=4.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.38979942 = fieldWeight in 734, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.046875 = fieldNorm(doc=734)
    0.01634027 = product of:
      0.03268054 = sum of:
        0.03268054 = weight(_text_:web in 734) [ClassicSimilarity], result of:
          0.03268054 = score(doc=734,freq=2.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.21634221 = fieldWeight in 734, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=734)
      0.5 = coord(1/2)
  0.6 = coord(3/5)

Abstract

Most existing hypermedia authoring systems incorporate facilities for the creation of static links between pieces of information, termed nodes. Such links usually support only browsing activities over the hypermedia web, carrying little or no information about the conceptual relationship the nodes might have. Thus indecision occurs: the reader of the hypermedia can traverse a link but has no indication what link to choose and what he might expect from the traversal. At the same time, the creation of these links requires a great effort from the author, moreover if there are certain criteria that guide linking. This paper presents a two-layered hypermedia semantic model that enriches the semantic links, and alsoprovides the means for dynamic link creation. To accomplish these objectives, we adopt the use of fuzzy set theory and fuzzy logic as the mathematical framework for link characterization and dynamic link creation. Some aspects of a prototype system, named Platon, are also presented

Source

Hypertext - Information Retrieval - Multimedia '97: Theorien, Modelle und Implementierungen integrierter elektronischer Informationssysteme. Proceedings HIM '97. Hrsg.: N. Fuhr u.a

0.06388288 = product of:
  0.1597072 = sum of:
    0.06188791 = weight(_text_:semantic in 5860) [ClassicSimilarity], result of:
      0.06188791 = score(doc=5860,freq=2.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.32156807 = fieldWeight in 5860, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5860)
    0.09781929 = sum of:
      0.053920146 = weight(_text_:web in 5860) [ClassicSimilarity], result of:
        0.053920146 = score(doc=5860,freq=4.0), product of:
          0.15105948 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.04628742 = queryNorm
          0.35694647 = fieldWeight in 5860, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0546875 = fieldNorm(doc=5860)
      0.043899145 = weight(_text_:22 in 5860) [ClassicSimilarity], result of:
        0.043899145 = score(doc=5860,freq=2.0), product of:
          0.16209066 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04628742 = queryNorm
          0.2708308 = fieldWeight in 5860, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=5860)
  0.4 = coord(2/5)

Abstract

Richer graph models permit authors to 'program' the browsing behaviour they want WWW readers to see by turning the hypertext into a hyperprogram with specific semantics. Multiple browsing streams can be started under the author's control and then kept in step through the synchronization mechanisms provided by the graph model. Adds a Semantic Web Graph Layer (SWGL) which allows dynamic interpretation of link and node structures according to graph models. Details the SWGL and its architecture, some sample protocol implementations, and the latest extensions to MHTML

Date

1. 8.1996 22:08:06

0.054756757 = product of:
  0.13689189 = sum of:
    0.05304678 = weight(_text_:semantic in 3968) [ClassicSimilarity], result of:
      0.05304678 = score(doc=3968,freq=2.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.2756298 = fieldWeight in 3968, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.046875 = fieldNorm(doc=3968)
    0.08384511 = sum of:
      0.046217266 = weight(_text_:web in 3968) [ClassicSimilarity], result of:
        0.046217266 = score(doc=3968,freq=4.0), product of:
          0.15105948 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.04628742 = queryNorm
          0.3059541 = fieldWeight in 3968, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.046875 = fieldNorm(doc=3968)
      0.03762784 = weight(_text_:22 in 3968) [ClassicSimilarity], result of:
        0.03762784 = score(doc=3968,freq=2.0), product of:
          0.16209066 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04628742 = queryNorm
          0.23214069 = fieldWeight in 3968, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=3968)
  0.4 = coord(2/5)

Abstract

We present a declarative language for the construction of hypertext views on databases. The language is based on an object-oriented data model and a simple hypertext model with reference and inclusion links. A hypertext view specification consists in a collection of parameterized node schemes which specify how to construct node and links instances from the database contents. We show how this language can express different issues in hypertext view design. These include: the direct mapping of objects to nodes; the construction of complex nodes based on sets of objects; the representation of polymorphic sets of objects; and the representation of tree and graph structures. We have defined sublanguages corresponding to particular database models (relational, semantic, object-oriented) and implemented tools to generate Web views for these database models

Date

21.10.2000 15:01:22

Source

The World Wide Web and Databases: International Workshop WebDB'98, Valencia, Spain, March 27-28, 1998, Selected papers. Eds.: P. Atzeni et al

0.049968686 = product of:
  0.08328114 = sum of:
    0.023397226 = weight(_text_:retrieval in 633) [ClassicSimilarity], result of:
      0.023397226 = score(doc=633,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.16710453 = fieldWeight in 633, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=633)
    0.04420565 = weight(_text_:semantic in 633) [ClassicSimilarity], result of:
      0.04420565 = score(doc=633,freq=2.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.22969149 = fieldWeight in 633, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.0390625 = fieldNorm(doc=633)
    0.015678266 = product of:
      0.031356532 = sum of:
        0.031356532 = weight(_text_:22 in 633) [ClassicSimilarity], result of:
          0.031356532 = score(doc=633,freq=2.0), product of:
            0.16209066 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04628742 = queryNorm
            0.19345059 = fieldWeight in 633, 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=633)
      0.5 = coord(1/2)
  0.6 = coord(3/5)

Abstract

Considering the characteristics of hypertext systems and problems such as cognitive overload and the disorientation of users, this project studies subject hypertext documents that have undergone conceptual structuring using facets for content representation and improvement of information retrieval during navigation. The main objective was to assess the possibility of the application of topic map technology for automating the compatibilization process of these structures. For this purpose, two dissertations from the UFMG Information Science Post-Graduation Program were adopted as samples. Both dissertations had been duly analyzed and structured on the MHTX (Hypertextual Map) prototype database. The faceted structures of both dissertations, which had been represented in conceptual maps, were then converted into topic maps. It was then possible to use the merge property of the topic maps to promote the semantic interrelationship between the maps and, consequently, between the hypertextual information resources proper. The merge results were then analyzed in the light of theories dealing with the compatibilization of languages developed within the realm of information technology and librarianship from the 1960s on. The main goals accomplished were: (a) the detailed conceptualization of the merge process of the topic maps, considering the possible compatibilization levels and the applicability of this technology in the integration of faceted structures; and (b) the production of a detailed sequence of steps that may be used in the implementation of topic maps based on faceted structures.

Date

22. 2.2013 11:39:23

0.04873186 = product of:
  0.08121976 = sum of:
    0.023397226 = weight(_text_:retrieval in 4119) [ClassicSimilarity], result of:
      0.023397226 = score(doc=4119,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.16710453 = fieldWeight in 4119, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4119)
    0.04420565 = weight(_text_:semantic in 4119) [ClassicSimilarity], result of:
      0.04420565 = score(doc=4119,freq=2.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.22969149 = fieldWeight in 4119, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4119)
    0.013616893 = product of:
      0.027233787 = sum of:
        0.027233787 = weight(_text_:web in 4119) [ClassicSimilarity], result of:
          0.027233787 = score(doc=4119,freq=2.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.18028519 = fieldWeight in 4119, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4119)
      0.5 = coord(1/2)
  0.6 = coord(3/5)

Abstract

Considering repositories of web documents that are semantically linked and created in a collaborative fashion, as in the case of Wikipedia, a key problem faced by content providers is the placement of links in the articles. These links must support user navigation and provide a deeper semantic interpretation of the content. Current wikification methods exploit machine learning techniques to capture characteristics of the concepts and its associations. In previous work, we proposed a preliminary prediction model combining traditional predictors with a latent component which captures the concept graph topology by means of matrix factorization. In this work, we provide a detailed description of our method and a deeper comparison with a state-of-the-art wikification method using a sample of Wikipedia and report a gain up to 13% in F1 score. We also provide a comprehensive analysis of the model performance showing the importance of the latent predictor component and the attributes derived from the associations between the concepts. Moreover, we include an analysis that allows us to conclude that the model is resilient to ambiguity without including a disambiguation phase. We finally report the positive impact of selecting training samples from specific content quality classes.

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.043265842 = product of:
  0.1081646 = sum of:
    0.03743556 = weight(_text_:retrieval in 5227) [ClassicSimilarity], result of:
      0.03743556 = score(doc=5227,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.26736724 = fieldWeight in 5227, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=5227)
    0.07072904 = weight(_text_:semantic in 5227) [ClassicSimilarity], result of:
      0.07072904 = score(doc=5227,freq=2.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.36750638 = fieldWeight in 5227, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.0625 = fieldNorm(doc=5227)
  0.4 = coord(2/5)

Abstract

The disciplines of human-computer interaction, computer-supported collaborative work, information storage and retrieval, and artificial intelligence should complement one another in the new discipline of hypertext. This holistic view of hypertext focuses on links: links within a document (microtext), links among documents (macrotext), links among people (grouptext), and dynamic links (expertext). The principles and systems which are relevant to creating and accessing hypertext can be usefully presented under the heading of text, microtext, macrotext, grouptext and expertext. From text to expertext, people consistently use hierarchical structures, particularly hierarchical semantic nets, to organize information

0.041372593 = product of:
  0.10343148 = sum of:
    0.05673526 = weight(_text_:retrieval in 975) [ClassicSimilarity], result of:
      0.05673526 = score(doc=975,freq=6.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.40520695 = fieldWeight in 975, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=975)
    0.046696216 = product of:
      0.09339243 = sum of:
        0.09339243 = weight(_text_:web in 975) [ClassicSimilarity], result of:
          0.09339243 = score(doc=975,freq=12.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.6182494 = fieldWeight in 975, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0546875 = fieldNorm(doc=975)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

This book constitutes a coherent anthology consisting of invited chapter-length papers on intelligent hypertext techniques with special emphasis on how to apply these techniques to the WWW. The book provides an introductory preface, chapters on information comprehension through hypertext, efficient techniques for adaptive hypermedia, annotated 3D environments on the Web, user models for customized hypertext, conceptual analysis of hypertext, two-level models of hypertext, the TELLTALE dynamic hypertext environment, hypertext for collaborative authoring, information retrieval and information agents

LCSH

World Wide Web (Information retrieval system)

RSWK

World wide web / Hypertext / Aufsatzsammlung (213)

Subject

World Wide Web (Information retrieval system)
World wide web / Hypertext / Aufsatzsammlung (213)

0.04132867 = product of:
  0.10332167 = sum of:
    0.075019486 = weight(_text_:semantic in 1068) [ClassicSimilarity], result of:
      0.075019486 = score(doc=1068,freq=4.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.38979942 = fieldWeight in 1068, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.046875 = fieldNorm(doc=1068)
    0.028302183 = product of:
      0.056604367 = sum of:
        0.056604367 = weight(_text_:web in 1068) [ClassicSimilarity], result of:
          0.056604367 = score(doc=1068,freq=6.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.37471575 = fieldWeight in 1068, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=1068)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

Interactive dynamic maps (IDMs) help users interactively explore webs of hypermedia documents. IDMs provide automatically generated abstract graphical views at different levels of granularity. Visual cues give users a better understanding of the content of the web, which results in better navigation control and more accurate and effective expressions of queries. IDMs consist of: topic maps, which provide visual abstractions of the semantic content of a web documents and document maps, which provide visual abstractions of subsets of documents. The major contribution of this work include: automatique techniques for building maps directly from a web of documents, including extraction of semantic content and use of a spatial metaphor for generating layout and filing space, a direct manipulation interaction paradigm for exploring webs of documents, using maps and an integrated graphical query language, and the ability to use the maps themselves as documents that can be customized, stored in a library and shared among users

0.03785761 = product of:
  0.094644025 = sum of:
    0.032756116 = weight(_text_:retrieval in 3259) [ClassicSimilarity], result of:
      0.032756116 = score(doc=3259,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.23394634 = fieldWeight in 3259, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3259)
    0.06188791 = weight(_text_:semantic in 3259) [ClassicSimilarity], result of:
      0.06188791 = score(doc=3259,freq=2.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.32156807 = fieldWeight in 3259, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3259)
  0.4 = coord(2/5)

Abstract

When designing hypertext structure the folowing must be considered: semantic structure of the presented knowledge, strucutre for the user considering his information needs, knowledge and the way he will use the hypertext to access information; and rhetoric structure. Non-hierarchical links between hypertext nodes created on the basis of extralinguistic non-specified associative relations might cause a decrease in recall and retrieval of information. In order to leiminate such defects, suggests the implementation of specified associative relations marked in the thesaurus to define adequate associative links in the hypertext

0.036543902 = product of:
  0.09135976 = sum of:
    0.075019486 = weight(_text_:semantic in 451) [ClassicSimilarity], result of:
      0.075019486 = score(doc=451,freq=4.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.38979942 = fieldWeight in 451, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.046875 = fieldNorm(doc=451)
    0.01634027 = product of:
      0.03268054 = sum of:
        0.03268054 = weight(_text_:web in 451) [ClassicSimilarity], result of:
          0.03268054 = score(doc=451,freq=2.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.21634221 = fieldWeight in 451, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=451)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

This research is focused on the continuation of the Hypertext Map prototype implementation - MHTX, proposed by Lima, (2004), with the general objective of transforming the MHTX into a semantic content management product facilitating navigation in context supported by customizable software that is easy to use, through high end desktop/web interfaces that sustain the operation of its functions. Besides, these studies aim, in the long run, to achieve the simplification of the information organization, access and recovery processes in digital libraries, making archive management by authors, content managers and information professionals possible.

0.035970207 = product of:
  0.08992552 = sum of:
    0.064840294 = weight(_text_:retrieval in 187) [ClassicSimilarity], result of:
      0.064840294 = score(doc=187,freq=6.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.46309367 = fieldWeight in 187, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=187)
    0.025085226 = product of:
      0.05017045 = sum of:
        0.05017045 = weight(_text_:22 in 187) [ClassicSimilarity], result of:
          0.05017045 = score(doc=187,freq=2.0), product of:
            0.16209066 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04628742 = 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.5 = coord(1/2)
  0.4 = coord(2/5)

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

0.03281058 = product of:
  0.1640529 = sum of:
    0.1640529 = sum of:
      0.076254606 = weight(_text_:web in 6562) [ClassicSimilarity], result of:
        0.076254606 = score(doc=6562,freq=2.0), product of:
          0.15105948 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.04628742 = queryNorm
          0.50479853 = fieldWeight in 6562, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.109375 = fieldNorm(doc=6562)
      0.08779829 = weight(_text_:22 in 6562) [ClassicSimilarity], result of:
        0.08779829 = score(doc=6562,freq=2.0), product of:
          0.16209066 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04628742 = queryNorm
          0.5416616 = fieldWeight in 6562, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.109375 = fieldNorm(doc=6562)
  0.2 = coord(1/5)

Date

22. 2.1997 19:40:31

0.03163099 = product of:
  0.15815495 = sum of:
    0.15815495 = weight(_text_:semantic in 5911) [ClassicSimilarity], result of:
      0.15815495 = score(doc=5911,freq=10.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.8217693 = fieldWeight in 5911, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.0625 = fieldNorm(doc=5911)
  0.2 = coord(1/5)

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

0.030497748 = product of:
  0.07624437 = sum of:
    0.03970641 = weight(_text_:retrieval in 687) [ClassicSimilarity], result of:
      0.03970641 = score(doc=687,freq=4.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.2835858 = fieldWeight in 687, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=687)
    0.03653796 = product of:
      0.07307592 = sum of:
        0.07307592 = weight(_text_:web in 687) [ClassicSimilarity], result of:
          0.07307592 = score(doc=687,freq=10.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.48375595 = fieldWeight in 687, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=687)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

LCSH

World Wide Web (Information retrieval system)

RSWK

World wide web

Subject

World wide web
World Wide Web (Information retrieval system)

0.028629994 = product of:
  0.071574986 = sum of:
    0.052317787 = weight(_text_:retrieval in 1427) [ClassicSimilarity], result of:
      0.052317787 = score(doc=1427,freq=10.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.37365708 = fieldWeight in 1427, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1427)
    0.019257195 = product of:
      0.03851439 = sum of:
        0.03851439 = weight(_text_:web in 1427) [ClassicSimilarity], result of:
          0.03851439 = score(doc=1427,freq=4.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.25496176 = fieldWeight in 1427, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1427)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

Fast, effective, and adaptable techniques are needed to automatically organize and retrieve information an the ever-increasing World Wide Web. In that respect, different strategies have been suggested to take hypertext links into account. For example, hyperlinks have been used to (1) enhance document representation, (2) improve document ranking by propagating document score, (3) provide an indicator of popularity, and (4) find hubs and authorities for a given topic. Although the TREC experiments have not demonstrated the usefulness of hyperlinks for retrieval, the hypertext structure is nevertheless an essential aspect of the Web, and as such, should not be ignored. The development of abstract models of the IR task was a key factor to the improvement of search engines. However, at this time conceptual tools for modeling the hypertext retrieval task are lacking, making it difficult to compare, improve, and reason an the existing techniques. This article proposes a general model for using hyperlinks based an Probabilistic Argumentation Systems, in which each of the above-mentioned techniques can be stated. This model will allow to discover some inconsistencies in the mentioned techniques, and to take a higher level and systematic approach for using hyperlinks for retrieval.

Footnote

Beitrag eines Themenheftes: Mathematical, logical, and formal methods in information retrieval

0.025128586 = product of:
  0.12564293 = sum of:
    0.12564293 = sum of:
      0.07547248 = weight(_text_:web in 2740) [ClassicSimilarity], result of:
        0.07547248 = score(doc=2740,freq=6.0), product of:
          0.15105948 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.04628742 = queryNorm
          0.49962097 = fieldWeight in 2740, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0625 = fieldNorm(doc=2740)
      0.05017045 = weight(_text_:22 in 2740) [ClassicSimilarity], result of:
        0.05017045 = score(doc=2740,freq=2.0), product of:
          0.16209066 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04628742 = queryNorm
          0.30952093 = fieldWeight in 2740, 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=2740)
  0.2 = coord(1/5)

Abstract

Discusses the varieties of link information on the WWW, how the Web differs from conventional hypertext, and how the links can be exploited to build useful applications. Specific applications presented as part of the ParaSite system find individuals' homepages, new locations of moved pages and unindexed information

Date

1. 8.1996 22:08:06

Footnote

Contribution to a special issue of papers from the 6th International World Wide Web conference, held 7-11 Apr 1997, Santa Clara, California

0.025008315 = product of:
  0.06252079 = sum of:
    0.03743556 = weight(_text_:retrieval in 3558) [ClassicSimilarity], result of:
      0.03743556 = score(doc=3558,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.26736724 = fieldWeight in 3558, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=3558)
    0.025085226 = product of:
      0.05017045 = sum of:
        0.05017045 = weight(_text_:22 in 3558) [ClassicSimilarity], result of:
          0.05017045 = score(doc=3558,freq=2.0), product of:
            0.16209066 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04628742 = queryNorm
            0.30952093 = fieldWeight in 3558, 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=3558)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

The history of encyclopedias and wholly new forms of encyclopedias are briefly reviewed. The possibilities and problems that hypertext presents as a basis for new forms of encyclopedias are explored. The capabilities of current systems, both experimental and commercially available, are outlined, focusing on new possibilities for authoring and design and for reading the retrieval. Examples of applications already making use of hypertext are given.

Date

7. 1.1996 22:47:52

0.023723243 = product of:
  0.118616216 = sum of:
    0.118616216 = weight(_text_:semantic in 4540) [ClassicSimilarity], result of:
      0.118616216 = score(doc=4540,freq=10.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.616327 = fieldWeight in 4540, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.046875 = fieldNorm(doc=4540)
  0.2 = coord(1/5)

Abstract

The Many Using and Creating Hypermedia (MUCH) systems is based on the Dexter model and treats the storage layer as a semantic net. The MUCH system provides a numer of recommended link types for representing application domain concepts, such as thesauri, documents and annotations. users of the system are expected to use those link types in the course of authoring meaningful hypermedia. based on the logs of usage of the MUCH system over 2 years by over 200 people, contrary to the designers' expectations, users did not exploit the ability to type semantic links. Typically authors used the default link type regardless of their semantic intentions. When a link type other than the default type was chosen, that choice was often inconsistent with the way another user would able a similar link. The system has proven to be useful for authoring conventional documents. Authors, however, were not practically able to produce hypertext documents. Based on these experiences a new system, RICH (Reusable Intelligent Collaborative Hypermedia), has been designed and built which emphasizes rules for typing links and maintaining the integrity of the semantic net