Search (31 results, page 1 of 2)

  • × theme_ss:"Klassifikationssysteme im Online-Retrieval"
  • × type_ss:"el"
  1. Van Dijck, P.: Introduction to XFML (2003) 0.03 
    0.02823769 = product of:
  0.07059422 = sum of:
    0.00770594 = weight(_text_:a in 2474) [ClassicSimilarity], result of:
      0.00770594 = score(doc=2474,freq=4.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.14413087 = fieldWeight in 2474, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=2474)
    0.06288828 = sum of:
      0.012630116 = weight(_text_:information in 2474) [ClassicSimilarity], result of:
        0.012630116 = score(doc=2474,freq=2.0), product of:
          0.08139861 = queryWeight, product of:
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.046368346 = queryNorm
          0.1551638 = fieldWeight in 2474, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.0625 = fieldNorm(doc=2474)
      0.050258167 = weight(_text_:22 in 2474) [ClassicSimilarity], result of:
        0.050258167 = score(doc=2474,freq=2.0), product of:
          0.16237405 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046368346 = queryNorm
          0.30952093 = fieldWeight in 2474, 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=2474)
  0.4 = coord(2/5)
    Abstract
    Van Dijck builds up an example of actual XFML by showing how to organize tourist information about what restaurants in what cities feature which kind of music: <facet id="city">City</facet> and <topic id="ny" facetid="city"><name>New York</name></topic> combine to mean that New York is the name of a city internally represented as "ny". It is written in the usual clear and practical style of articles on xml.com. Highly recommended as an introduction for anyone interested in XFML.
    Source
    http://www.xml.com/lpt/a/2003/01/22/xfml.html
  2. Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009) 0.02 
    0.015722072 = product of:
  0.07861035 = sum of:
    0.07861035 = sum of:
      0.015787644 = weight(_text_:information in 611) [ClassicSimilarity], result of:
        0.015787644 = score(doc=611,freq=2.0), product of:
          0.08139861 = queryWeight, product of:
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.046368346 = queryNorm
          0.19395474 = fieldWeight in 611, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.078125 = fieldNorm(doc=611)
      0.06282271 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
        0.06282271 = score(doc=611,freq=2.0), product of:
          0.16237405 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046368346 = queryNorm
          0.38690117 = fieldWeight in 611, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.078125 = fieldNorm(doc=611)
  0.2 = coord(1/5)
    Content
    Präsentation zum Vortrag anlässlich des 98. Deutscher Bibliothekartag in Erfurt: Ein neuer Blick auf Bibliotheken; TK10: Information erschließen und recherchieren Inhalte erschließen - mit neuen Tools
    Date
    22. 8.2009 12:54:24
  3. Place, E.: Internationale Zusammenarbeit bei Internet Subject Gateways (1999) 0.01 
    0.010820125 = product of:
  0.054100625 = sum of:
    0.054100625 = sum of:
      0.016407004 = weight(_text_:information in 4189) [ClassicSimilarity], result of:
        0.016407004 = score(doc=4189,freq=6.0), product of:
          0.08139861 = queryWeight, product of:
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.046368346 = queryNorm
          0.20156369 = fieldWeight in 4189, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.046875 = fieldNorm(doc=4189)
      0.037693623 = weight(_text_:22 in 4189) [ClassicSimilarity], result of:
        0.037693623 = score(doc=4189,freq=2.0), product of:
          0.16237405 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046368346 = queryNorm
          0.23214069 = fieldWeight in 4189, 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=4189)
  0.2 = coord(1/5)
    Abstract
    Eine ganze Anzahl von Bibliotheken in Europa befaßt sich mit der Entwicklung von Internet Subject Gateways - einer Serviceleistung, die den Nutzern helfen soll, qualitativ hochwertige Internetquellen zu finden. Subject Gateways wie SOSIG (The Social Science Information Gateway) sind bereits seit einigen Jahren im Internet verfügbar und stellen eine Alternative zu Internet-Suchmaschinen wie AltaVista und Verzeichnissen wie Yahoo dar. Bezeichnenderweise stützen sich Subject Gateways auf die Fertigkeiten, Verfahrensweisen und Standards der internationalen Bibliothekswelt und wenden diese auf Informationen aus dem Internet an. Dieses Referat will daher betonen, daß Bibliothekare/innen idealerweise eine vorherrschende Rolle im Aufbau von Suchservices für Internetquellen spielen und daß Information Gateways eine Möglichkeit dafür darstellen. Es wird einige der Subject Gateway-Initiativen in Europa umreißen und die Werkzeuge und Technologien beschreiben, die vom Projekt DESIRE entwickelt wurden, um die Entwicklung neuer Gateways in anderen Ländern zu unterstützen. Es wird auch erörtert, wie IMesh, eine Gruppe für Gateways aus der ganzen Welt eine internationale Strategie für Gateways anstrebt und versucht, Standards zur Umsetzung dieses Projekts zu entwickeln
    Date
    22. 6.2002 19:35:09
    Theme
    Information Gateway
  4. Woods, E.W.; IFLA Section on classification and Indexing and Indexing and Information Technology; Joint Working Group on a Classification Format: Requirements for a format of classification data : Final report, July 1996 (1996) 0.01 
    0.008412599 = product of:
  0.021031497 = sum of:
    0.01155891 = weight(_text_:a in 3008) [ClassicSimilarity], result of:
      0.01155891 = score(doc=3008,freq=4.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.2161963 = fieldWeight in 3008, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.09375 = fieldNorm(doc=3008)
    0.009472587 = product of:
      0.018945174 = sum of:
        0.018945174 = weight(_text_:information in 3008) [ClassicSimilarity], result of:
          0.018945174 = score(doc=3008,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.23274569 = fieldWeight in 3008, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.09375 = fieldNorm(doc=3008)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
  5. Louie, A.J.; Maddox, E.L.; Washington, W.: Using faceted classification to provide structure for information architecture (2003) 0.01 
    0.0079049645 = product of:
  0.019762412 = sum of:
    0.01155891 = weight(_text_:a in 2471) [ClassicSimilarity], result of:
      0.01155891 = score(doc=2471,freq=16.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.2161963 = fieldWeight in 2471, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=2471)
    0.008203502 = product of:
      0.016407004 = sum of:
        0.016407004 = weight(_text_:information in 2471) [ClassicSimilarity], result of:
          0.016407004 = score(doc=2471,freq=6.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.20156369 = fieldWeight in 2471, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046875 = fieldNorm(doc=2471)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    This is a short, but very thorough and very interesting, report on how the writers built a faceted classification for some legal information and used it to structure a web site with navigation and searching. There is a good summary of why facets work well and how they fit into bibliographic control in general. The last section is about their implementation of a web site for the Washington State Bar Association's Council for Legal Public Education. Their classification uses three facets: Purpose (the general aim of the document, e.g. Resources for K-12 Teachers), Topic (the subject of the document), and Type (the legal format of the document). See Example Web Sites, below, for a discussion of the site and a problem with its design.
    Content
    A very large PDF of the six-foot-wide illustrated poster from their poster session is available at http://depts.washington.edu/pettt/presentations/conf_2003/IASummit-Poster-Louie.pdf.
    Footnote
    Paper presented at the ASIS&T 2003 Information Architecture Summit, Portland, OR, 21-23 March 2003.
  6. Schallier, W.: Why organize information if you can find it? : UDC and libraries in an Internet world (2007) 0.01 
    0.007189882 = product of:
  0.017974705 = sum of:
    0.0068111527 = weight(_text_:a in 549) [ClassicSimilarity], result of:
      0.0068111527 = score(doc=549,freq=8.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.12739488 = fieldWeight in 549, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=549)
    0.011163551 = product of:
      0.022327103 = sum of:
        0.022327103 = weight(_text_:information in 549) [ClassicSimilarity], result of:
          0.022327103 = score(doc=549,freq=16.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.27429342 = fieldWeight in 549, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0390625 = fieldNorm(doc=549)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    The Belgians Otlet and LaFontaine created the Universal Decimal Classification in order to collect and organize the world's knowledge. This happened in an age when information was almost exclusively made available by libraries. Since the internet, the quantity of information outside libraries is enormous and keeps growing every day. The internet is accessible to anybody, it is fundamentally unorganized and its content changes constantly. Collecting and organizing the world's knowledge seem to have become an impossible ambition. Perhaps it is even unnecessary, since search engines make information retrievable now. And why would we organize information if we can find it? So what will be the role of UDC and libraries in this internet environment? Libraries can still play a role as a major information provider, if they adapt fully to the expectations of a modern end user. The design and the functionalities of online catalogues should allow maximal accessibility, usability and active participation of the end user in the internet environment. Metadata, like UDC, should maximize the visibility of information, enrich it and invite the end user to assign metadata himself.
    Content
    Beitrag anlässlich des 'UDC Seminar: Information Access for the Global Community, The Hague, 4-5 June 2007'. - http://www.udcc.org/seminar07/presentations/schallier.pdf.
    Type
    a
  7. Rocha, R.; Cobo, A.: Automatización de procesos de categorización jerárquica documental en las organizaciones (2010) 0.01 
    0.0068817483 = product of:
  0.01720437 = sum of:
    0.011678694 = weight(_text_:a in 4838) [ClassicSimilarity], result of:
      0.011678694 = score(doc=4838,freq=12.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.21843673 = fieldWeight in 4838, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4838)
    0.005525676 = product of:
      0.011051352 = sum of:
        0.011051352 = weight(_text_:information in 4838) [ClassicSimilarity], result of:
          0.011051352 = score(doc=4838,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.13576832 = fieldWeight in 4838, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4838)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    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.
    Type
    a
  8. Faceted classification of information (o.J.) 0.01 
    0.00588199 = product of:
  0.014704974 = sum of:
    0.0068111527 = weight(_text_:a in 2653) [ClassicSimilarity], result of:
      0.0068111527 = score(doc=2653,freq=2.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.12739488 = fieldWeight in 2653, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.078125 = fieldNorm(doc=2653)
    0.007893822 = product of:
      0.015787644 = sum of:
        0.015787644 = weight(_text_:information in 2653) [ClassicSimilarity], result of:
          0.015787644 = score(doc=2653,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.19395474 = fieldWeight in 2653, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.078125 = fieldNorm(doc=2653)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    An explanation of faceted classification meant for people working in knowledge management. An example given for a high-technology company has the fundamental categories Products, Applications, Organizations, People, Domain objects ("technologies applied in the marketplace in which the organization participates"), Events (i.e. time), and Publications.
  9. Day, M.; Koch, T.: ¬The role of classification schemes in Internet resource description and discovery : DESIRE - Development of a European Service for Information on Research and Education. Specification for resource description methods, part 3 (1997) 0.01 
    0.00588199 = product of:
  0.014704974 = sum of:
    0.0068111527 = weight(_text_:a in 3067) [ClassicSimilarity], result of:
      0.0068111527 = score(doc=3067,freq=2.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.12739488 = fieldWeight in 3067, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.078125 = fieldNorm(doc=3067)
    0.007893822 = product of:
      0.015787644 = sum of:
        0.015787644 = weight(_text_:information in 3067) [ClassicSimilarity], result of:
          0.015787644 = score(doc=3067,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.19395474 = fieldWeight in 3067, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.078125 = fieldNorm(doc=3067)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
  10. Tunkelang, D.: Dynamic category sets : an approach for faceted search (2006) 0.01 
    0.005513504 = product of:
  0.01378376 = sum of:
    0.008258085 = weight(_text_:a in 3082) [ClassicSimilarity], result of:
      0.008258085 = score(doc=3082,freq=6.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.1544581 = fieldWeight in 3082, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3082)
    0.005525676 = product of:
      0.011051352 = sum of:
        0.011051352 = weight(_text_:information in 3082) [ClassicSimilarity], result of:
          0.011051352 = score(doc=3082,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.13576832 = fieldWeight in 3082, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3082)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    In this paper, we present Dynamic Category Sets, a novel approach that addresses the vocabulary problem for faceted data. In their paper on the vocabulary problem, Furnas et al. note that "the keywords that are assigned by indexers are often at odds with those tried by searchers." Faceted search systems exhibit an interesting aspect of this problem: users do not necessarily understand an information space in terms of the same facets as the indexers who designed it. Our approach addresses this problem by employing a data-driven approach to discover sets of values across multiple facets that best match the query. When there are multiple candidates, we offer a clarification dialog that allows the user to disambiguate them.
  11. Fagan, J.C.: Usability studies of faceted browsing : a literature review (2010) 0.01 
    0.005513504 = product of:
  0.01378376 = sum of:
    0.008258085 = weight(_text_:a in 4396) [ClassicSimilarity], result of:
      0.008258085 = score(doc=4396,freq=6.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.1544581 = fieldWeight in 4396, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4396)
    0.005525676 = product of:
      0.011051352 = sum of:
        0.011051352 = weight(_text_:information in 4396) [ClassicSimilarity], result of:
          0.011051352 = score(doc=4396,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.13576832 = fieldWeight in 4396, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4396)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    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
    Type
    a
  12. Liu, S.: Decomposing DDC synthesized numbers (1996) 0.01 
    0.0054589617 = product of:
  0.0136474045 = sum of:
    0.0068111527 = weight(_text_:a in 5969) [ClassicSimilarity], result of:
      0.0068111527 = score(doc=5969,freq=8.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.12739488 = fieldWeight in 5969, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5969)
    0.006836252 = product of:
      0.013672504 = sum of:
        0.013672504 = weight(_text_:information in 5969) [ClassicSimilarity], result of:
          0.013672504 = score(doc=5969,freq=6.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.16796975 = fieldWeight in 5969, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5969)
      0.5 = coord(1/2)
  0.4 = coord(2/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.
  13. Robbio, A. de; Maguolo, D.; Marini, A.: Scientific and general subject classifications in the digital world (2001) 0.01 
    0.0054005743 = product of:
  0.0135014355 = sum of:
    0.009036016 = weight(_text_:a in 2) [ClassicSimilarity], result of:
      0.009036016 = score(doc=2,freq=22.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.16900843 = fieldWeight in 2, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.03125 = fieldNorm(doc=2)
    0.0044654203 = product of:
      0.0089308405 = sum of:
        0.0089308405 = weight(_text_:information in 2) [ClassicSimilarity], result of:
          0.0089308405 = score(doc=2,freq=4.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.10971737 = fieldWeight in 2, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.03125 = fieldNorm(doc=2)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    In the present work we discuss opportunities, problems, tools and techniques encountered when interconnecting discipline-specific subject classifications, primarily organized as search devices in bibliographic databases, with general classifications originally devised for book shelving in public libraries. We first state the fundamental distinction between topical (or subject) classifications and object classifications. Then we trace the structural limitations that have constrained subject classifications since their library origins, and the devices that were used to overcome the gap with genuine knowledge representation. After recalling some general notions on structure, dynamics and interferences of subject classifications and of the objects they refer to, we sketch a synthetic overview on discipline-specific classifications in Mathematics, Computing and Physics, on one hand, and on general classifications on the other. In this setting we present The Scientific Classifications Page, which collects groups of Web pages produced by a pool of software tools for developing hypertextual presentations of single or paired subject classifications from sequential source files, as well as facilities for gathering information from KWIC lists of classification descriptions. Further we propose a concept-oriented methodology for interconnecting subject classifications, with the concrete support of a relational analysis of the whole Mathematics Subject Classification through its evolution since 1959. Finally, we recall a very basic method for interconnection provided by coreference in bibliographic records among index elements from different systems, and point out the advantages of establishing the conditions of a more widespread application of such a method. A part of these contents was presented under the title Mathematics Subject Classification and related Classifications in the Digital World at the Eighth International Conference Crimea 2001, "Libraries and Associations in the Transient World: New Technologies and New Forms of Cooperation", Sudak, Ukraine, June 9-17, 2001, in a special session on electronic libraries, electronic publishing and electronic information in science chaired by Bernd Wegner, Editor-in-Chief of Zentralblatt MATH.
  14. Pika, J.: Universal Decimal Classification at the ETH-Bibliothek Zürich : a Swiss perspective (2007) 0.01 
    0.0051638708 = product of:
  0.012909677 = sum of:
    0.008173384 = weight(_text_:a in 5899) [ClassicSimilarity], result of:
      0.008173384 = score(doc=5899,freq=8.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.15287387 = fieldWeight in 5899, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=5899)
    0.0047362936 = product of:
      0.009472587 = sum of:
        0.009472587 = weight(_text_:information in 5899) [ClassicSimilarity], result of:
          0.009472587 = score(doc=5899,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.116372846 = fieldWeight in 5899, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046875 = fieldNorm(doc=5899)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    The ETH library has been using the UDC for the past twenty-five years and yet most of the users had almost never taken a single notice about it. The query in today's NEBIS-OPAC (former ETHICS) is based on verbal search with three-lingual descriptors and corresponding related search-terms including e.g. synonyma as well as user-friendly expressions from scientific journals - scientific jargon - to facilitate the dialog with OPAC. A single UDC number, standing behind these descriptors, connects them to the related document-titles, regardless of language. Thus the user actually works with the UDC, without realizing it. This paper describes the experience with this OPAC and the work behind it.
    Content
    Beitrag anlässlich des 'UDC Seminar: Information Access for the Global Community, The Hague, 4-5 June 2007'. - Vgl.: http://www.udcc.org/seminar07/presentations/pika.pdf.
    Type
    a
  15. Denton, W.: Putting facets on the Web : an annotated bibliography (2003) 0.00 
    0.004573423 = product of:
  0.011433557 = sum of:
    0.0070207757 = weight(_text_:a in 2467) [ClassicSimilarity], result of:
      0.0070207757 = score(doc=2467,freq=34.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.13131565 = fieldWeight in 2467, product of:
          5.8309517 = tf(freq=34.0), with freq of:
            34.0 = termFreq=34.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.01953125 = fieldNorm(doc=2467)
    0.004412781 = product of:
      0.008825562 = sum of:
        0.008825562 = weight(_text_:information in 2467) [ClassicSimilarity], result of:
          0.008825562 = score(doc=2467,freq=10.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.10842399 = fieldWeight in 2467, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.01953125 = fieldNorm(doc=2467)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    This is a classified, annotated bibliography about how to design faceted classification systems and make them usable on the World Wide Web. It is the first of three works I will be doing. The second, based on the material here and elsewhere, will discuss how to actually make the faceted system and put it online. The third will be a report of how I did just that, what worked, what didn't, and what I learned. Almost every article or book listed here begins with an explanation of what a faceted classification system is, so I won't (but see Steckel in Background below if you don't already know). They all agree that faceted systems are very appropriate for the web. Even pre-web articles (such as Duncan's in Background, below) assert that hypertext and facets will go together well. Combined, it is possible to take a set of documents and classify them or apply subject headings to describe what they are about, then build a navigational structure so that any user, no matter how he or she approaches the material, no matter what his or her goals, can move and search in a way that makes sense to them, but still get to the same useful results as someone else following a different path to the same goal. There is no one way that everyone will always use when looking for information. The more flexible the organization of the information, the more accommodating it is. Facets are more flexible for hypertext browsing than any enumerative or hierarchical system.
    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.
    This bibliography is not meant to be exhaustive, but unfortunately it is not as complete as I wanted. Some books and articles are not be included, but they may be used in my future work. (These include two books and one article by B.C. Vickery: Faceted Classification Schemes (New Brunswick, NJ: Rutgers, 1966), Classification and Indexing in Science, 3rd ed. (London: Butterworths, 1975), and "Knowledge Representation: A Brief Review" (Journal of Documentation 42 no. 3 (September 1986): 145-159; and A.C. Foskett's "The Future of Faceted Classification" in The Future of Classification, edited by Rita Marcella and Arthur Maltby (Aldershot, England: Gower, 2000): 69-80). Nevertheless, I hope this bibliography will be useful for those both new to or familiar with faceted hypertext systems. Some very basic resources are listed, as well as some very advanced ones. Some example web sites are mentioned, but there is no detailed technical discussion of any software. The user interface to any web site is extremely important, and this is briefly mentioned in two or three places (for example the discussion of lawforwa.org (see Example Web Sites)). The larger question of how to display information graphically and with hypertext is outside the scope of this bibliography. There are five sections: Recommended, Background, Not Relevant, Example Web Sites, and Mailing Lists. Background material is either introductory, advanced, or of peripheral interest, and can be read after the Recommended resources if the reader wants to know more. The Not Relevant category contains articles that may appear in bibliographies but are not relevant for my purposes.
  16. Slavic, A.: Interface to classification : some objectives and options (2006) 0.00 
    0.0025846509 = product of:
  0.012923255 = sum of:
    0.012923255 = weight(_text_:a in 2131) [ClassicSimilarity], result of:
      0.012923255 = score(doc=2131,freq=20.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.24171482 = fieldWeight in 2131, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=2131)
  0.2 = coord(1/5)
    Abstract
    This is a preprint to be published in the Extensions & Corrections to the UDC. The paper explains the basic functions of browsing and searching that need to be supported in relation to analytico-synthetic classifications such as Universal Decimal Classification (UDC), irrespective of any specific, real-life implementation. UDC is an example of a semi-faceted system that can be used, for instance, for both post-coordinate searching and hierarchical/facet browsing. The advantages of using a classification for IR, however, depend on the strength of the GUI, which should provide a user-friendly interface to classification browsing and searching. The power of this interface is in supporting visualisation that will 'convert' what is potentially a user-unfriendly indexing language based on symbols, to a subject presentation that is easy to understand, search and navigate. A summary of the basic functions of searching and browsing a classification that may be provided on a user-friendly interface is given and examples of classification browsing interfaces are provided.
  17. Fast, K.; Leise, F.; Steckel, M.: What is a controlled vocabulary? (2002) 0.00 
    0.0021795689 = product of:
  0.010897844 = sum of:
    0.010897844 = weight(_text_:a in 2417) [ClassicSimilarity], result of:
      0.010897844 = score(doc=2417,freq=8.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.20383182 = fieldWeight in 2417, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=2417)
  0.2 = coord(1/5)
    Abstract
    An online series of articles explaining controlled vocabularies and, in particular, faceted classification. It is not yet finished, but what they have covered is very well done, practical and informative, with useful advice and a full treatment. It is worth reading now, and when they actually get to performing facet analysis and making a faceted system, it will make a very useful reference.
  18. Fast, K.; Leise, F.; Steckel, M.: Creating a controlled vocabulary (2003) 0.00 
    0.0021795689 = product of:
  0.010897844 = sum of:
    0.010897844 = weight(_text_:a in 2461) [ClassicSimilarity], result of:
      0.010897844 = score(doc=2461,freq=8.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.20383182 = fieldWeight in 2461, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=2461)
  0.2 = coord(1/5)
    Abstract
    An online series of articles explaining controlled vocabularies and, in particular, faceted classification. It is not yet finished, but what they have covered is very well done, practical and informative, with useful advice and a full treatment. It is worth reading now, and when they actually get to performing facet analysis and making a faceted system, it will make a very useful reference.
  19. Fast, K.; Leise, F.; Steckel, M.: Controlled vocabularies : a glosso-thesaurus (2003) 0.00 
    0.0021795689 = product of:
  0.010897844 = sum of:
    0.010897844 = weight(_text_:a in 2469) [ClassicSimilarity], result of:
      0.010897844 = score(doc=2469,freq=8.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.20383182 = fieldWeight in 2469, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=2469)
  0.2 = coord(1/5)
    Abstract
    An online series of articles explaining controlled vocabularies and, in particular, faceted classification. It is not yet finished, but what they have covered is very well done, practical and informative, with useful advice and a full treatment. It is worth reading now, and when they actually get to performing facet analysis and making a faceted system, it will make a very useful reference.
  20. Quick Guide to Publishing a Classification Scheme on the Semantic Web (2008) 0.00 
    0.0019071229 = product of:
  0.009535614 = sum of:
    0.009535614 = weight(_text_:a in 3061) [ClassicSimilarity], result of:
      0.009535614 = score(doc=3061,freq=8.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.17835285 = fieldWeight in 3061, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3061)
  0.2 = coord(1/5)
    Abstract
    This document describes in brief how to express the content and structure of a classification scheme, and metadata about a classification scheme, in RDF using the SKOS vocabulary. RDF allows data to be linked to and/or merged with other RDF data by semantic web applications. The Semantic Web, which is based on the Resource Description Framework (RDF), provides a common framework that allows data to be shared and reused across application, enterprise, and community boundaries. Publishing classifications schemes in SKOS will unify the great many of existing classification efforts in the framework of the Semantic Web.

Authors

Years

Languages

  • e 25
  • d 5
  • es 1
  • More… Less…

Types

Themes