Search (44 results, page 1 of 3)

  • × theme_ss:"Klassifikationssysteme im Online-Retrieval"
  • × type_ss:"a"
  • × year_i:[1990 TO 2000}
  1. Ishikawa, T.; Nakamura, H.; Nakamura, Y.: UDC number automatic combination system (1994) 0.06 
    0.0563569 = product of:
  0.084535345 = sum of:
    0.045130465 = weight(_text_:management in 7732) [ClassicSimilarity], result of:
      0.045130465 = score(doc=7732,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.2606825 = fieldWeight in 7732, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7732)
    0.039404877 = product of:
      0.07880975 = sum of:
        0.07880975 = weight(_text_:system in 7732) [ClassicSimilarity], result of:
          0.07880975 = score(doc=7732,freq=8.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.4871716 = fieldWeight in 7732, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7732)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    In a large-scale classification system, such as UDC, users are often troubled during the process of finding a relevant classification number for his concept or term and producing (combining) a final compound classification number. UDC tables are now computerized in many language editions, and the MRF had released as a master file (database) by the UDCC in 1993. In this paper, a system function is described for a man-machine interactive system to support compound UDC number assignment, and the necessary re-organization of UDC data/file formats are considered for the use in the automatic classification number combination
    Source
    Knowledge organization and quality management: Proc. of the 3rd International ISKO Conference, 20-24 June 1994, Copenhagen, Denmark. Ed.: H. Albrechtsen et al
  2. Ardo, A.; Lundberg, S.: ¬A regional distributed WWW search and indexing service : the DESIRE way (1998) 0.04 
    0.03643499 = product of:
  0.109304965 = sum of:
    0.109304965 = sum of:
      0.06755122 = weight(_text_:system in 4190) [ClassicSimilarity], result of:
        0.06755122 = score(doc=4190,freq=8.0), product of:
          0.16177002 = queryWeight, product of:
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.051362853 = queryNorm
          0.41757566 = fieldWeight in 4190, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.046875 = fieldNorm(doc=4190)
      0.041753743 = weight(_text_:22 in 4190) [ClassicSimilarity], result of:
        0.041753743 = score(doc=4190,freq=2.0), product of:
          0.17986396 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051362853 = 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
  3. Vizine-Goetz, D.: OCLC investigates using classification tools to organize Internet data (1998) 0.03 
    0.029372526 = product of:
  0.08811758 = sum of:
    0.08811758 = sum of:
      0.039404877 = weight(_text_:system in 2342) [ClassicSimilarity], result of:
        0.039404877 = score(doc=2342,freq=2.0), product of:
          0.16177002 = queryWeight, product of:
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.051362853 = queryNorm
          0.2435858 = fieldWeight in 2342, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2342)
      0.0487127 = weight(_text_:22 in 2342) [ClassicSimilarity], result of:
        0.0487127 = score(doc=2342,freq=2.0), product of:
          0.17986396 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051362853 = 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.33333334 = coord(1/3)
    Abstract
    The knowledge structures that form traditional library classification schemes hold great potential for improving resource description and discovery on the Internet and for organizing electronic document collections. The advantages of assigning subject tokens (classes) to documents from a scheme like the DDC system are well documented
    Date
    22. 9.1997 19:16:05
  4. Kent, R.E.: Organizing conceptual knowledge online : metadata interoperability and faceted classification (1998) 0.03 
    0.029372526 = product of:
  0.08811758 = sum of:
    0.08811758 = sum of:
      0.039404877 = weight(_text_:system in 57) [ClassicSimilarity], result of:
        0.039404877 = score(doc=57,freq=2.0), product of:
          0.16177002 = queryWeight, product of:
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.051362853 = queryNorm
          0.2435858 = fieldWeight in 57, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.0546875 = fieldNorm(doc=57)
      0.0487127 = weight(_text_:22 in 57) [ClassicSimilarity], result of:
        0.0487127 = score(doc=57,freq=2.0), product of:
          0.17986396 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051362853 = 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.33333334 = coord(1/3)
    Abstract
    Conceptual Knowledge Markup Language (CKML), an application of XML, is a new standard being promoted for the specification of online conceptual knowledge (Kent and Shrivastava, 1998). CKML follows the philosophy of Conceptual Knowledge Processing (Wille, 1982), a principled approach to knowledge representation and data analysis, which advocates the development of methodologies and techniques to support people in their rational thinking, judgement and actions. CKML was developed and is being used in the WAVE networked information discovery and retrieval system (Kent and Neuss, 1994) as a standard for the specification of conceptual knowledge
    Date
    30.12.2001 16:22:41
  5. Riesthuis, G.J.A..: Conversion from precoordinated classified catalogues to postcoordinated keyword catalogues (1994) 0.03 
    0.02578884 = product of:
  0.077366516 = sum of:
    0.077366516 = weight(_text_:management in 7737) [ClassicSimilarity], result of:
      0.077366516 = score(doc=7737,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.44688427 = fieldWeight in 7737, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.09375 = fieldNorm(doc=7737)
  0.33333334 = coord(1/3)
    Source
    Knowledge organization and quality management: Proc. of the 3rd International ISKO Conference, 20-24 June 1994, Copenhagen, Denmark. Ed.: H. Albrechtsen et al
  6. Liu, S.; Svenonius, E.: DORS: DDC online retrieval system (1991) 0.02 
    0.016783237 = product of:
  0.05034971 = sum of:
    0.05034971 = product of:
      0.10069942 = sum of:
        0.10069942 = weight(_text_:system in 1155) [ClassicSimilarity], result of:
          0.10069942 = score(doc=1155,freq=10.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.62248504 = fieldWeight in 1155, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.1495528 = idf(docFreq=5152, 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
  7. Drabenstott, K.M.; Riester, L.C.; Dede, B.A.: Shelflisting using expert systems (1992) 0.01 
    0.013000239 = product of:
  0.039000716 = sum of:
    0.039000716 = product of:
      0.07800143 = sum of:
        0.07800143 = weight(_text_:system in 2101) [ClassicSimilarity], result of:
          0.07800143 = score(doc=2101,freq=6.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.48217484 = fieldWeight in 2101, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0625 = fieldNorm(doc=2101)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    A prototype expert system for the computer science section (QA75 to QA76.95) of Library of Congress Classification was built using the Mahogany Professional expert system shell. The prototype demonstrates an expert systes application in which the system is enlisted as an intelligent job aid to assist users during the actual performance of shelflisting
  8. Pollitt, S.: Interactive information retrieval based on faceted classification using views (1997) 0.01 
    0.01289442 = product of:
  0.038683258 = sum of:
    0.038683258 = weight(_text_:management in 5096) [ClassicSimilarity], result of:
      0.038683258 = score(doc=5096,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.22344214 = fieldWeight in 5096, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.046875 = fieldNorm(doc=5096)
  0.33333334 = coord(1/3)
    Abstract
    This paper discusses constraints in knowledge organisation for information retrieval introduced by the difficulty of separating logical views of data, information, concepts and their relationships, from the physical means by which we seek to implement retrieval systems. A parallel is drawn between the move from enumerated to faceted classification and the emergence of relational database management systems to replace those adopting a hierarchical structure. This parallel suggests a convergence of ideas which have been, to a large extent, developed independently. The role of post-coordinated retrieval systems and thesauri is then examined before an interface design (HIBROWSE - a High resolution Interface for BROWsing and SEarching databases), is described which brings together the principles of faceted classification and increases the bandwidth of interaction through view-based searching.
  9. Järvelin, K.; Niemi, T.: Deductive information retrieval based on classifications (1993) 0.01 
    0.01289442 = product of:
  0.038683258 = sum of:
    0.038683258 = weight(_text_:management in 2229) [ClassicSimilarity], result of:
      0.038683258 = score(doc=2229,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.22344214 = fieldWeight in 2229, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.046875 = fieldNorm(doc=2229)
  0.33333334 = coord(1/3)
    Abstract
    Modern fact databses contain abundant data classified through several classifications. Typically, users msut consult these classifications in separate manuals or files, thus making their effective use difficult. Contemporary database systems do little support deductive use of classifications. In this study we show how deductive data management techniques can be applied to the utilization of data value classifications. Computation of transitive class relationships is of primary importance here. We define a representation of classifications which supports transitive computation and present an operation-oriented deductive query language tailored for classification-based deductive information retrieval. The operations of this language are on the same abstraction level as relational algebra operations and can be integrated with these to form a powerful and flexible query language for deductive information retrieval. We define the integration of these operations and demonstrate the usefulness of the language in terms of several sample queries
  10. Comaromi, C.L.: Summation of classification as an enhancement of intellectual access to information in an online environment (1990) 0.01 
    0.011598263 = product of:
  0.03479479 = sum of:
    0.03479479 = product of:
      0.06958958 = sum of:
        0.06958958 = weight(_text_:22 in 3576) [ClassicSimilarity], result of:
          0.06958958 = score(doc=3576,freq=2.0), product of:
            0.17986396 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051362853 = 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
  11. Gödert, W.: Facet classification in online retrieval (1991) 0.01 
    0.011490695 = product of:
  0.034472086 = sum of:
    0.034472086 = product of:
      0.06894417 = sum of:
        0.06894417 = weight(_text_:system in 5825) [ClassicSimilarity], result of:
          0.06894417 = score(doc=5825,freq=12.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.42618635 = fieldWeight in 5825, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5825)
      0.5 = coord(1/2)
  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
    "Online retrieval" conjures up a very different mental image now than in 1991, the year this article was written, and the year Tim Berners-Lee first revealed the new hypertext system he called the World Wide Web. Gödert shows that truncation and Boolean logic, combined with notation from a faceted classification system, will be a powerful way of searching for information. It undoubtedly is, but no system built now would require a user searching for material on "nervous systems of bone fish" to enter "Fdd$ and Leaa$". This is worth reading for someone interested in seeing how searching and facets can go together, but the web has made this article quite out of date.
  12. Gowtham, M.S.; Kamat, S.K.: ¬An expert system as a tool to classification (1995) 0.01 
    0.011258537 = product of:
  0.03377561 = sum of:
    0.03377561 = product of:
      0.06755122 = sum of:
        0.06755122 = weight(_text_:system in 3735) [ClassicSimilarity], result of:
          0.06755122 = score(doc=3735,freq=8.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.41757566 = fieldWeight in 3735, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=3735)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Describes the development by the Defence Metallurgical Research Laboratory, Hyderabad, India, of an expert system for classification of technical documents using the UDC schedule for metallurgy as knowledge base and the UDC classification rules as rule base. The scheme was modified from its enumerative structure to an analytico-synthetic structure which is best suited to such an expert system. Some benefits of the expert system are that: it interacts with the classifier making them conform to the route suggested by the classification scheme; it alerts the classifier to the minor variations in the scheme thus avoiding overlooking them; it leads to consistency in class number generation; and it ensures that the classifier has incorporated als the concepts of the subject in the class number, by leading him or her through all the groups, which is not possible in the manual scheme
  13. Micco, M.: Suggestions for automating the Library of Congress Classification schedules (1992) 0.01 
    0.01061465 = product of:
  0.03184395 = sum of:
    0.03184395 = product of:
      0.0636879 = sum of:
        0.0636879 = weight(_text_:system in 2108) [ClassicSimilarity], result of:
          0.0636879 = score(doc=2108,freq=4.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.3936941 = fieldWeight in 2108, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0625 = fieldNorm(doc=2108)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    It will not be an easy task to automate the Library of Congress Classification schedules because it is a very large system and also because it developed long before automation. The designers were creating a system for shelving books effiently and had not even imagined the constraints imposed by automation. A number of problems and possible solutions are discussed. The MARC format proposed for classification has some serious problems which are identified
  14. Koh, G.S.: Options in classification available through modern technology (1995) 0.01 
    0.01061465 = product of:
  0.03184395 = sum of:
    0.03184395 = product of:
      0.0636879 = sum of:
        0.0636879 = weight(_text_:system in 2938) [ClassicSimilarity], result of:
          0.0636879 = score(doc=2938,freq=4.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.3936941 = fieldWeight in 2938, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0625 = fieldNorm(doc=2938)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    System design options and user searching options are discussed. The problems of electronic union catalogs, including a 'virtual union catalog' in particular are considered and enhancements made possible through classification are explored. The combined system of subject headings and classification is presented as the model of the integrated subject searching tool which will meet individualized learning styles and user responsive vocabulary
  15. Watanabe, T.: ¬An experimental OPAC system using NDC8 to improve subject access (1994) 0.01 
    0.01061465 = product of:
  0.03184395 = sum of:
    0.03184395 = product of:
      0.0636879 = sum of:
        0.0636879 = weight(_text_:system in 403) [ClassicSimilarity], result of:
          0.0636879 = score(doc=403,freq=4.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.3936941 = fieldWeight in 403, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0625 = fieldNorm(doc=403)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Description of an attempt to improve OPAC subject access at Kobe University Library using Nippon Decimal Classification, 8th ed. (NDC8). Examines the theoretical aspects of using a classification for subject searching, then explains the Kobe system. Using the NDC8 machine-readable data file, a database was created for the OPAC, incorporating class numbers and subject headings. Difficulties arise from subdivisions and the structure of NDC8 itself, but it is an important area for development
  16. Svenonius, E.; Liu, S.; Subrahmanyam, B.: Automation of chain indexing (1992) 0.01 
    0.009750179 = product of:
  0.029250536 = sum of:
    0.029250536 = product of:
      0.058501072 = sum of:
        0.058501072 = weight(_text_:system in 2114) [ClassicSimilarity], result of:
          0.058501072 = score(doc=2114,freq=6.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.36163113 = fieldWeight in 2114, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1495528 = idf(docFreq=5152, 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
  17. Allen, R.B.: ¬Two digital library interfaces that exploit hierarchical structure (1995) 0.01 
    0.009750179 = product of:
  0.029250536 = sum of:
    0.029250536 = product of:
      0.058501072 = sum of:
        0.058501072 = weight(_text_:system in 2416) [ClassicSimilarity], result of:
          0.058501072 = score(doc=2416,freq=6.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.36163113 = fieldWeight in 2416, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=2416)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Two library classification system interfaces have been implemented for navigating and searching large collections of document and book records. One interface allows the user to browse book records organized by the DDC hierarchy. A Book Shelf display reflects the facet position in the classification hierarchy during browsing, and it dynamically updates to reflect search hits and attribute selections. The other interface provides access to records describing computer science documents classified by the ACM Computing Reviews (CR) system. The CR classification system is a type of faceted classification in which documents can appear at several points in the hierarchy. These two interfaces demonstrate that classification structure can be effectively utilized for organizing digital libraries and, potentiall, collections of Internet-wide information services
  18. Wyly, B.: What lies ahead for classification in information networks? : report of a panel discussion (1995) 0.01 
    0.009382114 = product of:
  0.02814634 = sum of:
    0.02814634 = product of:
      0.05629268 = sum of:
        0.05629268 = weight(_text_:system in 5568) [ClassicSimilarity], result of:
          0.05629268 = score(doc=5568,freq=8.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.3479797 = fieldWeight in 5568, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5568)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Ia McIlwaine, head of the Classification Research Group and editor of the UDC, noticed that the session's title invited crystal ball gazing, a talent she denied possessing. However, she admitted that she had asked the Classification Research Group to engage in such an exercise with her. The Group found, like the participants at the Allerton Institute were finding, that the contemplation of classification's future provided more questions than answers, but the questions were well worth considering. Her talk focused around a problem which originates in the difference between classifiers' uses and users' uses for classification systems. For users, who speak with the paraphrased self-confidence of Humpty Dumpty, a subject is a subject because they say it is. McIlwaine pointed out that this process of "saying" is at the heart of the users' needs which should be addressed by classification systems. Users use words to approach information systems and their associated classification systems. Classifiers need to recognize that this is the use to which their systems will be put. A body of users external to the classification process will make very different demands upon the system as compared to the users of the classification system who are also the creators of the system. Users desire information grouped for individual usefulness, and the groupings need to be according to words through which users can approach the system.
  19. Kniesner, D.L.; Willman, C.: But is it an online shelflist? : classification access in eight OPACs (1995) 0.01 
    0.008125149 = product of:
  0.024375446 = sum of:
    0.024375446 = product of:
      0.048750892 = sum of:
        0.048750892 = weight(_text_:system in 5555) [ClassicSimilarity], result of:
          0.048750892 = score(doc=5555,freq=6.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.30135927 = fieldWeight in 5555, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5555)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    As librarians increasingly try to use their online catalogues to do what used to be done with their card shelflists, they are realizing that some catalogue sedigners and vendors have not paid enough attention to online shelf order classification access. Compares the call number searching abilities of 8 prominent, mature library systems: VTLS, Inlex, Innovative Interfaces, Inc., Data Research Associates (DRA), Geac Advance, Dynix, SIRSI, and NOTIS. Using 5 criteria that are important to cataloguers, each system was tested and rated for its suitability as an online shelflist. *** Special note from the authors: "[We've] become aware of a new version of SIRSI's Unicorn library system-- version 7.0 that changes our rating of SIRSI in a major way. We had rated SIRSI Unicorn a "C" in the paper, but now we would rate version 7.0 an "A". This is indeed a major change. Fortunately, we identified version numbers for each system in the article: we had tested version 6.1 of SIRSI. Thus, version 7.0 of SIRSI Unicorn, available in early 1995, has improved to the point that it meets every criteria used in the article for suitability as an online shelflist. The authors have evaluated version 7.0 with an "A" rating." ***
  20. Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998) 0.01 
    0.008118784 = product of:
  0.02435635 = sum of:
    0.02435635 = product of:
      0.0487127 = sum of:
        0.0487127 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
          0.0487127 = score(doc=1673,freq=2.0), product of:
            0.17986396 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051362853 = 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

Authors

Languages

  • e 41
  • ja 1
  • nl 1
  • More… Less…

Themes