Search (54 results, page 2 of 3)

0.010544192 = product of:
  0.05272096 = sum of:
    0.05272096 = weight(_text_:system in 403) [ClassicSimilarity], result of:
      0.05272096 = score(doc=403,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = 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.2 = coord(1/5)

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

0.00968546 = product of:
  0.048427295 = sum of:
    0.048427295 = weight(_text_:system in 2416) [ClassicSimilarity], result of:
      0.048427295 = score(doc=2416,freq=6.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = 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.2 = coord(1/5)

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.009319837 = product of:
  0.046599183 = sum of:
    0.046599183 = weight(_text_:system in 5568) [ClassicSimilarity], result of:
      0.046599183 = score(doc=5568,freq=8.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = 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.2 = coord(1/5)

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.

0.0092261685 = product of:
  0.04613084 = sum of:
    0.04613084 = weight(_text_:system in 661) [ClassicSimilarity], result of:
      0.04613084 = score(doc=661,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.34448233 = fieldWeight in 661, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=661)
  0.2 = coord(1/5)

Content

Enthält die Beiträge: STRACHAN, P.D.: UDC revision work in FID; SCIBOR, E. u. I.S. SHCHERBINA-SAMOJLOVA: A strategic approach to to revising the UDC; MCILWAINE, I.: The work of the system development task force; WILLIAMSON, N.J.: The UDC: its future; HAARALA, A.-R.: FID pre-conference seminar on computer applications of the UDC; LOTH, K. u. H. FUNK: Subject search on ETHICS on the basis of the UDC; KURHULA, P.: Use and usability of the UDC in classification practice and online retrieval; RINNE, B.: HELECON system: economics databases; NAKAMURA, Y. u. T. ISHIKAWA: Expert systems for automatic UDC number assignment; RIESTHUIS, G.J.A. u. S. BLIEDUNG: Thesaurification of UDC: preliminary report

0.008970084 = product of:
  0.044850416 = sum of:
    0.044850416 = weight(_text_:index in 5163) [ClassicSimilarity], result of:
      0.044850416 = score(doc=5163,freq=2.0), product of:
        0.18579477 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.04251826 = 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.2 = coord(1/5)

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.

0.008071217 = product of:
  0.04035608 = sum of:
    0.04035608 = weight(_text_:system in 5555) [ClassicSimilarity], result of:
      0.04035608 = score(doc=5555,freq=6.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = 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.2 = coord(1/5)

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." ***

0.008069678 = product of:
  0.040348392 = sum of:
    0.040348392 = weight(_text_:context in 5570) [ClassicSimilarity], result of:
      0.040348392 = score(doc=5570,freq=2.0), product of:
        0.17622331 = queryWeight, product of:
          4.14465 = idf(docFreq=1904, maxDocs=44218)
          0.04251826 = queryNorm
        0.22896172 = fieldWeight in 5570, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.14465 = idf(docFreq=1904, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5570)
  0.2 = coord(1/5)

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.007908144 = product of:
  0.03954072 = sum of:
    0.03954072 = weight(_text_:system in 4252) [ClassicSimilarity], result of:
      0.03954072 = score(doc=4252,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.29527056 = fieldWeight in 4252, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=4252)
  0.2 = coord(1/5)

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.007908144 = product of:
  0.03954072 = sum of:
    0.03954072 = weight(_text_:system in 5174) [ClassicSimilarity], result of:
      0.03954072 = score(doc=5174,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.29527056 = fieldWeight in 5174, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=5174)
  0.2 = coord(1/5)

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.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 2996) [ClassicSimilarity], result of:
      0.03727935 = score(doc=2996,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 2996, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=2996)
  0.2 = coord(1/5)

Abstract

This paper discusses the newly developed USMARC Format for Classification Data. It reviews its potential uses within an online system and its development as one of the USMARC standards for representing bibliographic and related information in machine-readable form. It provides a summary of the fields in the format, and considers the prospects for its implementation.

0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 8865) [ClassicSimilarity], result of:
      0.03727935 = score(doc=8865,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 8865, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=8865)
  0.2 = coord(1/5)

Abstract

This paper discusses the newly developed USMARC Format for Classification Data. It reviews its potential uses within an online system and its development as one of the USMARC standards. It provides a summary of the fields in the format and considers the prospects for its implementation. The papaer describes an experiment currently being conducted at the Library of Congress to create USMARC classification records and use a classification database in classifying materials in the social sciences

0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 4962) [ClassicSimilarity], result of:
      0.03727935 = score(doc=4962,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 4962, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=4962)
  0.2 = coord(1/5)

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.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 477) [ClassicSimilarity], result of:
      0.03727935 = score(doc=477,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 477, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=477)
  0.2 = coord(1/5)

0.0065901205 = product of:
  0.032950602 = sum of:
    0.032950602 = weight(_text_:system in 2481) [ClassicSimilarity], result of:
      0.032950602 = score(doc=2481,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.24605882 = fieldWeight in 2481, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2481)
  0.2 = coord(1/5)

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.0065901205 = product of:
  0.032950602 = sum of:
    0.032950602 = weight(_text_:system in 5969) [ClassicSimilarity], result of:
      0.032950602 = score(doc=5969,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.24605882 = fieldWeight in 5969, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5969)
  0.2 = coord(1/5)

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.

0.006523886 = product of:
  0.03261943 = sum of:
    0.03261943 = weight(_text_:system in 4786) [ClassicSimilarity], result of:
      0.03261943 = score(doc=4786,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.2435858 = fieldWeight in 4786, 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=4786)
  0.2 = coord(1/5)

0.006523886 = product of:
  0.03261943 = sum of:
    0.03261943 = weight(_text_:system in 8864) [ClassicSimilarity], result of:
      0.03261943 = score(doc=8864,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.2435858 = fieldWeight in 8864, 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=8864)
  0.2 = coord(1/5)

Abstract

The paper reviews the development of the USMARC Format for Classification Data, a standard for communication of classification data in machine-readable form. It considers the uses for online classification schedules, both for technical services and reference functions and gives an overview of the format specification details of data elements used and of the structure of the records. The paper describes an experiment conducted at the Library of Congress to test the format as well as the development of the classification database encompassing the LCC schedules. Features of the classification system are given. The LoC will complete its conversion of the LCC in mid-1995

0.006523886 = product of:
  0.03261943 = sum of:
    0.03261943 = weight(_text_:system in 6028) [ClassicSimilarity], result of:
      0.03261943 = score(doc=6028,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.2435858 = fieldWeight in 6028, 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=6028)
  0.2 = coord(1/5)

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.006523886 = product of:
  0.03261943 = sum of:
    0.03261943 = weight(_text_:system in 515) [ClassicSimilarity], result of:
      0.03261943 = score(doc=515,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.2435858 = fieldWeight in 515, 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=515)
  0.2 = coord(1/5)

Abstract

Developments in electronic communication technology have meda online databases a normal part of library collections. To provide users with direct access to Internet resources the Dutch Royal Library has cooperated with several university libraries in the Netherlands to develop the Nederlandse Basisclassificatie Web. Subject specialists select sources, add English summaries and NBW code, and input them to the online database. A Web desk and training workshops have been provided to assist users, and improvements to the system will simplify search procedures

0.006523886 = product of:
  0.03261943 = sum of:
    0.03261943 = weight(_text_:system in 5578) [ClassicSimilarity], result of:
      0.03261943 = score(doc=5578,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.2435858 = fieldWeight in 5578, 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=5578)
  0.2 = coord(1/5)

Abstract

Potential uses for classification data in machine readable form and reasons for the development of a standard, the USMARC Format for Classification Data, which allows for classification data to interact with other USMARC bibliographic and authority data are discussed. The development, structure, content, and use of the standard is reviewed with implementation decisions for the Library of Congress Classification scheme noted. The author examines the implementation of USMARC classification at LC, the conversion of the schedules, and the functionality of the software being used. Problems in the effort are explored, and enhancements desired for the online classification system are considered.