Search (43 results, page 1 of 3)

  • × theme_ss:"Klassifikationssysteme im Online-Retrieval"
  1. Kwasnik, B.H.: ¬The role of classification in knowledge representation (1999) 0.01
    0.012589371 = product of:
      0.050357483 = sum of:
        0.034606863 = weight(_text_:work in 2464) [ClassicSimilarity], result of:
          0.034606863 = score(doc=2464,freq=2.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.2433148 = fieldWeight in 2464, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.046875 = fieldNorm(doc=2464)
        0.015750622 = product of:
          0.031501245 = sum of:
            0.031501245 = weight(_text_:22 in 2464) [ClassicSimilarity], result of:
              0.031501245 = score(doc=2464,freq=2.0), product of:
                0.13569894 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03875087 = queryNorm
                0.23214069 = fieldWeight in 2464, 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=2464)
          0.5 = coord(1/2)
      0.25 = coord(2/8)
    
    Abstract
    A fascinating, broad-ranging article about classification, knowledge, and how they relate. Hierarchies, trees, paradigms (a two-dimensional classification that can look something like a spreadsheet), and facets are covered, with descriptions of how they work and how they can be used for knowledge discovery and creation. Kwasnick outlines how to make a faceted classification: choose facets, develop facets, analyze entities using the facets, and make a citation order. Facets are useful for many reasons: they do not require complete knowledge of the entire body of material; they are hospitable, flexible, and expressive; they do not require a rigid background theory; they can mix theoretical structures and models; and they allow users to view things from many perspectives. Facets do have faults: it can be hard to pick the right ones; it is hard to show relations between them; and it is difficult to visualize them. The coverage of the other methods is equally thorough and there is much to consider for anyone putting a classification on the web.
    Source
    Library trends. 48(1999) no.1, S.22-47
  2. Slavic, A.: Interface to classification : some objectives and options (2006) 0.01
    0.011262473 = product of:
      0.09009978 = sum of:
        0.09009978 = weight(_text_:supported in 2131) [ClassicSimilarity], result of:
          0.09009978 = score(doc=2131,freq=2.0), product of:
            0.22949564 = queryWeight, product of:
              5.9223356 = idf(docFreq=321, maxDocs=44218)
              0.03875087 = queryNorm
            0.3925991 = fieldWeight in 2131, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.9223356 = idf(docFreq=321, maxDocs=44218)
              0.046875 = fieldNorm(doc=2131)
      0.125 = coord(1/8)
    
    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.
  3. Olson, H.A.; Boll, J.J.: Subject analysis in online catalogs (2001) 0.01
    0.007137301 = product of:
      0.057098407 = sum of:
        0.057098407 = weight(_text_:work in 6113) [ClassicSimilarity], result of:
          0.057098407 = score(doc=6113,freq=4.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.40144894 = fieldWeight in 6113, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6113)
      0.125 = coord(1/8)
    
    Footnote
    Rez. in: Knowledge organization 28(2001) no.4, S.206-208 (C. Arsenault):"Overall, this is an excellent work, on an ever increasingly pertinent topic. This long-awaited second edition provides a thorough and comprehensive update of an already important text. I very highly recommend it to professionals and academics alike ; both neophytes and veterans will find it valuable. It is a fundamental work that cannot be ignored in the field of subject analysis and retrieval for all bibliographic systems, including online catalogs."
  4. ¬The UDC : Essays for a new decade (1990) 0.01
    0.007137301 = product of:
      0.057098407 = sum of:
        0.057098407 = weight(_text_:work in 661) [ClassicSimilarity], result of:
          0.057098407 = score(doc=661,freq=4.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.40144894 = fieldWeight in 661, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0546875 = fieldNorm(doc=661)
      0.125 = coord(1/8)
    
    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
  5. Ellis, D.; Vasconcelos, A.: ¬The relevance of facet analysis for World Wide Web subject organization and searching (2000) 0.01
    0.0061176866 = product of:
      0.048941493 = sum of:
        0.048941493 = weight(_text_:work in 2477) [ClassicSimilarity], result of:
          0.048941493 = score(doc=2477,freq=4.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.3440991 = fieldWeight in 2477, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.046875 = fieldNorm(doc=2477)
      0.125 = coord(1/8)
    
    Abstract
    Different forms of indexing and search facilities available on the Web are described. Use of facet analysis to structure hypertext concept structures is outlined in relation to work on (1) development of hypertext knowledge bases for designers of learning materials and (2) construction of knowledge based hypertext interfaces. The problem of lack of closeness between page designers and potential users is examined. Facet analysis is suggested as a way of alleviating some difficulties associated with this problem of designing for the unknown user.
    This is a revised version of the earlier article by Ellis and Vasconcelos (1999) (see Not Relevant, below), though that is not indicated, and much of it is identical, word for word. There is a new section covering the work of Elizabeth Duncan, which is useful and informative, but the reader is better advised to go to the originals if available.
  6. Spiteri, L.: ¬A simplified model for facet analysis : Ranganathan 101 (1998) 0.01
    0.0061176866 = product of:
      0.048941493 = sum of:
        0.048941493 = weight(_text_:work in 3842) [ClassicSimilarity], result of:
          0.048941493 = score(doc=3842,freq=4.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.3440991 = fieldWeight in 3842, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.046875 = fieldNorm(doc=3842)
      0.125 = coord(1/8)
    
    Abstract
    Ranganathan's canons, principles, and postulates can easily confuse readers, especially because he revised and added to them in various editions of his many books. The Classification Research Group, who drew on Ranganathan's work as their basis for classification theory but developed it in their own way, has never clearly organized all their equivalent canons and principles. In this article Spiteri gathers the fundamental rules from both systems and compares and contrasts them. She makes her own clearer set of principles for constructing facets, stating the subject of a document, and designing notation. Spiteri's "simplified model" is clear and understandable, but certainly not simplistic. The model does not include methods for making a faceted system, but will serve as a very useful guide in how to turn initial work into a rigorous classification. Highly recommended
  7. Hill, J.S.: Online classification number access : some practical considerations (1984) 0.01
    0.005250208 = product of:
      0.042001665 = sum of:
        0.042001665 = product of:
          0.08400333 = sum of:
            0.08400333 = weight(_text_:22 in 7684) [ClassicSimilarity], result of:
              0.08400333 = score(doc=7684,freq=2.0), product of:
                0.13569894 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03875087 = queryNorm
                0.61904186 = fieldWeight in 7684, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.125 = fieldNorm(doc=7684)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Source
    Journal of academic librarianship. 10(1984), S.17-22
  8. Tudhope, D.; Binding, C.; Blocks, D.; Cuncliffe, D.: Representation and retrieval in faceted systems (2003) 0.01
    0.005098072 = product of:
      0.040784575 = sum of:
        0.040784575 = weight(_text_:work in 2703) [ClassicSimilarity], result of:
          0.040784575 = score(doc=2703,freq=4.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.28674924 = fieldWeight in 2703, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2703)
      0.125 = coord(1/8)
    
    Abstract
    This paper discusses two inter-related themes: the retrieval potential of faceted thesauri and XML representations of fundamental facets. Initial findings are discussed from the ongoing 'FACET' project, in collaboration with the National Museum of Science and Industry. The work discussed seeks to take advantage of the structure afforded by faceted systems for multi-term queries and flexible matching, focusing in this paper an the Art and Architecture Thesaurus. A multi-term matching function yields ranked results with partial matches via semantic term expansion, based an a measure of distance over the semantic index space formed by thesaurus relationships. Our intention is to drive the system from general representations and a common query structure and interface. To this end, we are developing an XML representation based an work by the Classification Research Group an fundamental facets or categories. The XML representation maps categories to particular thesauri and hierarchies. The system interface, which is configured by the mapping, incorporates a thesaurus browser with navigation history together with a term search facility and drag and drop query builder.
  9. LaBarre, K.; Cochrane, P.A.: Facet analysis as a knowledge management tool on the Internet (2006) 0.01
    0.005098072 = product of:
      0.040784575 = sum of:
        0.040784575 = weight(_text_:work in 1489) [ClassicSimilarity], result of:
          0.040784575 = score(doc=1489,freq=4.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.28674924 = fieldWeight in 1489, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1489)
      0.125 = coord(1/8)
    
    Abstract
    In 2001, a group of information architects involved in designing websites, and knowledge management specialists involved in creating access to corporate knowledge bases appeared to have re-discovered facet analysis and faceted classification. These groups have been instrumental in creating new and different ways of handling digital content of the Internet. Some of these practitioners explicitly use the forms and language of facet analysis and faceted classification, while others seem to do so implicitly. Following a brief overview of the work and discussions on facets and faceted classification in recent years, we focus on our observations about new information resources which seem more in line with the Fourth law of Library Science ("Save the time of the reader") than most library OPACs today. These new developments on the Internet point to a partial grasp of a disciplined approach to subject access. This is where Ranganathan and Neelameghan's approach needs to be reviewed for the new audience of information system designers. A report on the work undertaken by us forms a principal part of this paper.
  10. Fujita, M.; Lopes, L.; Moreira, W.; Piovezan dos Santos, L.B.; Andrade e Cruz, M.C.; Rodrigues de Barros Ribas, R.: Construction and evaluation of hierarchical structures of indexing languages for online catalogs of libraries : an experience of the São Paulo State University (UNESP) (2018) 0.01
    0.005098072 = product of:
      0.040784575 = sum of:
        0.040784575 = weight(_text_:work in 4307) [ClassicSimilarity], result of:
          0.040784575 = score(doc=4307,freq=4.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.28674924 = fieldWeight in 4307, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4307)
      0.125 = coord(1/8)
    
    Abstract
    The construction and updating of indexing languages depend on the organization of their hierarchical structures in order to determine the classification of related terms and, above all, to allow a constant updating of vocabulary, a condition for knowledge evolution. The elaboration of an indexing language for online catalogs of libraries' networks is important considering the diversity and specificity of knowledge areas. From this perspective, the present paper reports on the work of a team of catalogers and researchers engaged in the construction of a hierarchical structure of an indexing language for an online catalog of a university library's network. The work on hierarchical structures began by defining the categories and subcategories that form the indexing language macrostructure by using the parameters of the Library of Congress Subject Headings , the National Library Terminology and the Vocabulary of the University of São Paulo Library's system. Throughout the stages of the elaboration process of the macrostructure, difficulties and improvements were observed and discussed. The results enabled the assessment of the hierarchical structures of the languages used in the organization of the superordinate and subordinate terms, which has contributed to the systematization of operational procedures contained in an indexing language manual for online catalogs of libraries.
  11. Lima, G.A. de; Castro, I.R.: Uso da classificacao decimal universal para a recuperacao da informacao em ambientes digitas : uma revisao sistematica da literatura (2021) 0.01
    0.005098072 = product of:
      0.040784575 = sum of:
        0.040784575 = weight(_text_:work in 760) [ClassicSimilarity], result of:
          0.040784575 = score(doc=760,freq=4.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.28674924 = fieldWeight in 760, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=760)
      0.125 = coord(1/8)
    
    Abstract
    Knowledge Organization Systems, even traditional ones, such as the Universal Decimal Classification, have been studied to improve the retrieval of information online, although the potential of using knowledge structures in the user interface has not yet been widespread. Objective: This study presents a mapping of scientific production on information retrieval methodologies, which make use of the Universal Decimal Classification. Methodology: Systematic Literature Review, conducted in two stages, with a selection of 44 publications, resulting in the time interval from 1964 to 2017, whose categories analyzed were: most productive authors, languages of publications, types of document, year of publication, most cited work, major impact journal, and thematic categories covered in the publications. Results: A total of nine more productive authors and co-authors were found; predominance of the English language (42 publications); works published in the format of journal articles (33); and highlight to the year 2007 (eight publications). In addition, it was identified that the most cited work was by Mcilwaine (1997), with 61 citations, and the journal Extensions & Corrections to the UDC was the one with the largest number of publications, in addition to the incidence of the theme Universal Automation linked to a thesaurus for information retrieval, present in 19 works. Conclusions: Shortage of studies that explore the potential of the Decimal Classification, especially in Brazilian literature, which highlights the need for further study on the topic, involving research at the national and international levels.
  12. Chan, L.M.; Childress, E.; Dean, R.; O'Neill, E.T.; Vizine-Goetz, D.: ¬A faceted approach to subject data in the Dublin Core metadata record (2001) 0.01
    0.005046834 = product of:
      0.04037467 = sum of:
        0.04037467 = weight(_text_:work in 6109) [ClassicSimilarity], result of:
          0.04037467 = score(doc=6109,freq=2.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.28386727 = fieldWeight in 6109, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6109)
      0.125 = coord(1/8)
    
    Abstract
    This article describes FAST, the Faceted Application of Subject Terminology, a project at OCLC to make Library of Congress Subject Headings easier to use in Dublin Core metadata by breaking out facets of space, time, and form. Work on FAST can be watched at its web site, http://www.miskatonic.org/library/, which has recent presentations and reports. It is interesting to see facets and Dublin Core combined, though both LCSH and FAST subject headings are beyond what most people making a small faceted classification would want or need.
  13. Hajdu Barát, A.: Usability and the user interfaces of classical information retrieval languages (2006) 0.01
    0.005046834 = product of:
      0.04037467 = sum of:
        0.04037467 = weight(_text_:work in 232) [ClassicSimilarity], result of:
          0.04037467 = score(doc=232,freq=2.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.28386727 = fieldWeight in 232, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0546875 = fieldNorm(doc=232)
      0.125 = coord(1/8)
    
    Abstract
    This paper examines some traditional information searching methods and their role in Hungarian OPACs. What challenges are there in the digital and online environment? How do users work with them and do they give users satisfactory results? What kinds of techniques are users employing? In this paper I examine the user interfaces of UDC, thesauri, subject headings etc. in the Hungarian library. The key question of the paper is whether a universal system or local solutions is the best approach for searching in the digital environment.
  14. Denton, W.: Putting facets on the Web : an annotated bibliography (2003) 0.00
    0.00476881 = product of:
      0.03815048 = sum of:
        0.03815048 = weight(_text_:work in 2467) [ClassicSimilarity], result of:
          0.03815048 = score(doc=2467,freq=14.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.26822937 = fieldWeight in 2467, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.01953125 = fieldNorm(doc=2467)
      0.125 = coord(1/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.
    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.
  15. Louie, A.J.; Maddox, E.L.; Washington, W.: Using faceted classification to provide structure for information architecture (2003) 0.00
    0.004325858 = product of:
      0.034606863 = sum of:
        0.034606863 = weight(_text_:work in 2471) [ClassicSimilarity], result of:
          0.034606863 = score(doc=2471,freq=2.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.2433148 = fieldWeight in 2471, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.046875 = fieldNorm(doc=2471)
      0.125 = coord(1/8)
    
    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.
  16. Pika, J.: Universal Decimal Classification at the ETH-Bibliothek Zürich : a Swiss perspective (2007) 0.00
    0.004325858 = product of:
      0.034606863 = sum of:
        0.034606863 = weight(_text_:work in 5899) [ClassicSimilarity], result of:
          0.034606863 = score(doc=5899,freq=2.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.2433148 = fieldWeight in 5899, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.046875 = fieldNorm(doc=5899)
      0.125 = coord(1/8)
    
    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.
  17. Lim, E.: Southeast Asian subject gateways : an examination of their classification practices (2000) 0.00
    0.0039376556 = product of:
      0.031501245 = sum of:
        0.031501245 = product of:
          0.06300249 = sum of:
            0.06300249 = weight(_text_:22 in 6040) [ClassicSimilarity], result of:
              0.06300249 = score(doc=6040,freq=2.0), product of:
                0.13569894 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03875087 = queryNorm
                0.46428138 = fieldWeight in 6040, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.09375 = fieldNorm(doc=6040)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Date
    22. 6.2002 19:42:47
  18. Liu, S.: Decomposing DDC synthesized numbers (1996) 0.00
    0.0036048815 = product of:
      0.028839052 = sum of:
        0.028839052 = weight(_text_:work in 5969) [ClassicSimilarity], result of:
          0.028839052 = score(doc=5969,freq=2.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.20276234 = fieldWeight in 5969, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5969)
      0.125 = coord(1/8)
    
    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.
  19. LaBarre, K.: ¬A multi faceted view : use of facet analysis in the practice of website organization and access (2006) 0.00
    0.0036048815 = product of:
      0.028839052 = sum of:
        0.028839052 = weight(_text_:work in 257) [ClassicSimilarity], result of:
          0.028839052 = score(doc=257,freq=2.0), product of:
            0.14223081 = queryWeight, product of:
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.03875087 = queryNorm
            0.20276234 = fieldWeight in 257, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6703904 = idf(docFreq=3060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=257)
      0.125 = coord(1/8)
    
    Abstract
    In 2001, information architects and knowledge management specialists charged with designing websites and access to corporate knowledge bases seemingly re-discovered a legacy form of information organization and access: faceted analytico-synthetic theory (FAST). Instrumental in creating new and different ways for people to engage with the digital content of the Web, the members of this group have clearly recognized that faceted approaches have the potential to improve access to information on the web. Some of these practitioners explicitly use the forms and language of FAST, while others seem to mimic the forms implicitly (Adkisson, 2003). The focus of this ongoing research study is two-fold. First, access and organizational structures in a stratified random sample of 200 DMOZ websites were examined for evidence of the use of FAST. Second, in the context of unstructured interviews, the understanding and use of FAST among a group of eighteen practitioners is uncovered. This is a preliminary report of the website component capture and interview phases of this research study. Future work will involve formalizing a set of feature guidelines drawn from the initial phases of this research study. Preliminary observations will be drawn from the first phase of this study.
  20. Comaromi, C.L.: Summation of classification as an enhancement of intellectual access to information in an online environment (1990) 0.00
    0.00328138 = product of:
      0.02625104 = sum of:
        0.02625104 = product of:
          0.05250208 = sum of:
            0.05250208 = weight(_text_:22 in 3576) [ClassicSimilarity], result of:
              0.05250208 = score(doc=3576,freq=2.0), product of:
                0.13569894 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03875087 = queryNorm
                0.38690117 = fieldWeight in 3576, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.078125 = fieldNorm(doc=3576)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Date
    8. 1.2007 12:22:40

Years

Languages

  • e 36
  • d 6
  • pt 1
  • More… Less…

Types

  • a 32
  • el 10
  • m 3
  • s 2
  • p 1
  • More… Less…

Classifications