Search (19 results, page 1 of 1)

  • × year_i:[1990 TO 2000}
  • × theme_ss:"Klassifikationssysteme im Online-Retrieval"
  1. Kwasnik, B.H.: ¬The role of classification in knowledge representation (1999) 0.06 
    0.062227696 = product of:
  0.093341544 = sum of:
    0.072989546 = weight(_text_:citation in 2464) [ClassicSimilarity], result of:
      0.072989546 = score(doc=2464,freq=2.0), product of:
        0.23479973 = queryWeight, product of:
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.050071523 = queryNorm
        0.31085873 = fieldWeight in 2464, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.046875 = fieldNorm(doc=2464)
    0.020351999 = product of:
      0.040703997 = sum of:
        0.040703997 = weight(_text_:22 in 2464) [ClassicSimilarity], result of:
          0.040703997 = score(doc=2464,freq=2.0), product of:
            0.17534193 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050071523 = queryNorm
            0.23214069 = fieldWeight in 2464, 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=2464)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    A fascinating, broad-ranging article about classification, knowledge, and how they relate. Hierarchies, trees, paradigms (a two-dimensional classification that can look something like a spreadsheet), and facets are covered, with descriptions of how they work and how they can be used for knowledge discovery and creation. Kwasnick outlines how to make a faceted classification: choose facets, develop facets, analyze entities using the facets, and make a citation order. Facets are useful for many reasons: they do not require complete knowledge of the entire body of material; they are hospitable, flexible, and expressive; they do not require a rigid background theory; they can mix theoretical structures and models; and they allow users to view things from many perspectives. Facets do have faults: it can be hard to pick the right ones; it is hard to show relations between them; and it is difficult to visualize them. The coverage of the other methods is equally thorough and there is much to consider for anyone putting a classification on the web.
    Source
    Library trends. 48(1999) no.1, S.22-47
  2. Ardo, A.; Lundberg, S.: ¬A regional distributed WWW search and indexing service : the DESIRE way (1998) 0.04 
    0.04344636 = product of:
  0.13033907 = sum of:
    0.13033907 = sum of:
      0.089635074 = weight(_text_:index in 4190) [ClassicSimilarity], result of:
        0.089635074 = score(doc=4190,freq=4.0), product of:
          0.21880072 = queryWeight, product of:
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.050071523 = queryNorm
          0.40966535 = fieldWeight in 4190, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.046875 = fieldNorm(doc=4190)
      0.040703997 = weight(_text_:22 in 4190) [ClassicSimilarity], result of:
        0.040703997 = score(doc=4190,freq=2.0), product of:
          0.17534193 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050071523 = queryNorm
          0.23214069 = fieldWeight in 4190, 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=4190)
  0.33333334 = coord(1/3)
    Abstract
    Creates an open, metadata aware system for distributed, collaborative WWW indexing. The system has 3 main components: a harvester (for collecting information), a database (for making the collection searchable), and a user interface (for making the information available). all components can be distributed across networked computers, thus supporting scalability. The system is metadata aware and thus allows searches on several fields including title, document author and URL. Nordic Web Index (NWI) is an application using this system to create a regional Nordic Web-indexing service. NWI is built using 5 collaborating service points within the Nordic countries. The NWI databases can be used to build additional services
    Date
    1. 8.1996 22:08:06
    Object
    Nordic Web Index
  3. Heiser, W.J.: Zoeken in de bibliografische ruimte : de bijzondere rol van de hierarchische classificaties bij geautomatiseerde onderwerpsontsluiting (1993) 0.03 
    0.028384823 = product of:
  0.08515447 = sum of:
    0.08515447 = weight(_text_:citation in 3121) [ClassicSimilarity], result of:
      0.08515447 = score(doc=3121,freq=2.0), product of:
        0.23479973 = queryWeight, product of:
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.050071523 = queryNorm
        0.3626685 = fieldWeight in 3121, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3121)
  0.33333334 = coord(1/3)
    Abstract
    The universal classification schemes developed in the 19th century are a direct response to the social changes of that era. However, the increasing use of automation in libraries has highlighted the need fir greater precision in hierarchical structures. A thesaurus of used and related headings can be employed to show the spatial relationship of semantic terms. The resulting search profile can be further enhanced by the addition of citation weighting. To assist users to define searches more accurately libraries using large general classification schemes should consider adding supplementary classification data to records
  4. Gödert, W.: Facettenklassifikation im Online-Retrieval (1992) 0.03 
    0.028384823 = product of:
  0.08515447 = sum of:
    0.08515447 = weight(_text_:citation in 4574) [ClassicSimilarity], result of:
      0.08515447 = score(doc=4574,freq=2.0), product of:
        0.23479973 = queryWeight, product of:
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.050071523 = queryNorm
        0.3626685 = fieldWeight in 4574, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4574)
  0.33333334 = coord(1/3)
    Abstract
    Facettenklassifikationen wurden bislang vorwiegend im Hinblick auf ihre Verwendungsmöglichkeiten in präkombinierten systematischen Katalogen bzw. Bibliographien betrachtet, nicht so sehr unter dem Aspekt eines möglichen Einsatzes in postkoordinierenden Retrievalsystemen. Im vorliegenden Beitrag soll nachgewiesen werden, daß Facettenklassifikationen anderen Techniken des Online Retrievals überlegen sein können. Hierzu sollten Begriffs- und Facettenanalyse mit einem strukturabbildenden Notationssystem kombiniert werden, um mit Hilfe Boolescher Operatoren (zur Verknüpfung von Facetten unabhängig von einer definierten Citation order) und Truncierung hierarchisch differenzierte Dokumentenmengen für komplexe Fragestellungen zu erhalten. Die Methode wird an zwei Beispielen illustriert: das erste nutzt eine kleine, von B. Buchanan entwickelte Klassifikation, das zweite das für Library and Information Science Abstracts (LISA) verwendete Klassifikationssystem. Weiter wird am Beispiel PRECIS diskutiert, welche Möglichkeiten des syntaktischen Retrievals Rollenoperatoren bieten können.
  5. Broadbent, E.: Classification access in the online catalog (1995) 0.02 
    0.02112719 = product of:
  0.06338157 = sum of:
    0.06338157 = product of:
      0.12676314 = sum of:
        0.12676314 = weight(_text_:index in 5571) [ClassicSimilarity], result of:
          0.12676314 = score(doc=5571,freq=8.0), product of:
            0.21880072 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.050071523 = queryNorm
            0.5793543 = fieldWeight in 5571, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.046875 = fieldNorm(doc=5571)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    With the development during the last few years of the USMARC Format for Classification Data, the potential for improving call number browsing in online catalogs has increased dramatically. For example, it is now possible to create various types of indexes to classification numbers in the online catalog. Two types of possible indexes, a chain index and an index using Library of Congress subject headings as an index to the Library of Congress classification are discussed and examples given in appendices. It is also noted that these two indexes are only two of various forms an online index to classification numbers could take.
  6. McIlwaine, I.C.: New wine in old bottles : problems of maintaining classification schemes (1996) 0.02 
    0.020274874 = product of:
  0.06082462 = sum of:
    0.06082462 = weight(_text_:citation in 5168) [ClassicSimilarity], result of:
      0.06082462 = score(doc=5168,freq=2.0), product of:
        0.23479973 = queryWeight, product of:
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.050071523 = queryNorm
        0.25904894 = fieldWeight in 5168, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5168)
  0.33333334 = coord(1/3)
    Abstract
    Editors of long-standing classifications have to adopt their schemes to totally different circumstances from those they were originally designed to suit. The need to retrieve information accurately in an online environment and a world dominated by the Internet is vital and contrasts with the basic linear approach for which these classifications were intended. The latter need still has to be satisfied, so ways of achieving both goals must be explored. The need for greater synthesis, clearly defined factes, with distinctive notation and a closely adhered to citation order is essential. An expressive notation is attractive in an online environmen. Modern educational approaches make traditional structures meaningless and the current economic climate and expense of developing new publication formats is reducing revision budgets. Co-operation between editors and the use of one scheme, e.g. DDC, as a switching language between other schemes, e.g., UDC, thesauri and subject headings lists are one way forward. Existing co-operative projects and future plans between the editors of DDC, UDC and BC2 are discussed and the complementing of classification by a thesaurus is recommended
  7. Van der Walt, M.: ¬The structure of classification schemes used in Internet search engines (1998) 0.02 
    0.020274874 = product of:
  0.06082462 = sum of:
    0.06082462 = weight(_text_:citation in 84) [ClassicSimilarity], result of:
      0.06082462 = score(doc=84,freq=2.0), product of:
        0.23479973 = queryWeight, product of:
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.050071523 = queryNorm
        0.25904894 = fieldWeight in 84, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.0390625 = fieldNorm(doc=84)
  0.33333334 = coord(1/3)
    Abstract
    The purpose of this paper is to determine some of the structural features of the classification schemes used in the directories (guides, channels) of search engines to organise information sources on the Internet. Ten search engines were examined at the main class level and the full hierarchies of a sample of three specific subjects were analysed in four of these engines, namely Excite, Infoseek, Lycos and Yahoo! It was found that there are major differences between the main classes of the search engines and those found in standard library schemes like Dewey, UDC and LCC. There are large gaps in subject coverage at main class level in the search engines and the general tendency is to use a topic-based approach in the formation of classes, rather than a discipline-based approach. The subdivision of the main classes is according to hierarchical tree structures, but a number of anomalies in this regard were identified. Another deviation from library classification theory is that various principles of division are employed to form classes at the same hierarchical level. In an analysis of citation orders many examples were found that conform to the principles followed in library classifications, but a number of inconsistencies in this regard were also noted
  8. Gödert, W.: Facet classification in online retrieval (1991) 0.02 
    0.020274874 = product of:
  0.06082462 = sum of:
    0.06082462 = weight(_text_:citation in 5825) [ClassicSimilarity], result of:
      0.06082462 = score(doc=5825,freq=2.0), product of:
        0.23479973 = queryWeight, product of:
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.050071523 = queryNorm
        0.25904894 = fieldWeight in 5825, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6892867 = idf(docFreq=1104, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5825)
  0.33333334 = coord(1/3)
    Abstract
    The study of faceted classification systems has primarily been directed towards application for precombined catalogues or bibliographies, not so much for use in post coordinated retrieval systems. Argues that faceted classification systems in some respects are superior to other techniques of on-line retrieval as far as facet and concept analysis is combined with an expressive notational system in order to guide a form of retrieval which will use Boolean operators (for combining the facets regardless of one special citation order) and truncation for retrieving hierarchically different sets of documents. This point of view is demonstrated by 2 examples. The 1st one uses a short classification system derived from B. Buchanan and the 2nd is built upon the classification system used by Library and Information Science Abstracts (LISA). Further discussion is concerned with some possible consequences which could be derived from a retrieval with PRECIS strings
  9. Kinsella, J.: Classification and the OPAC (1992) 0.02 
    0.017605992 = product of:
  0.052817974 = sum of:
    0.052817974 = product of:
      0.10563595 = sum of:
        0.10563595 = weight(_text_:index in 3903) [ClassicSimilarity], result of:
          0.10563595 = score(doc=3903,freq=2.0), product of:
            0.21880072 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.050071523 = queryNorm
            0.48279524 = fieldWeight in 3903, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.078125 = fieldNorm(doc=3903)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Source
    Catalogue and index. 1992, nos.105/106, S.1,3-10
  10. Svenonius, E.; Liu, S.; Subrahmanyam, B.: Automation of chain indexing (1992) 0.01 
    0.01493918 = product of:
  0.044817537 = sum of:
    0.044817537 = product of:
      0.089635074 = sum of:
        0.089635074 = weight(_text_:index in 2114) [ClassicSimilarity], result of:
          0.089635074 = score(doc=2114,freq=4.0), product of:
            0.21880072 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.050071523 = queryNorm
            0.40966535 = fieldWeight in 2114, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.046875 = fieldNorm(doc=2114)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    The last several years have seen the evolution of prototype systems exploiting the use of the Dewey Decimal Classification (DDC) as an interface to online catalogs. One such system, calles DORS (Dewy Online Retrieval System) was developed at the University of California, Los Angeles by the authors. The feature distinguishing this system is an automatically generated chain index, in particular the algorithms that were created for its automatic generation and the problems that were encountered. The problems were of three kinds: those that were overcome, but were not for lack of time and resources and those that we believe cannot be overcome. The paper concludes with suggestions for future resaerch and possible formatting changes to the DDC feature headings that would facilitate chain-index generation
  11. Liu, S.; Svenonius, E.: DORS: DDC online retrieval system (1991) 0.01 
    0.014084793 = product of:
  0.042254377 = sum of:
    0.042254377 = product of:
      0.084508754 = sum of:
        0.084508754 = weight(_text_:index in 1155) [ClassicSimilarity], result of:
          0.084508754 = score(doc=1155,freq=2.0), product of:
            0.21880072 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.050071523 = queryNorm
            0.3862362 = fieldWeight in 1155, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0625 = fieldNorm(doc=1155)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    A model system, the Dewey Online Retrieval System (DORS), was implemented as an interface to an online catalog for the purpose of experimenting with classification-based search strategies and generally seeking further understanding of the role of traditional classifications in automated information retrieval. Specifications for a classification retrieval interface were enumerated and rationalized and the system was developed in accordance with them. The feature that particularly distinguishes the system and enables it to meet its stated specifications is an automatically generated chain index
  12. Mitchell, J.S.: In this age of WWW is classification redundant? (1998) 0.01 
    0.014084793 = product of:
  0.042254377 = sum of:
    0.042254377 = product of:
      0.084508754 = sum of:
        0.084508754 = weight(_text_:index in 5443) [ClassicSimilarity], result of:
          0.084508754 = score(doc=5443,freq=2.0), product of:
            0.21880072 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.050071523 = queryNorm
            0.3862362 = fieldWeight in 5443, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0625 = fieldNorm(doc=5443)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Source
    Catalogue and index. 1998, no.127, S.5
  13. Comaromi, C.L.: Summation of classification as an enhancement of intellectual access to information in an online environment (1990) 0.01 
    0.011306668 = product of:
  0.03392 = sum of:
    0.03392 = product of:
      0.06784 = sum of:
        0.06784 = weight(_text_:22 in 3576) [ClassicSimilarity], result of:
          0.06784 = score(doc=3576,freq=2.0), product of:
            0.17534193 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050071523 = queryNorm
            0.38690117 = fieldWeight in 3576, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=3576)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    8. 1.2007 12:22:40
  14. Cochrane, P.A.; Johnson, E.H.: Visual Dewey : DDC in a hypertextual browser for the library user (1996) 0.01 
    0.008802996 = product of:
  0.026408987 = sum of:
    0.026408987 = product of:
      0.052817974 = sum of:
        0.052817974 = weight(_text_:index in 5163) [ClassicSimilarity], result of:
          0.052817974 = score(doc=5163,freq=2.0), product of:
            0.21880072 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.050071523 = queryNorm
            0.24139762 = fieldWeight in 5163, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5163)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    A new design for the DDC allows for display of the schedules and indexes in a hypertextual browser which was originally designed for the more conventional thesaurus with BT-NT, RT and USE-UF relations. Features of the DDC which approxumate those relations and the presentation of the rich vocabulary found in the hierarchical structure, captions, index entries and notes are represented for the library user's perusal and choice before searching a library's holdings. By dragging and dropping parts from such a display into a search window, the search for bibliographic items can begin and revised painlessly. Information such as class numbers of subject headings for retrieved items can be dragged and dropped into the searchw indow of the Visual Dewey display window as it suits the user to review vocabulary or revise the search results. This seamless to-ing and fro-ing allows for a truly interactive and spontaneous search environment, with maximum assistance at point of need. 'File folders' exist for saving any Visual Dewey information, any retrieved items, etc.
  15. Vizine-Goetz, D.: OCLC investigates using classification tools to organize Internet data (1998) 0.01 
    0.007914666 = product of:
  0.023743998 = sum of:
    0.023743998 = product of:
      0.047487997 = sum of:
        0.047487997 = weight(_text_:22 in 2342) [ClassicSimilarity], result of:
          0.047487997 = score(doc=2342,freq=2.0), product of:
            0.17534193 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050071523 = queryNorm
            0.2708308 = fieldWeight in 2342, 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=2342)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    22. 9.1997 19:16:05
  16. Kent, R.E.: Organizing conceptual knowledge online : metadata interoperability and faceted classification (1998) 0.01 
    0.007914666 = product of:
  0.023743998 = sum of:
    0.023743998 = product of:
      0.047487997 = sum of:
        0.047487997 = weight(_text_:22 in 57) [ClassicSimilarity], result of:
          0.047487997 = score(doc=57,freq=2.0), product of:
            0.17534193 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050071523 = queryNorm
            0.2708308 = fieldWeight in 57, 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=57)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    30.12.2001 16:22:41
  17. Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998) 0.01 
    0.007914666 = product of:
  0.023743998 = sum of:
    0.023743998 = product of:
      0.047487997 = sum of:
        0.047487997 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
          0.047487997 = score(doc=1673,freq=2.0), product of:
            0.17534193 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050071523 = queryNorm
            0.2708308 = fieldWeight in 1673, 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=1673)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    1. 8.1996 22:08:06
  18. Classification research for knowledge representation and organization : Proc. of the 5th Int. Study Conf. on Classification Research, Toronto, Canada, 24.-28.6.1991 (1992) 0.01 
    0.00746959 = product of:
  0.022408769 = sum of:
    0.022408769 = product of:
      0.044817537 = sum of:
        0.044817537 = weight(_text_:index in 2072) [ClassicSimilarity], result of:
          0.044817537 = score(doc=2072,freq=4.0), product of:
            0.21880072 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.050071523 = queryNorm
            0.20483267 = fieldWeight in 2072, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0234375 = fieldNorm(doc=2072)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Content
    Enthält die Beiträge: SVENONIUS, E.: Classification: prospects, problems, and possibilities; BEALL, J.: Editing the Dewey Decimal Classification online: the evolution of the DDC database; BEGHTOL, C.: Toward a theory of fiction analysis for information storage and retrieval; CRAVEN, T.C.: Concept relation structures and their graphic display; FUGMANN, R.: Illusory goals in information science research; GILCHRIST, A.: UDC: the 1990's and beyond; GREEN, R.: The expression of syntagmatic relationships in indexing: are frame-based index languages the answer?; HUMPHREY, S.M.: Use and management of classification systems for knowledge-based indexing; MIKSA, F.L.: The concept of the universe of knowledge and the purpose of LIS classification; SCOTT, M. u. A.F. FONSECA: Methodology for functional appraisal of records and creation of a functional thesaurus; ALBRECHTSEN, H.: PRESS: a thesaurus-based information system for software reuse; AMAESHI, B.: A preliminary AAT compatible African art thesaurus; CHATTERJEE, A.: Structures of Indian classification systems of the pre-Ranganathan era and their impact on the Colon Classification; COCHRANE, P.A.: Indexing and searching thesauri, the Janus or Proteus of information retrieval; CRAVEN, T.C.: A general versus a special algorithm in the graphic display of thesauri; DAHLBERG, I.: The basis of a new universal classification system seen from a philosophy of science point of view: DRABENSTOTT, K.M., RIESTER, L.C. u. B.A.DEDE: Shelflisting using expert systems; FIDEL, R.: Thesaurus requirements for an intermediary expert system; GREEN, R.: Insights into classification from the cognitive sciences: ramifications for index languages; GROLIER, E. de: Towards a syndetic information retrieval system; GUENTHER, R.: The USMARC format for classification data: development and implementation; HOWARTH, L.C.: Factors influencing policies for the adoption and integration of revisions to classification schedules; HUDON, M.: Term definitions in subject thesauri: the Canadian literacy thesaurus experience; HUSAIN, S.: Notational techniques for the accomodation of subjects in Colon Classification 7th edition: theoretical possibility vis-à-vis practical need; KWASNIK, B.H. u. C. JORGERSEN: The exploration by means of repertory grids of semantic differences among names of official documents; MICCO, M.: Suggestions for automating the Library of Congress Classification schedules; PERREAULT, J.M.: An essay on the prehistory of general categories (II): G.W. Leibniz, Conrad Gesner; REES-POTTER, L.K.: How well do thesauri serve the social sciences?; REVIE, C.W. u. G. SMART: The construction and the use of faceted classification schema in technical domains; ROCKMORE, M.: Structuring a flexible faceted thsaurus record for corporate information retrieval; ROULIN, C.: Sub-thesauri as part of a metathesaurus; SMITH, L.C.: UNISIST revisited: compatibility in the context of collaboratories; STILES, W.G.: Notes concerning the use chain indexing as a possible means of simulating the inductive leap within artificial intelligence; SVENONIUS, E., LIU, S. u. B. SUBRAHMANYAM: Automation in chain indexing; TURNER, J.: Structure in data in the Stockshot database at the National Film Board of Canada; VIZINE-GOETZ, D.: The Dewey Decimal Classification as an online classification tool; WILLIAMSON, N.J.: Restructuring UDC: problems and possibilies; WILSON, A.: The hierarchy of belief: ideological tendentiousness in universal classification; WILSON, B.F.: An evaluation of the systematic botany schedule of the Universal Decimal Classification (English full edition, 1979); ZENG, L.: Research and development of classification and thesauri in China; CONFERENCE SUMMARY AND CONCLUSIONS
  19. Place, E.: Internationale Zusammenarbeit bei Internet Subject Gateways (1999) 0.01 
    0.0067839995 = product of:
  0.020351999 = sum of:
    0.020351999 = product of:
      0.040703997 = sum of:
        0.040703997 = weight(_text_:22 in 4189) [ClassicSimilarity], result of:
          0.040703997 = score(doc=4189,freq=2.0), product of:
            0.17534193 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050071523 = queryNorm
            0.23214069 = fieldWeight in 4189, 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=4189)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    22. 6.2002 19:35:09

Authors

Languages

Types

Themes

Subjects

Classifications