Search (8 results, page 1 of 1)

0.07979104 = product of:
  0.2393731 = sum of:
    0.2393731 = sum of:
      0.19898356 = weight(_text_:indexing in 3197) [ClassicSimilarity], result of:
        0.19898356 = score(doc=3197,freq=34.0), product of:
          0.19018644 = queryWeight, product of:
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.049684696 = queryNorm
          1.0462552 = fieldWeight in 3197, product of:
            5.8309517 = tf(freq=34.0), with freq of:
              34.0 = termFreq=34.0
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.046875 = fieldNorm(doc=3197)
      0.04038954 = weight(_text_:22 in 3197) [ClassicSimilarity], result of:
        0.04038954 = score(doc=3197,freq=2.0), product of:
          0.17398734 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049684696 = queryNorm
          0.23214069 = fieldWeight in 3197, 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=3197)
  0.33333334 = coord(1/3)

Abstract

Indexing consists of both novel and more traditional techniques. Cutting-edge indexing techniques, such as automatic indexing, ontologies, and topic maps, were developed independently of older techniques such as thesauri, but it is now recognized that these older methods also hold expertise. Indexing describes various traditional and novel indexing techniques, giving information professionals and students of library and information sciences a broad and comprehensible introduction to indexing. This title consists of twelve chapters: an Introduction to subject readings and theasauri; Automatic indexing versus manual indexing; Techniques applied in automatic indexing of text material; Automatic indexing of images; The black art of indexing moving images; Automatic indexing of music; Taxonomies and ontologies; Metadata formats and indexing; Tagging; Topic maps; Indexing the web; and The Semantic Web.

Date

24. 8.2016 14:03:22

LCSH

Indexing

Subject

Indexing

0.02275027 = product of:
  0.068250805 = sum of:
    0.068250805 = product of:
      0.13650161 = sum of:
        0.13650161 = weight(_text_:indexing in 549) [ClassicSimilarity], result of:
          0.13650161 = score(doc=549,freq=4.0), product of:
            0.19018644 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.049684696 = queryNorm
            0.7177252 = fieldWeight in 549, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.09375 = fieldNorm(doc=549)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

LCSH

Indexing

Subject

Indexing

0.018958557 = product of:
  0.05687567 = sum of:
    0.05687567 = product of:
      0.11375134 = sum of:
        0.11375134 = weight(_text_:indexing in 6869) [ClassicSimilarity], result of:
          0.11375134 = score(doc=6869,freq=4.0), product of:
            0.19018644 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.049684696 = queryNorm
            0.59810436 = fieldWeight in 6869, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.078125 = fieldNorm(doc=6869)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

PRECIS

Documents / Subject indexing / Thesauri / Construction

Subject

Documents / Subject indexing / Thesauri / Construction

0.011954757 = product of:
  0.03586427 = sum of:
    0.03586427 = weight(_text_:systematic in 2924) [ClassicSimilarity], result of:
      0.03586427 = score(doc=2924,freq=2.0), product of:
        0.28397155 = queryWeight, product of:
          5.715473 = idf(docFreq=395, maxDocs=44218)
          0.049684696 = queryNorm
        0.1262953 = fieldWeight in 2924, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.715473 = idf(docFreq=395, maxDocs=44218)
          0.015625 = fieldNorm(doc=2924)
  0.33333334 = coord(1/3)

Abstract

Many information professionals working in small units today fail to find the published tools for subject-based organization that are appropriate to their local needs, whether they are archivists, special librarians, information officers, or knowledge or content managers. Large established standards for document description and organization are too unwieldy, unnecessarily detailed, or too expensive to install and maintain. In other cases the available systems are insufficient for a specialist environment, or don't bring things together in a helpful way. A purpose built, in-house system would seem to be the answer, but too often the skills necessary to create one are lacking. This practical text examines the criteria relevant to the selection of a subject-management system, describes the characteristics of some common types of subject tool, and takes the novice step by step through the process of creating a system for a specialist environment. The methodology employed is a standard technique for the building of a thesaurus that incidentally creates a compatible classification or taxonomy, both of which may be used in a variety of ways for document or information management. Key areas covered are: What is a thesaurus? Tools for subject access and retrieval; what a thesaurus is used for? Why use a thesaurus? Examples of thesauri; the structure of a thesaurus; thesaural relationships; practical thesaurus construction; the vocabulary of the thesaurus; building the systematic structure; conversion to alphabetic format; forms of entry in the thesaurus; maintaining the thesaurus; thesaurus software; and; the wider environment. Essential for the practising information professional, this guide is also valuable for students of library and information science.

0.01072458 = product of:
  0.032173738 = sum of:
    0.032173738 = product of:
      0.064347476 = sum of:
        0.064347476 = weight(_text_:indexing in 5625) [ClassicSimilarity], result of:
          0.064347476 = score(doc=5625,freq=2.0), product of:
            0.19018644 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.049684696 = queryNorm
            0.3383389 = fieldWeight in 5625, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0625 = fieldNorm(doc=5625)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Describes a deductive data model based on 3 abstraction levels for representing vocabularies for information retrieval: conceptual level; expression level; and occurrence level. The proposed data model can be used for the representation and navigation of indexing and retrieval thesauri and as a vocabulary source for concept based query expansion in heterogeneous retrieval environments

0.01072458 = product of:
  0.032173738 = sum of:
    0.032173738 = product of:
      0.064347476 = sum of:
        0.064347476 = weight(_text_:indexing in 2915) [ClassicSimilarity], result of:
          0.064347476 = score(doc=2915,freq=8.0), product of:
            0.19018644 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.049684696 = queryNorm
            0.3383389 = fieldWeight in 2915, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.03125 = fieldNorm(doc=2915)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

"Clearly details the conceptual and practical notions of controlled vocabularies. . provides a crash course for newcomers and offers experienced practitioners a common frame of reference. A valuable book." - Christine Connors, TriviumRLG LLC The Accidental Taxonomist is the most comprehensive guide available to the art and science of building information taxonomies. Heather Hedden-one of today's leading writers, instructors, and consultants on indexing and taxonomy topics-walks readers through the process, displaying her trademark ability to present highly technical information in straightforward, comprehensible English. Drawing on numerous real-world examples, Hedden explains how to create terms and relationships, select taxonomy management software, design taxonomies for human versus automated indexing, manage enterprise taxonomy projects, and adapt taxonomies to various user interfaces. The result is a practical and essential guide for information professionals who need to effectively create or manage taxonomies, controlled vocabularies, and thesauri. "A wealth of descriptive reference content is balanced with expert guidance. . Open The Accidental Taxonomist to begin the learning process or to refresh your understanding of the depth and breadth of this demanding discipline." - Lynda Moulton, Principal Consultant, LWM Technology Services "From the novice taxonomist to the experienced professional, all will find helpful, practical advice in The Accidental Taxonomist." - Trish Yancey, TCOO, Synaptica, LLC "This book squarely addresses the growing demand for and interest in taxonomy. ...Hedden brings a variety of background experience, including not only taxonomy construction but also abstracting and content categorization and creating back-of-the-book indexes. These experiences serve her well by building a broad perspective on the similarities as well as real differences between often overlapping types of work." - Marjorie M. K. Hlava, President and Chairman, Access Innovations, Inc., and Chair, SLA Taxonomy Division

LCSH

Indexing

Subject

Indexing

0.0044877273 = product of:
  0.013463181 = sum of:
    0.013463181 = product of:
      0.026926363 = sum of:
        0.026926363 = weight(_text_:22 in 3487) [ClassicSimilarity], result of:
          0.026926363 = score(doc=3487,freq=2.0), product of:
            0.17398734 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049684696 = queryNorm
            0.15476047 = fieldWeight in 3487, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=3487)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Series

Materialien zur Information und Dokumentation; Bd.22

0.0040217172 = product of:
  0.012065152 = sum of:
    0.012065152 = product of:
      0.024130303 = sum of:
        0.024130303 = weight(_text_:indexing in 3243) [ClassicSimilarity], result of:
          0.024130303 = score(doc=3243,freq=2.0), product of:
            0.19018644 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.049684696 = queryNorm
            0.1268771 = fieldWeight in 3243, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0234375 = fieldNorm(doc=3243)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Content

Enthält u.a. folgende Aussage von J. Aitchison u. S. Dextre Clarke: "We face a paradox. Ostensibly, the need and the opportunity to apply thesauri to information retrieval are greater than ever before. On the other hand, users resist most efforts to persuade them to apply one. The drive for interoperability of systems means we must design our vocabularies for easy integration into downstream applications such as content management systems, indexing/metatagging interfaces, search engines, and portals. Summarizing the search for vocabularies that work more intuitively, we see that there are trends working in opposite directions. In the hugely popular taxonomies an the one hand, relationships between terms are more loosely defined than in thesauri. In the ontologies that will support computer-to-computer communications in AI applications such as the Semantic Web, we see the need for much more precisely defined term relationships."