Search (56 results, page 1 of 3)

0.073149405 = product of:
  0.18287352 = sum of:
    0.12771706 = weight(_text_:link in 2740) [ClassicSimilarity], result of:
      0.12771706 = score(doc=2740,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.47099498 = fieldWeight in 2740, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0625 = fieldNorm(doc=2740)
    0.055156462 = weight(_text_:22 in 2740) [ClassicSimilarity], result of:
      0.055156462 = score(doc=2740,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = 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.4 = coord(2/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

0.06400573 = product of:
  0.16001433 = sum of:
    0.111752436 = weight(_text_:link in 5860) [ClassicSimilarity], result of:
      0.111752436 = score(doc=5860,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.4121206 = fieldWeight in 5860, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5860)
    0.048261903 = weight(_text_:22 in 5860) [ClassicSimilarity], result of:
      0.048261903 = score(doc=5860,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = 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.058943924 = product of:
  0.1473598 = sum of:
    0.11288701 = weight(_text_:link in 2738) [ClassicSimilarity], result of:
      0.11288701 = score(doc=2738,freq=4.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.4163047 = fieldWeight in 2738, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2738)
    0.03447279 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
      0.03447279 = score(doc=2738,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = 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.4 = coord(2/5)

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

0.055303115 = product of:
  0.27651557 = sum of:
    0.27651557 = weight(_text_:link in 5707) [ClassicSimilarity], result of:
      0.27651557 = score(doc=5707,freq=6.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        1.0197341 = fieldWeight in 5707, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.078125 = fieldNorm(doc=5707)
  0.2 = coord(1/5)

Abstract

Examines the problems encountered when setting up a hypertext link (termed the identity link) for moving between bibliographic and full text data bases, e.g. MEDLINE and CCAL. Argues that these problems are symptomatic of deeper concerns, involving criteria and classificatory fields.

0.044242494 = product of:
  0.22121246 = sum of:
    0.22121246 = weight(_text_:link in 1209) [ClassicSimilarity], result of:
      0.22121246 = score(doc=1209,freq=6.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.8157873 = fieldWeight in 1209, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0625 = fieldNorm(doc=1209)
  0.2 = coord(1/5)

Abstract

Presents a set of high-level hypermedia features: typed nodes and links, link attributes, structure-based query, transclusion, warm and hot links, private and public linkds, external link databases, link update mechanisms, overview, trails guided tours, backtracking and history-based navigation. Illustrates each feature from existing implementations and a running scenario. Gives suggestions for implementing these on the WWW and in other information systems

0.042837612 = product of:
  0.21418805 = sum of:
    0.21418805 = weight(_text_:link in 4540) [ClassicSimilarity], result of:
      0.21418805 = score(doc=4540,freq=10.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.78988266 = fieldWeight in 4540, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          5.3287 = idf(docFreq=582, 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

0.042837612 = product of:
  0.21418805 = sum of:
    0.21418805 = weight(_text_:link in 734) [ClassicSimilarity], result of:
      0.21418805 = score(doc=734,freq=10.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.78988266 = fieldWeight in 734, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=734)
  0.2 = coord(1/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

0.039105207 = product of:
  0.19552603 = sum of:
    0.19552603 = weight(_text_:link in 6937) [ClassicSimilarity], result of:
      0.19552603 = score(doc=6937,freq=12.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.7210609 = fieldWeight in 6937, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6937)
  0.2 = coord(1/5)

Abstract

The effects of link annotations on user search performance in hypertext environments having deep (layered) and shallow link structures were investigated in this study. Four environments were tested-layered-annotated, layered-unannotated, shallow-annotated, and shallow-unannotated. A single document was divided into 48 sections, and layered and unlayered versions were created. Additional versions were created by adding annotations to the links in the layered and unlayered versions. Subjects were given three queries of varying difficulty and then asked to find the answers to the queries that were contained within the hypertext environment to which they were randomly assigned. Correspondence between the wording links and queries was used to define difficulty level. The results of the study confirmed previous research that shallow link structures are better than deep (layered) link structures. Annotations had virtually no effect on the search performance of the subjects. The subjects performed similarly in the annotated and unannotated environments, regardless of whether the link structures were shallow or deep. An analysis of question difficulty suggests that the wording in links has primacy over the wording in annotations in influencing user search behavior.

0.03831512 = product of:
  0.1915756 = sum of:
    0.1915756 = weight(_text_:link in 7116) [ClassicSimilarity], result of:
      0.1915756 = score(doc=7116,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.7064925 = fieldWeight in 7116, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.09375 = fieldNorm(doc=7116)
  0.2 = coord(1/5)

0.03831512 = product of:
  0.1915756 = sum of:
    0.1915756 = weight(_text_:link in 446) [ClassicSimilarity], result of:
      0.1915756 = score(doc=446,freq=8.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.7064925 = fieldWeight in 446, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=446)
  0.2 = coord(1/5)

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

0.03831512 = product of:
  0.1915756 = sum of:
    0.1915756 = weight(_text_:link in 4301) [ClassicSimilarity], result of:
      0.1915756 = score(doc=4301,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.7064925 = fieldWeight in 4301, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.09375 = fieldNorm(doc=4301)
  0.2 = coord(1/5)

0.036123842 = product of:
  0.18061921 = sum of:
    0.18061921 = weight(_text_:link in 5911) [ClassicSimilarity], result of:
      0.18061921 = score(doc=5911,freq=4.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.6660875 = fieldWeight in 5911, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.3287 = idf(docFreq=582, 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.033181872 = product of:
  0.16590935 = sum of:
    0.16590935 = weight(_text_:link in 764) [ClassicSimilarity], result of:
      0.16590935 = score(doc=764,freq=6.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.6118405 = fieldWeight in 764, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=764)
  0.2 = coord(1/5)

Abstract

Although the object-oriente paradigm is well suited for modelling self-contained independent objects, it is not suited for modelling persistent relations (static links) between abstract data objects. At the same time, the concept of computer-navigable links is an integral part of hypermedia paradigm. In contrast to multimedia, where the object-oriented paradigm plays a leading role, the 'static link' deficiency considerably reduces the application of object-oriented methods in hypermedia. Presents a new logical data model (the HM Data Model) which incorporates the well-known principles of object-oriented data modelling into the management of large-scale, multi-user hypermedia databases. The model is based on the notion of abstract hypermedia data objects called S-collections. Computer-navigable links approach not only overcomes the static link deficiency of the object-oriented paradigm, but also supports modularity, incremental development, and flexible versioning, and provides a solid logical basis for sematic modelling

0.033181872 = product of:
  0.16590935 = sum of:
    0.16590935 = weight(_text_:link in 1084) [ClassicSimilarity], result of:
      0.16590935 = score(doc=1084,freq=6.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.6118405 = fieldWeight in 1084, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=1084)
  0.2 = coord(1/5)

Abstract

An important stage in the process of retrieval of objects from a hypertext database is the creation of a set of internodal links that are intended to represent the relationships existing between objetcs; an operation that is usually undertaken manually such as the allocation of subject index terms to documents. Reports results of a study in which several different sets of hypertext links were inserted, each by a different person, between the paragraphs of each of a number of full text documents. The similarity between the members of each pair of link sets was then evaluated. Results indicated that little similarity existed among the link sets, a finding comparable with those of studies of inter indexer consistency, which suggests that there is generally only a low level of agreemenet between the sets of index terms assigned to a document by indexers. Concludes with that part of the study designed to test the validity of making these kinds of assumptions in the context of hypertext link sets

0.033181872 = product of:
  0.16590935 = sum of:
    0.16590935 = weight(_text_:link in 7252) [ClassicSimilarity], result of:
      0.16590935 = score(doc=7252,freq=6.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.6118405 = fieldWeight in 7252, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=7252)
  0.2 = coord(1/5)

Abstract

Current hypertext systems suffer from the limitations that they are static in nature, and they do not support the automated process of link creation very well. Studies the development of automated tools to aid in the process of link creation, browsing, and link refinement. Only relation links are considered in the study. Automated tools are developed to help in 3 main stages of developing and using hypertext applications: during authoring to generate a set of relation links between pairs of nodes; during browsing to recommends an optimal set of starting nodes for the users to begin browsing, and to guide the users at each stage of browsing by suggesting a set of 'next' nodes to trverse; and during training to modify, remove and add links based on users' feedback data. Evaluation of the training procress indicates improved effectiveness of the hyperbase to support browsing

0.031929266 = product of:
  0.15964633 = sum of:
    0.15964633 = weight(_text_:link in 3682) [ClassicSimilarity], result of:
      0.15964633 = score(doc=3682,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.58874375 = fieldWeight in 3682, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.078125 = fieldNorm(doc=3682)
  0.2 = coord(1/5)

Abstract

For authors to write and maintain large hyperdocuments, hypertext systems must provide abstractions at a higher level than a link. Presents an axample of such an abstraction: the hypertext equivalent of the procedure call with arguments. Describes why such a facility is needed, and how it has been implemented in the UNIX implementation of the Guide hypertext system

0.031929266 = product of:
  0.15964633 = sum of:
    0.15964633 = weight(_text_:link in 6495) [ClassicSimilarity], result of:
      0.15964633 = score(doc=6495,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.58874375 = fieldWeight in 6495, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.078125 = fieldNorm(doc=6495)
  0.2 = coord(1/5)

0.031929266 = product of:
  0.15964633 = sum of:
    0.15964633 = weight(_text_:link in 1169) [ClassicSimilarity], result of:
      0.15964633 = score(doc=1169,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.58874375 = fieldWeight in 1169, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.078125 = fieldNorm(doc=1169)
  0.2 = coord(1/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.031929266 = product of:
  0.15964633 = sum of:
    0.15964633 = weight(_text_:link in 4036) [ClassicSimilarity], result of:
      0.15964633 = score(doc=4036,freq=8.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.58874375 = fieldWeight in 4036, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4036)
  0.2 = coord(1/5)

Abstract

When searching information in a hypertext is limited to navigation, it is not an easy task, especially when the number of nodes and/or links becomes very large. A query based access mechanism must therefore be provided to complement the navigational tools inherent in hypertext systems. Most mechanisms currently proposed are based on conventional information retrieval models which consider documents as indepent entities, and ignore hypertext links. To promote the use of other information retrieval mechnaisms adapted to hypertext systems, responds to the following questions; how can we integrate information given by hypertext links into an information retrieval scheme; are these hypertext links (and link semantics) clues to the enhancement of retrieval effectiveness; if so, how can we use them. 2 solutions are: using a default weight function based on link tape or assigning the same strength to all link types; or using a specific weight for each particular link, i.e. the level of association or a similarity measure. Proposes an extended vector processing scheme which extracts additional information from hypertext links to enhance retrieval effectiveness. A hypertext based on 2 medium size collections, the CACM and the CISI collection has been built. The hypergraph is composed of explicit links (bibliographic references), computed links based on bibliographic information, or on hypertext links established according to document representatives (nearest neighbour)

0.03160836 = product of:
  0.1580418 = sum of:
    0.1580418 = weight(_text_:link in 145) [ClassicSimilarity], result of:
      0.1580418 = score(doc=145,freq=4.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.58282655 = fieldWeight in 145, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0546875 = fieldNorm(doc=145)
  0.2 = coord(1/5)

Abstract

Applies the ideas from the automatic link generation research to automatic text summarisation. Using techniques for inter-document link generation, generates intra-document links between passages of a document. Based on the intra-document linkage pattern of a text, characterises the structure of the text. Applies the knowledge of text structure to do automatic text summarisation by passage extraction. Evaluates a set of 50 summaries generated using these techniques by comparing the to paragraph extracts constructed by humans. The automatic summarisation methods perform well, especially in view of the fact that the summaries generates by 2 humans for the same article are surprisingly dissimilar