Search (89 results, page 1 of 5)

0.03815141 = product of:
  0.15260564 = sum of:
    0.03307401 = weight(_text_:libraries in 4396) [ClassicSimilarity], result of:
      0.03307401 = score(doc=4396,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.25406548 = fieldWeight in 4396, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4396)
    0.11953163 = weight(_text_:studies in 4396) [ClassicSimilarity], result of:
      0.11953163 = score(doc=4396,freq=12.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.75592977 = fieldWeight in 4396, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4396)
  0.25 = coord(2/8)

Abstract

Faceted browsing is a common feature of new library catalog interfaces. But to what extent does it improve user performance in searching within today's library catalog systems? This article reviews the literature for user studies involving faceted browsing and user studies of "next-generation" library catalogs that incorporate faceted browsing. Both the results and the methods of these studies are analyzed by asking, What do we currently know about faceted browsing? How can we design better studies of faceted browsing in library catalogs? The article proposes methodological considerations for practicing librarians and provides examples of goals, tasks, and measurements for user studies of faceted browsing in library catalogs.

Source

Information technology and libraries. 2010, June, S.58-66

0.025926981 = product of:
  0.06913862 = sum of:
    0.014174575 = weight(_text_:libraries in 1202) [ClassicSimilarity], result of:
      0.014174575 = score(doc=1202,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.1088852 = fieldWeight in 1202, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1202)
    0.02538763 = weight(_text_:case in 1202) [ClassicSimilarity], result of:
      0.02538763 = score(doc=1202,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.14572193 = fieldWeight in 1202, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1202)
    0.02957641 = weight(_text_:studies in 1202) [ClassicSimilarity], result of:
      0.02957641 = score(doc=1202,freq=4.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.18704411 = fieldWeight in 1202, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1202)
  0.375 = coord(3/8)

Abstract

The concept of c-space is proposed as a visualization schema relating containers of content to cataloging surrogates and classification structures. Possible applications of keyword vector clusters within c-space could include improved retrieval rates through the use of captioning within visual hierarchies, tracings of semantic bleeding among subclasses, and access to buried knowledge within subject-neutral publication containers. The Scholastica Project is described as one example, following a tradition of research dating back to the 1980's. Preliminary focus group assessment indicates that this type of classification rendering may offer digital library searchers enriched entry strategies and an expanded range of re-entry vocabularies. Those of us who work in traditional libraries typically assume that our systems of classification: Library of Congress Classification (LCC) and Dewey Decimal Classification (DDC), are descriptive rather than prescriptive. In other words, LCC classes and subclasses approximate natural groupings of texts that reflect an underlying order of knowledge, rather than arbitrary categories prescribed by librarians to facilitate efficient shelving. Philosophical support for this assumption has traditionally been found in a number of places, from the archetypal tree of knowledge, to Aristotelian categories, to the concept of discursive formations proposed by Michel Foucault. Gary P. Radford has elegantly described an encounter with Foucault's discursive formations in the traditional library setting: "Just by looking at the titles on the spines, you can see how the books cluster together...You can identify those books that seem to form the heart of the discursive formation and those books that reside on the margins. Moving along the shelves, you see those books that tend to bleed over into other classifications and that straddle multiple discursive formations. You can physically and sensually experience...those points that feel like state borders or national boundaries, those points where one subject ends and another begins, or those magical places where one subject has morphed into another..."
But what happens to this awareness in a digital library? Can discursive formations be represented in cyberspace, perhaps through diagrams in a visualization interface? And would such a schema be helpful to a digital library user? To approach this question, it is worth taking a moment to reconsider what Radford is looking at. First, he looks at titles to see how the books cluster. To illustrate, I scanned one hundred books on the shelves of a college library under subclass HT 101-395, defined by the LCC subclass caption as Urban groups. The City. Urban sociology. Of the first 100 titles in this sequence, fifty included the word "urban" or variants (e.g. "urbanization"). Another thirty-five used the word "city" or variants. These keywords appear to mark their titles as the heart of this discursive formation. The scattering of titles not using "urban" or "city" used related terms such as "town," "community," or in one case "skyscrapers." So we immediately see some empirical correlation between keywords and classification. But we also see a problem with the commonly used search technique of title-keyword. A student interested in urban studies will want to know about this entire subclass, and may wish to browse every title available therein. A title-keyword search on "urban" will retrieve only half of the titles, while a search on "city" will retrieve just over a third. There will be no overlap, since no titles in this sample contain both words. The only place where both words appear in a common string is in the LCC subclass caption, but captions are not typically indexed in library Online Public Access Catalogs (OPACs). In a traditional library, this problem is mitigated when the student goes to the shelf looking for any one of the books and suddenly discovers a much wider selection than the keyword search had led him to expect. But in a digital library, the issue of non-retrieval can be more problematic, as studies have indicated. Micco and Popp reported that, in a study funded partly by the U.S. Department of Education, 65 of 73 unskilled users searching for material on U.S./Soviet foreign relations found some material but never realized they had missed a large percentage of what was in the database.

0.021875493 = product of:
  0.08750197 = sum of:
    0.02834915 = weight(_text_:libraries in 4252) [ClassicSimilarity], result of:
      0.02834915 = score(doc=4252,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.2177704 = fieldWeight in 4252, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.046875 = fieldNorm(doc=4252)
    0.05915282 = weight(_text_:studies in 4252) [ClassicSimilarity], result of:
      0.05915282 = score(doc=4252,freq=4.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.37408823 = fieldWeight in 4252, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.046875 = fieldNorm(doc=4252)
  0.25 = coord(2/8)

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.01950733 = product of:
  0.07802932 = sum of:
    0.059237804 = weight(_text_:case in 88) [ClassicSimilarity], result of:
      0.059237804 = score(doc=88,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.34001783 = fieldWeight in 88, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.0546875 = fieldNorm(doc=88)
    0.018791512 = product of:
      0.037583023 = sum of:
        0.037583023 = weight(_text_:22 in 88) [ClassicSimilarity], result of:
          0.037583023 = score(doc=88,freq=2.0), product of:
            0.13876937 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03962768 = queryNorm
            0.2708308 = fieldWeight in 88, 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=88)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Date

10. 9.2000 17:38:22

0.018930627 = product of:
  0.07572251 = sum of:
    0.033409793 = weight(_text_:libraries in 2476) [ClassicSimilarity], result of:
      0.033409793 = score(doc=2476,freq=4.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.25664487 = fieldWeight in 2476, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2476)
    0.042312715 = weight(_text_:case in 2476) [ClassicSimilarity], result of:
      0.042312715 = score(doc=2476,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.24286987 = fieldWeight in 2476, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2476)
  0.25 = coord(2/8)

Abstract

Basic skills of classification and subject indexing have been little taught in British library schools since automation was introduced into libraries. However, development of the Internet as a major medium of publication has stretched the capability of search engines to cope with retrieval. Consequently, there has been interest in applying existing systems of knowledge organization to electronic resources. Unfortunately, the classification systems have been adopted without a full understanding of modern classification principles. Analytico-synthetic schemes have been used crudely, as in the case of the Universal Decimal Classification (UDC). The fully faceted Bliss Bibliographical Classification, 2nd edition (BC2) with its potential as a tool for electronic resource retrieval is virtually unknown outside academic libraries

0.016720567 = product of:
  0.06688227 = sum of:
    0.05077526 = weight(_text_:case in 3697) [ClassicSimilarity], result of:
      0.05077526 = score(doc=3697,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.29144385 = fieldWeight in 3697, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.046875 = fieldNorm(doc=3697)
    0.01610701 = product of:
      0.03221402 = sum of:
        0.03221402 = weight(_text_:22 in 3697) [ClassicSimilarity], result of:
          0.03221402 = score(doc=3697,freq=2.0), product of:
            0.13876937 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03962768 = queryNorm
            0.23214069 = fieldWeight in 3697, 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=3697)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Date

22. 7.2010 20:40:56

0.0148187205 = product of:
  0.059274882 = sum of:
    0.037798867 = weight(_text_:libraries in 4869) [ClassicSimilarity], result of:
      0.037798867 = score(doc=4869,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.29036054 = fieldWeight in 4869, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.0625 = fieldNorm(doc=4869)
    0.021476014 = product of:
      0.042952027 = sum of:
        0.042952027 = weight(_text_:22 in 4869) [ClassicSimilarity], result of:
          0.042952027 = score(doc=4869,freq=2.0), product of:
            0.13876937 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03962768 = queryNorm
            0.30952093 = fieldWeight in 4869, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=4869)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Abstract

This article gives an overview of the design and organisation of DutchESS, a Dutch information subject gateway created as a national collaborative effort of the National Library and a number of academic libraries. The combined centralised and distributed model of DutchESS is discussed, as well as its selection policy, its metadata format, classification scheme and retrieval options. Also some options for future collaboration on an international level are explored

Date

22. 6.2002 19:39:23

0.012285966 = product of:
  0.049143866 = sum of:
    0.027884906 = weight(_text_:studies in 26) [ClassicSimilarity], result of:
      0.027884906 = score(doc=26,freq=2.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.17634688 = fieldWeight in 26, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03125 = fieldNorm(doc=26)
    0.02125896 = product of:
      0.04251792 = sum of:
        0.04251792 = weight(_text_:area in 26) [ClassicSimilarity], result of:
          0.04251792 = score(doc=26,freq=2.0), product of:
            0.1952553 = queryWeight, product of:
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.03962768 = queryNorm
            0.21775553 = fieldWeight in 26, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.03125 = fieldNorm(doc=26)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Abstract

We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more effective information-seeking support to users than best-first search. Indeed, faceted search has become increasingly prevalent in online information access systems, particularly for e-commerce and site search. In this lecture, we explore the history, theory, and practice of faceted search. Although we cannot hope to be exhaustive, our aim is to provide sufficient depth and breadth to offer a useful resource to both researchers and practitioners. Because faceted search is an area of interest to computer scientists, information scientists, interface designers, and usability researchers, we do not assume that the reader is a specialist in any of these fields. Rather, we offer a self-contained treatment of the topic, with an extensive bibliography for those who would like to pursue particular aspects in more depth.

0.012241036 = product of:
  0.048964143 = sum of:
    0.018899433 = weight(_text_:libraries in 6486) [ClassicSimilarity], result of:
      0.018899433 = score(doc=6486,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.14518027 = fieldWeight in 6486, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03125 = fieldNorm(doc=6486)
    0.03006471 = product of:
      0.06012942 = sum of:
        0.06012942 = weight(_text_:area in 6486) [ClassicSimilarity], result of:
          0.06012942 = score(doc=6486,freq=4.0), product of:
            0.1952553 = queryWeight, product of:
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.03962768 = queryNorm
            0.30795282 = fieldWeight in 6486, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.03125 = fieldNorm(doc=6486)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Abstract

The scatter of items dealing with similar concepts through the physical library is a consequence of a classification process that produces a single notation to enable relative location. Compromises must be made to place an item where it is most appropriate for a given user community. No such compromise is needed with a digital library where the item can be considered to occupy a very large number of relative locations, as befits the needs of the user. Interfaces to these digital libraries can reuse the knowledge structures of their physical counterparts yet still address the problem of scatter. View-based searching is an approach that takes advantage of the knowledge structures but addresses the problem of scatter by applying a facetted approach to information retrieval. This paper describes the most recent developments in the implementation of a view-based searching system for a University Library OPAC. The user interface exploits the knowledge structures in the Dewey Decimal Classification Scheme (DDC) in navigable views with implicit Boolean searching. DDC classifies multifaceted items by building a single relative code from components. These codes may already have been combined in the schedules or be built according to well-documented instructions. Rules can be applied to decode these numbers to provide codes for each additional facet. To enhance the retrieval power of the view-based searching system, multiple facet codes are being extracted through decomposition from single Dewey Class Codes. This paper presents the results of applying automatic decomposition in respect of Geographic Area and the creation of a view (by Geographic Area) for the full collection of over 250,000 library items. This is the first step in demonstrating how the problem of scatter of subject matter across the disciplines of the Dewey Decimal Classification and the physical library collection can be addressed through the use of facets and view-based searching

0.011903927 = product of:
  0.031743806 = sum of:
    0.009449717 = weight(_text_:libraries in 2047) [ClassicSimilarity], result of:
      0.009449717 = score(doc=2047,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.072590135 = fieldWeight in 2047, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.015625 = fieldNorm(doc=2047)
    0.016925087 = weight(_text_:case in 2047) [ClassicSimilarity], result of:
      0.016925087 = score(doc=2047,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.09714795 = fieldWeight in 2047, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.015625 = fieldNorm(doc=2047)
    0.0053690034 = product of:
      0.010738007 = sum of:
        0.010738007 = weight(_text_:22 in 2047) [ClassicSimilarity], result of:
          0.010738007 = score(doc=2047,freq=2.0), product of:
            0.13876937 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03962768 = queryNorm
            0.07738023 = fieldWeight in 2047, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.015625 = fieldNorm(doc=2047)
      0.5 = coord(1/2)
  0.375 = coord(3/8)

Date

2. 1.2004 10:35:22

Footnote

AHUJA and SATIJA (Relevance of Ranganathan's Classification Theory in the Age of Digital Libraries) note that traditional bibliographic classification systems have been applied in the digital environment with only limited success. They find that the "inherent flexibility of electronic manipulation of documents or their surrogates should allow a more organic approach to allocation of new subjects and appropriate linkages between subject hierarchies." (p. 18). Ahija and Satija also suggest that it is necessary to shift from a "subject" focus to a "need" focus when applying classification theory in the digital environment. They find Ranganathan's framework applicable in the digital environment. Although Ranganathan's focus is "subject oriented and hence emphasise the hierarchical and linear relationships" (p. 26), his framework "can be successfully adopted with certain modifications ... in the digital environment." (p. 26). SHAH and KUMAR (Model for System Unification of Geographical Schedules (Space Isolates)) report an a plan to develop a single schedule for geographical Subdivision that could be used across all classification systems. The authors argue that this is needed in order to facilitate interoperability in the digital environment. SAN SEGUNDO MANUEL (The Representation of Knowledge as a Symbolization of Productive Electronic Information) distills different approaches and definitions of the term "representation" as it relates to representation of knowledge in the library and information science literature and field. SHARADA (Linguistic and Document Classification: Paradigmatic Merger Possibilities) suggests the development of a universal indexing language. The foundation for the universal indexing language is Chomsky's Minimalist Program and Ranganathan's analytico-synthetic classification theory; Acording to the author, based an these approaches, it "should not be a problem" (p. 62) to develop a universal indexing language.
PARAMESWARAN (Classification and Indexing: Impact of Classification Theory an PRECIS) reviews the PRECIS system and finds that "it Gould not escape from the impact of the theory of classification" (p. 131). The author further argues that the purpose of classification and subject indexing is the same and that both approaches depends an syntax. This leads to the conclusion that "there is an absolute syntax as the Indian theory of classification points out" (p. 131). SATYAPAL and SANJIVINI SATYAPAL (Classifying Documents According to Postulational Approach: 1. SA TSAN- A Computer Based Learning Package) and SATYAPAL and SANJIVINI SATYAPAL (Classifying Documents According to Postulational Approach: 2. Semi-Automatic Synthesis of CC Numbers) present an application to automate classification using a facet classification system, in this Gase, the Colon Classification system. GAIKAIWARI (An Interactive Application for Faceted Classification Systems) presents an application, called SRR, for managing and using a faceted classification scheme in a digital environment. IYER (Use of Instructional Technology to Support Traditional Classroom Learning: A Case Study) describes a course an "Information and Knowledge Organization" that she teaches at the University at Albany (SUNY). The course is a conceptual course that introduces the student to various aspects of knowledge organization. GOPINATH (Universal Classification: How can it be used?) lists fifteen uses of universal classifications and discusses the entities of a number of disciplines. GOPINATH (Knowledge Classification: The Theory of Classification) briefly reviews the foundations for research in automatic classification, summarizes the history of classification, and places Ranganathan's thought in the history of classification.

0.01111404 = product of:
  0.04445616 = sum of:
    0.02834915 = weight(_text_:libraries in 4144) [ClassicSimilarity], result of:
      0.02834915 = score(doc=4144,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.2177704 = fieldWeight in 4144, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.046875 = fieldNorm(doc=4144)
    0.01610701 = product of:
      0.03221402 = sum of:
        0.03221402 = weight(_text_:22 in 4144) [ClassicSimilarity], result of:
          0.03221402 = score(doc=4144,freq=2.0), product of:
            0.13876937 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03962768 = queryNorm
            0.23214069 = fieldWeight in 4144, 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=4144)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Abstract

Exploring collections by their subject matter is an important functionality for library users. We developed an online tool called SciGator in order to allow users to browse the Dewey Decimal Classification (DDC) classes used in different libraries at the University of Pavia and to perform different types of search in the OPAC. Besides navigation of DDC hierarchies, SciGator suggests "see-also" relationships with related classes and maps equivalent classes in local shelving schemes, thus allowing the expansion of search queries to include subjects contiguous to the initial one. We are developing new features, including the possibility to expand searches even more to national and international catalogues.

Content

Beitrag eines Special Issue: ISKO-Italy: 8' Incontro ISKO Italia, Università di Bologna, 22 maggio 2017, Bologna, Italia.

0.009449717 = product of:
  0.07559773 = sum of:
    0.07559773 = weight(_text_:libraries in 113) [ClassicSimilarity], result of:
      0.07559773 = score(doc=113,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.5807211 = fieldWeight in 113, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.125 = fieldNorm(doc=113)
  0.125 = coord(1/8)

Source

Information technology and libraries. 7(1988), S.381-393

0.009054627 = product of:
  0.03621851 = sum of:
    0.017428067 = weight(_text_:studies in 2467) [ClassicSimilarity], result of:
      0.017428067 = score(doc=2467,freq=2.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.110216804 = fieldWeight in 2467, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.01953125 = fieldNorm(doc=2467)
    0.018790444 = product of:
      0.03758089 = sum of:
        0.03758089 = weight(_text_:area in 2467) [ClassicSimilarity], result of:
          0.03758089 = score(doc=2467,freq=4.0), product of:
            0.1952553 = queryWeight, product of:
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.03962768 = queryNorm
            0.19247052 = fieldWeight in 2467, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.01953125 = fieldNorm(doc=2467)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Abstract

Consider movie listings in newspapers. Most Canadian newspapers list movie showtimes in two large blocks, for the two major theatre chains. The listings are ordered by region (in large cities), then theatre, then movie, and finally by showtime. Anyone wondering where and when a particular movie is playing must scan the complete listings. Determining what movies are playing in the next half hour is very difficult. When movie listings went onto the web, most sites used a simple faceted organization, always with movie name and theatre, and perhaps with region or neighbourhood (thankfully, theatre chains were left out). They make it easy to pick a theatre and see what movies are playing there, or to pick a movie and see what theatres are showing it. To complete the system, the sites should allow users to browse by neighbourhood and showtime, and to order the results in any way they desired. Thus could people easily find answers to such questions as, "Where is the new James Bond movie playing?" "What's showing at the Roxy tonight?" "I'm going to be out in in Little Finland this afternoon with three hours to kill starting at 2 ... is anything interesting playing?" A hypertext, faceted classification system makes more useful information more easily available to the user. Reading the books and articles below in chronological order will show a certain progression: suggestions that faceting and hypertext might work well, confidence that facets would work well if only someone would make such a system, and finally the beginning of serious work on actually designing, building, and testing faceted web sites. There is a solid basis of how to make faceted classifications (see Vickery in Recommended), but their application online is just starting. Work on XFML (see Van Dijck's work in Recommended) the Exchangeable Faceted Metadata Language, will make this easier. If it follows previous patterns, parts of the Internet community will embrace the idea and make open source software available for others to reuse. It will be particularly beneficial if professionals in both information studies and computer science can work together to build working systems, standards, and code. Each can benefit from the other's expertise in what can be a very complicated and technical area. One particularly nice thing about this area of research is that people interested in combining facets and the web often have web sites where they post their writings.

0.008714033 = product of:
  0.06971227 = sum of:
    0.06971227 = weight(_text_:studies in 4561) [ClassicSimilarity], result of:
      0.06971227 = score(doc=4561,freq=2.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.44086722 = fieldWeight in 4561, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.078125 = fieldNorm(doc=4561)
  0.125 = coord(1/8)

Source

Information studies. 4(1998) no.4, S.212-216

0.008352448 = product of:
  0.066819586 = sum of:
    0.066819586 = weight(_text_:libraries in 4137) [ClassicSimilarity], result of:
      0.066819586 = score(doc=4137,freq=4.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.51328975 = fieldWeight in 4137, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.078125 = fieldNorm(doc=4137)
  0.125 = coord(1/8)

Footnote

1. Aufl. unter: Aluri, R.D., A. Kemp u. J.J. Boll: Subject analysis in online catalogs. Englewood, CO: Libraries Unlimited 1991. XII,303 S. ISBN 0-87287-670-5

Imprint

Englewood, CO : Libraries Unlimited

0.008268503 = product of:
  0.06614802 = sum of:
    0.06614802 = weight(_text_:libraries in 1145) [ClassicSimilarity], result of:
      0.06614802 = score(doc=1145,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.50813097 = fieldWeight in 1145, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.109375 = fieldNorm(doc=1145)
  0.125 = coord(1/8)

Source

Information technology and libraries. 5(1986), S.181-192

0.008268503 = product of:
  0.06614802 = sum of:
    0.06614802 = weight(_text_:libraries in 2087) [ClassicSimilarity], result of:
      0.06614802 = score(doc=2087,freq=2.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.50813097 = fieldWeight in 2087, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.109375 = fieldNorm(doc=2087)
  0.125 = coord(1/8)

Source

Information technology and libraries. 4(1985), S.107 -

0.0074047255 = product of:
  0.059237804 = sum of:
    0.059237804 = weight(_text_:case in 538) [ClassicSimilarity], result of:
      0.059237804 = score(doc=538,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.34001783 = fieldWeight in 538, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.0546875 = fieldNorm(doc=538)
  0.125 = coord(1/8)

0.0074047255 = product of:
  0.059237804 = sum of:
    0.059237804 = weight(_text_:case in 4838) [ClassicSimilarity], result of:
      0.059237804 = score(doc=4838,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.34001783 = fieldWeight in 4838, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4838)
  0.125 = coord(1/8)

Abstract

In a global context characterized by the massive use of information technology and communications any organization needs to optimize the search and document management processes. In this paper an analysis of modern document management techniques and computational strategies with specialized language resources is presented and a model that can be used in automatic text categorization in the context of organizations is proposed.As a particular case we describe a classification system according to the taxonomy JEL (Journal of Economic Literature) and that makes use of multilingual glossaries for hierarchical classifications of scientific and technical documents related to the business functional areas.

0.007160733 = product of:
  0.057285864 = sum of:
    0.057285864 = weight(_text_:libraries in 3574) [ClassicSimilarity], result of:
      0.057285864 = score(doc=3574,freq=6.0), product of:
        0.13017908 = queryWeight, product of:
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.03962768 = queryNorm
        0.4400543 = fieldWeight in 3574, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2850544 = idf(docFreq=4499, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3574)
  0.125 = coord(1/8)

Abstract

Results of a survey of North Carolina Libraries revealed that of 91 respondents, 29 had on-line catalogues. Of the libraries with on-line catalogues, 11 used the Dewey Decimal Classification (DDC). Survey findings indicate that the DDC has limited use in on-line searching today.