Search (56 results, page 3 of 3)

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 6028) [ClassicSimilarity], result of:
      0.01867095 = score(doc=6028,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 6028, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6028)
  0.33333334 = coord(1/3)

Abstract

The 'facet-space' approach for accessing document records organized by faceted classifications is described. The interface gives users detailed control over the facet display and it makes use of color to reduce the number of windows which need to be presented. The interface supports searching. A cluster analysis is described for organizing search return lists based on facets distances. The implementation is applied to 1381 summaries of computer science dissertations as organised by the ACM Computing Reviews classification system

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 3221) [ClassicSimilarity], result of:
      0.01867095 = score(doc=3221,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 3221, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3221)
  0.33333334 = coord(1/3)

Footnote

Übers. des Titels: Building a multilingual thesaurus based on UDC

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 399) [ClassicSimilarity], result of:
      0.01867095 = score(doc=399,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 399, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=399)
  0.33333334 = coord(1/3)

Abstract

There exist in the world many bibliographical databases, which are indexed with the UDC. Searching in the databases is difficult for everyone not very experienced in the use of this classification scheme. The notations can be very complex and often it would be desirable to be able to search on only a part of the notation. In this paper algorithms for the decomposition of complex UDC-notations and adding a description to the resulting simple notations are discussed. In the second part of the paper the resulting texts are discussed

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 5538) [ClassicSimilarity], result of:
      0.01867095 = score(doc=5538,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 5538, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5538)
  0.33333334 = coord(1/3)

Abstract

Thesauri-structured controlled vocabularies, designed for information retrieval-are compared with classification schemes developed for the arrangement of library materials and/or bibliographic records. The syndetic structure (BTs and NTs) within the alphabetic sequence of thesauri constitutes a hidden classification, but many thesauri include an explicit hierarchical display; some feature notation. The various structures and applications of thesauri are surveyed, with an emphasis on their increasing role in electronic information retrieval. The skills required for thesaurus construction are similar to those for the development of classification schemes. The distinction between these activities is expected to blur in the future.

0.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 2114) [ClassicSimilarity], result of:
      0.016003672 = score(doc=2114,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 2114, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=2114)
  0.33333334 = coord(1/3)

Source

Classification research for knowledge representation and organization. Proc. 5th Int. Study Conf. on Classification Research, Toronto, Canada, 24.-28.6.1991. Ed. by N.J. Williamson u. M. Hudon

0.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 4252) [ClassicSimilarity], result of:
      0.016003672 = score(doc=4252,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 4252, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=4252)
  0.33333334 = coord(1/3)

Abstract

Presents a pilot study for an Internordic project to monitor the use of online catalogues in the Nordic technological university libraries. Focuses on the use of classification in subject searching, how the UDC is used and the extent of its use. Studies user interaction with the OPACs and improvements to information retrieval in the catalogues using the transaction log method to gather data. The pilot study examnines the TENTTU Books database which is the online union catalogue of the Helsinki Univ. of Technology Library, a multilingual database with true information retrieval. The Internordic study itself will make comparisons between the TENTTU system and the new Virginia Tech Library System. Discusses the users monitored, method of analysis, subject searching in the database, results and how the UDC codes were used. Compares this to other studies conducted in Finland and evaluates the project

0.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 3) [ClassicSimilarity], result of:
      0.016003672 = score(doc=3,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 3, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=3)
  0.33333334 = coord(1/3)

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.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 5698) [ClassicSimilarity], result of:
      0.016003672 = score(doc=5698,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 5698, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=5698)
  0.33333334 = coord(1/3)

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.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 3842) [ClassicSimilarity], result of:
      0.016003672 = score(doc=3842,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 3842, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=3842)
  0.33333334 = coord(1/3)

Abstract

Ranganathan's canons, principles, and postulates can easily confuse readers, especially because he revised and added to them in various editions of his many books. The Classification Research Group, who drew on Ranganathan's work as their basis for classification theory but developed it in their own way, has never clearly organized all their equivalent canons and principles. In this article Spiteri gathers the fundamental rules from both systems and compares and contrasts them. She makes her own clearer set of principles for constructing facets, stating the subject of a document, and designing notation. Spiteri's "simplified model" is clear and understandable, but certainly not simplistic. The model does not include methods for making a faceted system, but will serve as a very useful guide in how to turn initial work into a rigorous classification. Highly recommended

0.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 726) [ClassicSimilarity], result of:
      0.016003672 = score(doc=726,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 726, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=726)
  0.33333334 = coord(1/3)

Abstract

This article gives a cheerfully brief and undetailed account of how to make a faceted classification system, then describes information retrieval and searching on the web. It concludes by saying that facets would be excellent in helping users search and browse the web, but offers no real clues as to how this can be done.

0.004619863 = product of:
  0.013859588 = sum of:
    0.013859588 = weight(_text_:on in 2072) [ClassicSimilarity], result of:
      0.013859588 = score(doc=2072,freq=6.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.12626824 = fieldWeight in 2072, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0234375 = fieldNorm(doc=2072)
  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

0.0044454644 = product of:
  0.013336393 = sum of:
    0.013336393 = weight(_text_:on in 2384) [ClassicSimilarity], result of:
      0.013336393 = score(doc=2384,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.121501654 = fieldWeight in 2384, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2384)
  0.33333334 = coord(1/3)

Abstract

Online displays of bibliographic records in call number order can serve various functions. A literature search showed no papers or books discussing this topic directly. Various displays from online catalogues available via the Internet were examined, as were displays sent to the author by colleagues. A number of the displays were uninformative to the extent that the identification of works associated with call numbers was difficult or impossible without follow-up searching of the individual bibliographic records. Other displays provided information where further searching of the database would not be required for most purposes. Displays noted ranged from displays with call numbers alone, with no bibliographic information, to records including main entry, title, statement of responsibility, place, publisher, and date. Suggestions of useful data elements to be included in displays of bibliographic records in call number order are made for the following functions: shelflisting, cataloguing, catalogue maintenance, reference, public searches, acquisition and collection development, and inventory control. Recommendations are made that the following data elements should be present in call number displays: entire call number as a sequencing element; main entry; entire title proper, and the date. Concern is expressed that the call number filing arrangement be that followed in traditional shelflists, and a suggestion is made that possible consensus on the placement of the data elements within a display be considered in the future

0.0044454644 = product of:
  0.013336393 = sum of:
    0.013336393 = weight(_text_:on in 84) [ClassicSimilarity], result of:
      0.013336393 = score(doc=84,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.121501654 = fieldWeight in 84, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, 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

0.0044454644 = product of:
  0.013336393 = sum of:
    0.013336393 = weight(_text_:on in 2481) [ClassicSimilarity], result of:
      0.013336393 = score(doc=2481,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.121501654 = fieldWeight in 2481, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2481)
  0.33333334 = coord(1/3)

Abstract

Three pre-web articles about using hypertext for knowledge representation. Duncan discusses how to use graphical, hypertext displays (she used Xerox PARC's NoteCards on a Xerox 1186 workstation) along with concept maps and facet analysis, a combination that would now be done with topic maps. The screen shots of her graphical displays are quite interesting. Her interest in facets is in how to use them to show things to different people in different ways, for example, so that experts can enter knowledge into a system in one way while novices can see it in another. Duncan found that facet labels (e.g. Process and Product) prompted the expert to think of related concepts when inputting data, and made navigation easier for users. Facets can be joined together, e.g. "Agents (causing) Process," leading to a "reasoning system." She is especially interested in how to show relstionships between two things: e.g., A causes B, A uses B, A occurs in B. This is an important question in facet theory, but probably not worth worrying about in a small online classification where the relations are fixed and obvious. These articles may be difficult to find, in which case the reader can find a nice sumary in the next article, by Ellis and Vasconcelos (2000). Anyone interested in tracing the history of facets and hypertext will, however, want to see the originals.

0.0044454644 = product of:
  0.013336393 = sum of:
    0.013336393 = weight(_text_:on in 5570) [ClassicSimilarity], result of:
      0.013336393 = score(doc=5570,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.121501654 = fieldWeight in 5570, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5570)
  0.33333334 = coord(1/3)

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.0044454644 = product of:
  0.013336393 = sum of:
    0.013336393 = weight(_text_:on in 5969) [ClassicSimilarity], result of:
      0.013336393 = score(doc=5969,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.121501654 = fieldWeight in 5969, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5969)
  0.33333334 = coord(1/3)

Abstract

Much literature has been written speculating upon how classification can be used in online catalogs to improve information retrieval. While some empirical studies have been done exploring whether the direct use of traditional classification schemes designed for a manual environment is effective and efficient in the online environment, none has manipulated these manual classifications in such a w ay as to take full advantage of the power of both the classification and computer. It has been suggested by some authors, such as Wajenberg and Drabenstott, that this power could be realized if the individual components of synthesized DDC numbers could be identified and indexed. This paper looks at the feasibility of automatically decomposing DDC synthesized numbers and the implications of such decomposition for information retrieval. Based on an analysis of the instructions for synthesizing numbers in the main class Arts (700) and all DDC Tables, 17 decomposition rules were defined, 13 covering the Add Notes and four the Standard Subdivisions. 1,701 DDC synthesized numbers were decomposed by a computer system called DND (Dewey Number Decomposer), developed by the author. From the 1,701 numbers, 600 were randomly selected fo r examination by three judges, each evaluating 200 numbers. The decomposition success rate was 100% and it was concluded that synthesized DDC numbers can be accurately decomposed automatically. The study has implications for information retrieval, expert systems for assigning DDC numbers, automatic indexing, switching language development, enhancing classifiers' work, teaching library school students, and providing quality control for DDC number assignments. These implications were explored using a prototype retrieval system.