Search (16 results, page 1 of 1)

0.024413744 = product of:
  0.048827488 = sum of:
    0.048827488 = product of:
      0.097654976 = sum of:
        0.097654976 = weight(_text_:network in 1252) [ClassicSimilarity], result of:
          0.097654976 = score(doc=1252,freq=6.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.42611307 = fieldWeight in 1252, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1252)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

A subject gateway, in the context of network-based resource access, can be defined as some facility that allows easier access to network-based resources in a defined subject area. The simplest types of subject gateways are sets of Web pages containing lists of links to resources. Some gateways index their lists of links and provide a simple search facility. More advanced gateways offer a much enhanced service via a system consisting of a resource database and various indexes, which can be searched and/or browsed through a Web-based interface. Each entry in the database contains information about a network-based resource, such as a Web page, Web site, mailing list or document. Entries are usually created by a cataloguer manually identifying a suitable resource, describing the resource using a template, and submitting the template to the database for indexing. Subject gateways are also known as subject-based information gateways (SBIGs), subject-based gateways, subject index gateways, virtual libraries, clearing houses, subject trees, pathfinders and other variations thereof. This paper describes the characteristics of some of the subject gateways currently accessible through the Web, and compares them to automatic "vacuum cleaner" type search engines, such as AltaVista. The application of WHOIS++, centroids, query routing, and forward knowledge to searching several of these subject gateways simultaneously is outlined. The paper concludes with looking at some of the issues facing subject gateway development in the near future. The paper touches on many of the issues mentioned in a previous paper in D-Lib Magazine, especially regarding resource-discovery related initiatives and services.

0.024403011 = product of:
  0.048806023 = sum of:
    0.048806023 = product of:
      0.097612046 = sum of:
        0.097612046 = weight(_text_:22 in 6021) [ClassicSimilarity], result of:
          0.097612046 = score(doc=6021,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = queryNorm
            0.5416616 = fieldWeight in 6021, 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=6021)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Source

Ariadne. 1999, no.22

0.023920486 = product of:
  0.04784097 = sum of:
    0.04784097 = product of:
      0.09568194 = sum of:
        0.09568194 = weight(_text_:network in 919) [ClassicSimilarity], result of:
          0.09568194 = score(doc=919,freq=4.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.41750383 = fieldWeight in 919, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.046875 = fieldNorm(doc=919)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Document retrieval is a highly interactive process dealing with large amounts of information. Visual representations can provide both a means for managing the complexity of large information structures and an interface style well suited to interactive manipulation. The system we have designed utilizes visually displayed graphic structures and a direct manipulation interface style to supply an integrated environment for retrieval. A common visually displayed network structure is used for query, document content, and term relations. A query can be modified through direct manipulation of its visual form by incorporating terms from any other information structure the system displays. An associative thesaurus of terms and an inter-document network provide information about a document collection that can complement other retrieval aids. Visualization of these large data structures makes use of fisheye views and overview diagrams to help overcome some of the inherent difficulties of orientation and navigation in large information structures.

0.022552451 = product of:
  0.045104902 = sum of:
    0.045104902 = product of:
      0.090209804 = sum of:
        0.090209804 = weight(_text_:network in 3340) [ClassicSimilarity], result of:
          0.090209804 = score(doc=3340,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.3936264 = fieldWeight in 3340, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0625 = fieldNorm(doc=3340)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This article describes the Internet information retrieval protocol, Z39.50, and it's usage. The services of Z39.50 are depicted, as are some important terms related to the standard. A description of the OPAC Network in Europe (ONE), an important Z39.50 implementation project is included

0.020916866 = product of:
  0.041833732 = sum of:
    0.041833732 = product of:
      0.083667465 = sum of:
        0.083667465 = weight(_text_:22 in 8959) [ClassicSimilarity], result of:
          0.083667465 = score(doc=8959,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = queryNorm
            0.46428138 = fieldWeight in 8959, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=8959)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

16. 7.2002 20:22:55

0.020916866 = product of:
  0.041833732 = sum of:
    0.041833732 = product of:
      0.083667465 = sum of:
        0.083667465 = weight(_text_:22 in 5664) [ClassicSimilarity], result of:
          0.083667465 = score(doc=5664,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = queryNorm
            0.46428138 = fieldWeight in 5664, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=5664)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

10.11.1996 16:36:22

0.019733394 = product of:
  0.039466787 = sum of:
    0.039466787 = product of:
      0.078933574 = sum of:
        0.078933574 = weight(_text_:network in 4494) [ClassicSimilarity], result of:
          0.078933574 = score(doc=4494,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.3444231 = fieldWeight in 4494, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4494)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Although commonly used in both commercial and experimental information retrieval systems, thesauri have not demonstrated consistent benefits for retrieval performance, and it is difficult to construct a thesaurus automatically for large text databases. In this paper, an approach, called PhraseFinder, is proposed to construct collection-dependent association thesauri automatically using large full-text document collections. The association thesaurus can be accessed through natural language queries in INQUERY, an information retrieval system based on the probabilistic inference network. Experiments are conducted in INQUERY to evaluate different types of association thesauri, and thesauri constructed for a variety of collections

0.019733394 = product of:
  0.039466787 = sum of:
    0.039466787 = product of:
      0.078933574 = sum of:
        0.078933574 = weight(_text_:network in 3386) [ClassicSimilarity], result of:
          0.078933574 = score(doc=3386,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.3444231 = fieldWeight in 3386, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3386)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper reports a controlled study with statistical significance tests an five text categorization methods: the Support Vector Machines (SVM), a k-Nearest Neighbor (kNN) classifier, a neural network (NNet) approach, the Linear Leastsquares Fit (LLSF) mapping and a Naive Bayes (NB) classifier. We focus an the robustness of these methods in dealing with a skewed category distribution, and their performance as function of the training-set category frequency. Our results show that SVM, kNN and LLSF significantly outperform NNet and NB when the number of positive training instances per category are small (less than ten, and that all the methods perform comparably when the categories are sufficiently common (over 300 instances).

0.016914338 = product of:
  0.033828676 = sum of:
    0.033828676 = product of:
      0.06765735 = sum of:
        0.06765735 = weight(_text_:network in 1146) [ClassicSimilarity], result of:
          0.06765735 = score(doc=1146,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.29521978 = fieldWeight in 1146, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.046875 = fieldNorm(doc=1146)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Content

Enthält die Bemerkung: "The problems of indexing and categorization of information in principle lie within the purview of library and information science communities, but to date theirs has been a curiously low profile in the electronic realm, while various amateur brute-force indexing schemes are running dangerously amok. It would be remarkable if centuries of ostensibly relevant experience will find little applicability in the network context"

0.016914338 = product of:
  0.033828676 = sum of:
    0.033828676 = product of:
      0.06765735 = sum of:
        0.06765735 = weight(_text_:network in 1238) [ClassicSimilarity], result of:
          0.06765735 = score(doc=1238,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.29521978 = fieldWeight in 1238, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.046875 = fieldNorm(doc=1238)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The emerging network environment brings access to an increasing population of heterogeneous repositories. Inevitably, these, have quite diverse metadata vocabularies (categorization codes, classification numbers, index and thesaurus terms). So, necessarily, the number of metadata vocabularies that are accessible but unfamiliar for any individual searcher is increasing steeply. When an unfamiliar metadata vocabulary is encountered, how is a searcher to know which codes or terms will lead to what is wanted? This paper reports work at the University of California, Berkeley, on the design and development of English language indexes to metadata vocabularies. Further details and the current status of the work can be found at the project website http://www.sims.berkeley.edu/research/metadata/

0.014095282 = product of:
  0.028190564 = sum of:
    0.028190564 = product of:
      0.05638113 = sum of:
        0.05638113 = weight(_text_:network in 1261) [ClassicSimilarity], result of:
          0.05638113 = score(doc=1261,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.2460165 = fieldWeight in 1261, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1261)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

We are rapidly constructing an extensive network infrastructure for moving information across national boundaries, but much remains to be done before linguistic barriers can be surmounted as effectively as geographic ones. Users seeking information from a digital library could benefit from the ability to query large collections once using a single language, even when more than one language is present in the collection. If the information they locate is not available in a language that they can read, some form of translation will be needed. At present, multilingual thesauri such as EUROVOC help to address this challenge by facilitating controlled vocabulary search using terms from several languages, and services such as INSPEC produce English abstracts for documents in other languages. On the other hand, support for free text searching across languages is not yet widely deployed, and fully automatic machine translation is presently neither sufficiently fast nor sufficiently accurate to adequately support interactive cross-language information seeking. An active and rapidly growing research community has coalesced around these and other related issues, applying techniques drawn from several fields - notably information retrieval and natural language processing - to provide access to large multilingual collections.

0.013944578 = product of:
  0.027889157 = sum of:
    0.027889157 = product of:
      0.055778313 = sum of:
        0.055778313 = weight(_text_:22 in 1088) [ClassicSimilarity], result of:
          0.055778313 = score(doc=1088,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = queryNorm
            0.30952093 = fieldWeight in 1088, 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=1088)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Footnote

Rez. in: Cataloging and classification quarterly 19(1994) no.1, S.134-137 (M. Carpenter). - Inzwischen existiert auch eine Windows-Version: 'Electronic Dewey for Windows', vgl. Knowledge organization 22(1995) no.1, S.17

0.012201506 = product of:
  0.024403011 = sum of:
    0.024403011 = product of:
      0.048806023 = sum of:
        0.048806023 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
          0.048806023 = score(doc=2654,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = queryNorm
            0.2708308 = fieldWeight in 2654, 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=2654)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 1.2016 17:30:31

0.010458433 = product of:
  0.020916866 = sum of:
    0.020916866 = product of:
      0.041833732 = sum of:
        0.041833732 = weight(_text_:22 in 2655) [ClassicSimilarity], result of:
          0.041833732 = score(doc=2655,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = queryNorm
            0.23214069 = fieldWeight in 2655, 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=2655)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 1.2016 17:30:31

0.009866697 = product of:
  0.019733394 = sum of:
    0.019733394 = product of:
      0.039466787 = sum of:
        0.039466787 = weight(_text_:network in 1260) [ClassicSimilarity], result of:
          0.039466787 = score(doc=1260,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.17221154 = fieldWeight in 1260, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1260)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Flexible organization of information is one of the key design challenges in any digital library. For the past year, we have been working with members of the National Digital Library Project (NDLP) at the Library of Congress to build an experimental system to organize and store library collections. This is a report on the work. In particular, we describe how a few technical building blocks are used to organize the material in collections, such as the NDLP's, and how these methods fit into a general distributed computing framework. The technical building blocks are part of a framework that evolved as part of the Computer Science Technical Reports Project (CSTR). This framework is described in the paper, "A Framework for Distributed Digital Object Services", by Robert Kahn and Robert Wilensky (1995). The main building blocks are: "digital objects", which are used to manage digital material in a networked environment; "handles", which identify digital objects and other network resources; and "repositories", in which digital objects are stored. These concepts are amplified in "Key Concepts in the Architecture of the Digital Library", by William Y. Arms (1995). In summer 1995, after earlier experimental development, work began on the implementation of a full digital library system based on this framework. In addition to Kahn/Wilensky and Arms, several working papers further elaborate on the design concepts. A paper by Carl Lagoze and David Ely, "Implementation Issues in an Open Architectural Framework for Digital Object Services", delves into some of the repository concepts. The initial repository implementation was based on a paper by Carl Lagoze, Robert McGrath, Ed Overly and Nancy Yeager, "A Design for Inter-Operable Secure Object Stores (ISOS)". Work on the handle system, which began in 1992, is described in a series of papers that can be found on the Handle Home Page. The National Digital Library Program (NDLP) at the Library of Congress is a large scale project to convert historic collections to digital form and make them widely available over the Internet. The program is described in two articles by Caroline R. Arms, "Historical Collections for the National Digital Library". The NDLP itself draws on experience gained through the earlier American Memory Program. Based on this work, we have built a pilot system that demonstrates how digital objects can be used to organize complex materials, such as those found in the NDLP. The pilot was demonstrated to members of the library in July 1996. The pilot system includes the handle system for identifying digital objects, a pilot repository to store them, and two user interfaces: one designed for librarians to manage digital objects in the repository, the other for library patrons to access the materials stored in the repository. Materials from the NDLP's Coolidge Consumerism compilation have been deposited into the pilot repository. They include a variety of photographs and texts, converted to digital form. The pilot demonstrates the use of handles for identifying such material, the use of meta-objects for managing sets of digital objects, and the choice of metadata. We are now implementing an enhanced prototype system for completion in early 1997.

0.009866697 = product of:
  0.019733394 = sum of:
    0.019733394 = product of:
      0.039466787 = sum of:
        0.039466787 = weight(_text_:network in 1263) [ClassicSimilarity], result of:
          0.039466787 = score(doc=1263,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.17221154 = fieldWeight in 1263, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1263)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The Internet would not be very useful if communication were limited to textual exchanges between speakers of English located in the United States. Rather, its value lies in its ability to enable people from multiple nations, speaking multiple languages, to employ multiple media in interacting with each other. While computer networks broke through national boundaries long ago, they remain much more effective for textual communication than for exchanges of sound, images, or mixed media -- and more effective for communication in English than for exchanges in most other languages, much less interactions involving multiple languages. Supporting searching and display in multiple languages is an increasingly important issue for all digital libraries accessible on the Internet. Even if a digital library contains materials in only one language, the content needs to be searchable and displayable on computers in countries speaking other languages. We need to exchange data between digital libraries, whether in a single language or in multiple languages. Data exchanges may be large batch updates or interactive hyperlinks. In any of these cases, character sets must be represented in a consistent manner if exchanges are to succeed. Issues of interoperability, portability, and data exchange related to multi-lingual character sets have received surprisingly little attention in the digital library community or in discussions of standards for information infrastructure, except in Europe. The landmark collection of papers on Standards Policy for Information Infrastructure, for example, contains no discussion of multi-lingual issues except for a passing reference to the Unicode standard. The goal of this short essay is to draw attention to the multi-lingual issues involved in designing digital libraries accessible on the Internet. Many of the multi-lingual design issues parallel those of multi-media digital libraries, a topic more familiar to most readers of D-Lib Magazine. This essay draws examples from multi-media DLs to illustrate some of the urgent design challenges in creating a globally distributed network serving people who speak many languages other than English. First we introduce some general issues of medium, culture, and language, then discuss the design challenges in the transition from local to global systems, lastly addressing technical matters. The technical issues involve the choice of character sets to represent languages, similar to the choices made in representing images or sound. However, the scale of the language problem is far greater. Standards for multi-media representation are being adopted fairly rapidly, in parallel with the availability of multi-media content in electronic form. By contrast, we have hundreds (and sometimes thousands) of years worth of textual materials in hundreds of languages, created long before data encoding standards existed. Textual content from past and present is being encoded in language and application-specific representations that are difficult to exchange without losing data -- if they exchange at all. We illustrate the multi-language DL challenge with examples drawn from the research library community, which typically handles collections of materials in 400 or so languages. These are problems faced not only by developers of digital libraries, but by those who develop and manage any communication technology that crosses national or linguistic boundaries.