Search (23 results, page 1 of 2)

0.05707561 = product of:
  0.13317642 = sum of:
    0.05205557 = weight(_text_:processing in 57) [ClassicSimilarity], result of:
      0.05205557 = score(doc=57,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.3130829 = fieldWeight in 57, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.0546875 = fieldNorm(doc=57)
    0.06164417 = weight(_text_:techniques in 57) [ClassicSimilarity], result of:
      0.06164417 = score(doc=57,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.3406997 = fieldWeight in 57, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0546875 = fieldNorm(doc=57)
    0.019476667 = product of:
      0.038953334 = sum of:
        0.038953334 = weight(_text_:22 in 57) [ClassicSimilarity], result of:
          0.038953334 = score(doc=57,freq=2.0), product of:
            0.14382903 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04107254 = 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.42857143 = coord(3/7)

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

0.020437783 = product of:
  0.071532235 = sum of:
    0.05205557 = weight(_text_:processing in 2342) [ClassicSimilarity], result of:
      0.05205557 = score(doc=2342,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.3130829 = fieldWeight in 2342, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2342)
    0.019476667 = product of:
      0.038953334 = sum of:
        0.038953334 = weight(_text_:22 in 2342) [ClassicSimilarity], result of:
          0.038953334 = score(doc=2342,freq=2.0), product of:
            0.14382903 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04107254 = 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.2857143 = coord(2/7)

Date

22. 9.1997 19:16:05

Source

Visualizing subject access for 21st century information resources: Papers presented at the 1997 Clinic on Library Applications of Data Processing, 2-4 Mar 1997, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign. Ed.: P.A. Cochrane et al

0.010516814 = product of:
  0.0736177 = sum of:
    0.0736177 = weight(_text_:processing in 863) [ClassicSimilarity], result of:
      0.0736177 = score(doc=863,freq=4.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.4427661 = fieldWeight in 863, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.0546875 = fieldNorm(doc=863)
  0.14285715 = coord(1/7)

LCSH

Subject cataloguing / Data processing

Subject

Subject cataloguing / Data processing

0.010064354 = product of:
  0.07045048 = sum of:
    0.07045048 = weight(_text_:techniques in 1726) [ClassicSimilarity], result of:
      0.07045048 = score(doc=1726,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.3893711 = fieldWeight in 1726, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0625 = fieldNorm(doc=1726)
  0.14285715 = coord(1/7)

Abstract

This paper describes the features of Electronic Dewey bringing out the ways in which it differs from the printed version of the Classification. The various search techniques available are discussed and the use of the DDC functions is considered. The paper concludes that while improvements could be made the CD-ROM heralds the electronic age of classification.

0.008895717 = product of:
  0.062270015 = sum of:
    0.062270015 = weight(_text_:techniques in 73) [ClassicSimilarity], result of:
      0.062270015 = score(doc=73,freq=4.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.34415868 = fieldWeight in 73, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0390625 = fieldNorm(doc=73)
  0.14285715 = coord(1/7)

Abstract

This paper examines issues relating to the use of the Dewey Decimal Classification (DDC) in a future development of view-based searching to Online Public Access Catalogues (OPAC). View-based searching systems, exercising the principles of fully faceted classification techniques for both bibliographic and corporate database retrieval applications, are now being applied to utilise Dewey concept hierarchies in a University OPAC. Issues of efficiency and effectiveness in the evolving organisation and classification of information within libraries are examined to explain why fully faceted classification schemes have yet to realise their full potential in libraries. The key to their application in OPACs lies in the use of faceted classification as pre-coordinated indexing and abandoning the single dimension relative ordering of books on shelves. The need to maintain a single relative physical position on a bookshelf is the major source of complexity in classification. Extensive latent benefits will be realised when systematic subject arrangements, providing alternative views onto OPACs, are coupled to view-based browser and search techniques. Time and effort will be saved, and effectiveness increased, as rapid access is provided to the most appropriate information to satisfy the needs of the user. A future for Dewey Classification divorced from its decimal notation is anticipated

0.008806311 = product of:
  0.06164417 = sum of:
    0.06164417 = weight(_text_:techniques in 4837) [ClassicSimilarity], result of:
      0.06164417 = score(doc=4837,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.3406997 = fieldWeight in 4837, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4837)
  0.14285715 = coord(1/7)

Abstract

Classification numbers and shelf marks may be useful in online searching. Ways of using classification in online searching include: direct classification searching; use of classification as linking devices or pivots; and direct or indirect searching of classification schedules and indexes. Discusses each of these techniques, mainly in the context of library OPAC searching although they may be applied to other types of online retrieval systems. The use of classification numbers as pivots enabling online searchers to retrieve related references by means of automation searching of identical or related classification numbers is reviewed with reference to the OKAPI project; BLCMP project and the DDC online project

0.008735436 = product of:
  0.061148047 = sum of:
    0.061148047 = weight(_text_:digital in 2414) [ClassicSimilarity], result of:
      0.061148047 = score(doc=2414,freq=6.0), product of:
        0.16201277 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.04107254 = queryNorm
        0.37742734 = fieldWeight in 2414, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2414)
  0.14285715 = coord(1/7)

Source

Digital libraries: current issues ; selected papers / Digital Libraries Workshop DL '94, Newark, NJ, USA, May 19 - 20, 1994. Ed.: Nabil R. Adam

0.008558944 = product of:
  0.059912607 = sum of:
    0.059912607 = weight(_text_:digital in 942) [ClassicSimilarity], result of:
      0.059912607 = score(doc=942,freq=4.0), product of:
        0.16201277 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.04107254 = queryNorm
        0.36980176 = fieldWeight in 942, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.046875 = fieldNorm(doc=942)
  0.14285715 = coord(1/7)

Content

1. Increased Importance of Knowledge Organization in Internet Services - 2. Quality Subject Service and the role of classification - 3. Developing the DDC into a knowledge organization instrument for the digital library. OCLC site - 4. DESIRE's Barefoot Solutions of Automatic Classification - 5. Advanced Classification Solutions in DESIRE and CORC - 6. Future directions of research and development - 7. General references

0.008558944 = product of:
  0.059912607 = sum of:
    0.059912607 = weight(_text_:digital in 2416) [ClassicSimilarity], result of:
      0.059912607 = score(doc=2416,freq=4.0), product of:
        0.16201277 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.04107254 = queryNorm
        0.36980176 = fieldWeight in 2416, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.046875 = fieldNorm(doc=2416)
  0.14285715 = coord(1/7)

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

0.00806945 = product of:
  0.056486145 = sum of:
    0.056486145 = weight(_text_:digital in 4962) [ClassicSimilarity], result of:
      0.056486145 = score(doc=4962,freq=2.0), product of:
        0.16201277 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.04107254 = queryNorm
        0.34865242 = fieldWeight in 4962, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.0625 = fieldNorm(doc=4962)
  0.14285715 = coord(1/7)

Abstract

Subject based classification is an important part of information retrieval, and has a long history in libraries, where a subject taxonomy was used to determine the location of books on the shelves. We have been studying the notion of subject itself, in order to determine a formal ontology of subject for a large scale digital library card catalog system. Deep analysis reveals a lot of ambiguity regarding the usage of subjects in existing systems and terminology, and we attempt to formalize these notions into a single framework for representing it.

0.0075482656 = product of:
  0.052837856 = sum of:
    0.052837856 = weight(_text_:techniques in 5698) [ClassicSimilarity], result of:
      0.052837856 = score(doc=5698,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.2920283 = fieldWeight in 5698, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.046875 = fieldNorm(doc=5698)
  0.14285715 = coord(1/7)

Abstract

Describes the shortcomings of search engines for the WWW comparing their current capabilities to those of the first generation CD-ROM products. Some allow phrase searching and most are improving their Boolean searching. Few allow truncation, wild cards or nested logic. They are stateless, losing previous search criteria. Unlike the indexing and classification systems for today's CD-ROMs, those for Web pages are random, unstructured and of variable quality. Considers that at best Web search engines can only offer free text searching. Discusses whether automatic data classification systems such as Infoseek Ultra can overcome the haphazard nature of the Web with neural network technology, and whether Boolean search techniques may be redundant when replaced by technology such as the Euroferret search engine. However, artificial intelligence is rarely successful on huge, varied databases. Relevance ranking and automatic query expansion still use the same simple inverted indexes. Most Web search engines do nothing more than word counting. Further complications arise with foreign languages

0.0075482656 = product of:
  0.052837856 = sum of:
    0.052837856 = weight(_text_:techniques in 2229) [ClassicSimilarity], result of:
      0.052837856 = score(doc=2229,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.2920283 = fieldWeight in 2229, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.046875 = fieldNorm(doc=2229)
  0.14285715 = coord(1/7)

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

0.006374152 = product of:
  0.04461906 = sum of:
    0.04461906 = weight(_text_:processing in 3) [ClassicSimilarity], result of:
      0.04461906 = score(doc=3,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.26835677 = fieldWeight in 3, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.046875 = fieldNorm(doc=3)
  0.14285715 = coord(1/7)

Abstract

Summarizes some experiences of the application of the priciples and postulates of S.R. Ranganathan's General Theory of Knowledge Classification, incorporating the freely faceted approach and analytico synthetic methods, to the design and development of specialized databases, including indexing, user interfaces and retrieval. Enumerates some of the earlier instances of the facet method in machine based systems, beginning with Hollerith's punched card system for the data processing of the US Census. Elaborates on Ranganathan's holistic approach to information systems and services provided by his normative principles. Notes similarities between the design of databases and faceted classification systems. Examples from working systems are given to demonstrate the usefulness of selected canons and principles of classification and the analytico synthetic methodology to database design. The examples are mostly operational database systems developed using Unesco's Micro CDS-ISIS software

0.006290222 = product of:
  0.044031553 = sum of:
    0.044031553 = weight(_text_:techniques in 5825) [ClassicSimilarity], result of:
      0.044031553 = score(doc=5825,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.24335694 = fieldWeight in 5825, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5825)
  0.14285715 = coord(1/7)

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

0.0060520875 = product of:
  0.042364612 = sum of:
    0.042364612 = weight(_text_:digital in 5174) [ClassicSimilarity], result of:
      0.042364612 = score(doc=5174,freq=2.0), product of:
        0.16201277 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.04107254 = queryNorm
        0.26148933 = fieldWeight in 5174, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.046875 = fieldNorm(doc=5174)
  0.14285715 = coord(1/7)

Abstract

A team at the University of Michigan School of Information designed, implemented and is evaluating a WWW-based experimental system which uses classification to facilitate browsing of art images. The research team built a database of approximately 3.000 digitized images from Art History to determine if classification can be used for retrieving images from a digital database in a networked environment. A key premise in this research is that browsing can serve an important role in retrieving image information. The system was evaluated in controlled tests and through a questionnaire available to WWW users

0.0060520875 = product of:
  0.042364612 = sum of:
    0.042364612 = weight(_text_:digital in 4429) [ClassicSimilarity], result of:
      0.042364612 = score(doc=4429,freq=2.0), product of:
        0.16201277 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.04107254 = queryNorm
        0.26148933 = fieldWeight in 4429, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.046875 = fieldNorm(doc=4429)
  0.14285715 = coord(1/7)

Abstract

The application of classification schemes and thesauri to improve online information retrieval can be traced back to the beginnings of online searching itself, but the true potential for using knowledge structures in the user interface has yet to be realized. View-based searching seeks to exploit the classified arrangements in thesauri and existing classification schemes to improve the performance of such systems. HIBROWSE for EMBASE is a system which demonstrates the power of applying an approach to information retrieval which is strongly related to faceted classification. It does this by employing a point a click user interface with mutually constraining views utilising knowledge structure hierarchies for both query specification and the presentation of results. The relevance of this approach to library OPACs is discussed in the context of the digital library, concluding that out legacy of research in classification and indexing is more relevant than ever in the design of systems to cope with the problems of information access

0.005311793 = product of:
  0.03718255 = sum of:
    0.03718255 = weight(_text_:processing in 5570) [ClassicSimilarity], result of:
      0.03718255 = score(doc=5570,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.22363065 = fieldWeight in 5570, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5570)
  0.14285715 = coord(1/7)

Abstract

Dagobert Soergel opened the discussion by saying, "Users need our help to find and make sense of information." He said that he believes that classification can provide much of the support users need. He sees little distinction between the concept of a thesaurus and that of classification since both seek to provide structure for knowledge bases in order to facilitate information retrieval. Soergel's discussion of his concept of a multifunctional, multilingual thesaurus comprised the bulk of his presentation. This thesaurus would be a database of concepts, terms, and relationships which would include classification. In this context, classification has a much broader set of functions than it currently does in most American libraries where classification serves primarily as a method of shelf arrangement. The thesaurus Soergel envisions would lay out the semantic map of a field and could therefore be used as a learning tool or as a basis for research planning, or to assist users in clarifying terms and concepts. It could support indexing and searching and provide for the organization of knowledge for expert systems and other artificial intelligence applications. Among its other features, such a thesaurus could assist users in making sense of information by providing structured presentation of search results based on user needs and preferences, and it could enhance natural language processing capabilities such as automated indexing and abstracting and machine translation.

0.0039748303 = product of:
  0.027823811 = sum of:
    0.027823811 = product of:
      0.055647623 = sum of:
        0.055647623 = weight(_text_:22 in 3576) [ClassicSimilarity], result of:
          0.055647623 = score(doc=3576,freq=2.0), product of:
            0.14382903 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04107254 = 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.14285715 = coord(1/7)

Date

8. 1.2007 12:22:40

0.0037741328 = product of:
  0.026418928 = sum of:
    0.026418928 = weight(_text_:techniques in 2072) [ClassicSimilarity], result of:
      0.026418928 = score(doc=2072,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.14601415 = fieldWeight in 2072, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0234375 = fieldNorm(doc=2072)
  0.14285715 = coord(1/7)

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

0.0027823811 = product of:
  0.019476667 = sum of:
    0.019476667 = product of:
      0.038953334 = sum of:
        0.038953334 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
          0.038953334 = score(doc=1673,freq=2.0), product of:
            0.14382903 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04107254 = 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.14285715 = coord(1/7)

Date

1. 8.1996 22:08:06