Search (16 results, page 1 of 1)

0.027498204 = product of:
  0.05499641 = sum of:
    0.021487473 = weight(_text_:science in 7460) [ClassicSimilarity], result of:
      0.021487473 = score(doc=7460,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.17461908 = fieldWeight in 7460, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=7460)
    0.033508934 = product of:
      0.06701787 = sum of:
        0.06701787 = weight(_text_:history in 7460) [ClassicSimilarity], result of:
          0.06701787 = score(doc=7460,freq=2.0), product of:
            0.21731828 = queryWeight, product of:
              4.6519823 = idf(docFreq=1146, maxDocs=44218)
              0.0467152 = queryNorm
            0.3083858 = fieldWeight in 7460, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.6519823 = idf(docFreq=1146, maxDocs=44218)
              0.046875 = fieldNorm(doc=7460)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

Describes an integrated approach to similarity coefficients for information spaces with multiple dimensions of different types of index term. Categorises applications of similarity coefficients underlying different navigation tools in hypermedia by type of term. Describes an implementation of a unified similarity coefficient based on work in numerical taxonomy, with illustrative scenarios from an experimental navigation via similarity tool for a prototype social history museum hypermedia system. The underlying architecture is based on a semantic approach, where semantic relationships can exist between index terms. This allows imprecise matching when comparing for similarity, with distance measures yielding a degree of match. A ranked list of matching items over several weighted dimensions is returned by the similarity navigation tool. The approach has the potential of allowing different access methods to multimedia data to be combined

Source

Global complexity: information, chaos and control. Proceedings of the 59th Annual Meeting of the American Society for Information Science, ASIS'96, Baltimore, Maryland, 21-24 Oct 1996. Ed.: S. Hardin

0.02291517 = product of:
  0.04583034 = sum of:
    0.017906228 = weight(_text_:science in 2703) [ClassicSimilarity], result of:
      0.017906228 = score(doc=2703,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.1455159 = fieldWeight in 2703, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2703)
    0.027924111 = product of:
      0.055848222 = sum of:
        0.055848222 = weight(_text_:history in 2703) [ClassicSimilarity], result of:
          0.055848222 = score(doc=2703,freq=2.0), product of:
            0.21731828 = queryWeight, product of:
              4.6519823 = idf(docFreq=1146, maxDocs=44218)
              0.0467152 = queryNorm
            0.25698814 = fieldWeight in 2703, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.6519823 = idf(docFreq=1146, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2703)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

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.

0.020237632 = product of:
  0.040475264 = sum of:
    0.021487473 = weight(_text_:science in 1347) [ClassicSimilarity], result of:
      0.021487473 = score(doc=1347,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.17461908 = fieldWeight in 1347, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=1347)
    0.018987793 = product of:
      0.037975587 = sum of:
        0.037975587 = weight(_text_:22 in 1347) [ClassicSimilarity], result of:
          0.037975587 = score(doc=1347,freq=2.0), product of:
            0.16358867 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0467152 = queryNorm
            0.23214069 = fieldWeight in 1347, 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=1347)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Date

22. 8.2014 17:12:54

Source

Journal of the Association for Information Science and Technology. 65(2014) no.9, S.1901-1916

0.009773439 = product of:
  0.039093755 = sum of:
    0.039093755 = product of:
      0.07818751 = sum of:
        0.07818751 = weight(_text_:history in 2801) [ClassicSimilarity], result of:
          0.07818751 = score(doc=2801,freq=2.0), product of:
            0.21731828 = queryWeight, product of:
              4.6519823 = idf(docFreq=1146, maxDocs=44218)
              0.0467152 = queryNorm
            0.3597834 = fieldWeight in 2801, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.6519823 = idf(docFreq=1146, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2801)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Reviews claims made for virtual architectures and proposes a semantic data model for hypermedia architecture. Semantic modelling and an extended binary relational model in particular, are outlined in the context of hypermedia. The binary relational store is a simple, uniform data structure, capable of representing abstraction in the application model. Pilot implementations of museum hypermedia systems demonstrate that the architecture is capable of supporting a variety of navigation techniques and authoring tools. Outlines the SHIC (Social History and Industrial Classification) museum classification schema, and discusses its implementation in a hypermedia system based on a binary relational store. Considers experiences with the prototypes and discusses feedback from the museum profession and general public. An extended binary relational model is particularly suited to certain forms of reasoning based on generalization

0.009493897 = product of:
  0.037975587 = sum of:
    0.037975587 = product of:
      0.075951174 = sum of:
        0.075951174 = weight(_text_:22 in 100) [ClassicSimilarity], result of:
          0.075951174 = score(doc=100,freq=2.0), product of:
            0.16358867 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0467152 = queryNorm
            0.46428138 = fieldWeight in 100, 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=100)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

22. 9.2007 15:41:14

0.0083772335 = product of:
  0.033508934 = sum of:
    0.033508934 = product of:
      0.06701787 = sum of:
        0.06701787 = weight(_text_:history in 155) [ClassicSimilarity], result of:
          0.06701787 = score(doc=155,freq=2.0), product of:
            0.21731828 = queryWeight, product of:
              4.6519823 = idf(docFreq=1146, maxDocs=44218)
              0.0467152 = queryNorm
            0.3083858 = fieldWeight in 155, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.6519823 = idf(docFreq=1146, maxDocs=44218)
              0.046875 = fieldNorm(doc=155)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Describes a research project, in which similarity measures have been extended to include imprecise matching over different dimensions of structured classification schemes (subject, soace, time). The semantic similarity of information units forms the basis for the automatic construction of links and is integrated into hypermedia navigation. Outlines a semantic hypermedia architecture, and a prototype museum social history application. Presents illustrative navigation scenarios which make use of a navigation via similarity tool. The temporal mesaures of semantic closeness underpin the similarity tool. The temporal measures takes account of periods as well as time points. The most general measure is based on a traversal of a semantic net, taking into account relationship type and level of specialisation. It is based on a notion of closeness rather than absolute distance, and returns a seit of semantically close terms. Discusses a methods of calculating semantic similarity between sets of index terms, based on the maximal closeness values achieved by each term

0.007911582 = product of:
  0.031646326 = sum of:
    0.031646326 = product of:
      0.06329265 = sum of:
        0.06329265 = weight(_text_:22 in 539) [ClassicSimilarity], result of:
          0.06329265 = score(doc=539,freq=2.0), product of:
            0.16358867 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0467152 = queryNorm
            0.38690117 = fieldWeight in 539, 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=539)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

26.12.2011 13:22:07

0.0063308077 = product of:
  0.02532323 = sum of:
    0.02532323 = weight(_text_:science in 3311) [ClassicSimilarity], result of:
      0.02532323 = score(doc=3311,freq=4.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.20579056 = fieldWeight in 3311, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3311)
  0.25 = coord(1/4)

Series

Advances in information science

Source

Journal of the Association for Information Science and Technology. 67(2016) no.1, S.3-16

0.005371868 = product of:
  0.021487473 = sum of:
    0.021487473 = weight(_text_:science in 202) [ClassicSimilarity], result of:
      0.021487473 = score(doc=202,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.17461908 = fieldWeight in 202, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=202)
  0.25 = coord(1/4)

Source

Journal of the American Society for Information Science and Technology. 57(2006) no.12, S.1655-1665

0.005371868 = product of:
  0.021487473 = sum of:
    0.021487473 = weight(_text_:science in 4067) [ClassicSimilarity], result of:
      0.021487473 = score(doc=4067,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.17461908 = fieldWeight in 4067, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=4067)
  0.25 = coord(1/4)

Abstract

Controlled terminologies such as classification schemes, name authorities, and thesauri have long been the domain of the library and information science community. Although historically there have been initiatives towards library style classification of web resources, there remain significant problems with searching and quality judgement of online content. Terminology services can play a key role in opening up access to these valuable resources. By exposing controlled terminologies via a web service, organisations maintain data integrity and version control, whilst motivating external users to design innovative ways to present and utilise their data. We introduce terminology web services and review work in the area. We describe the approaches taken in establishing application programming interfaces (API) and discuss the comparative benefits of a dedicated terminology web service versus general purpose programming languages. We discuss experiences at Glamorgan in creating terminology web services and associated client interface components, in particular for the archaeology domain in the STAR (Semantic Technologies for Archaeological Resources) Project.

0.004476557 = product of:
  0.017906228 = sum of:
    0.017906228 = weight(_text_:science in 2215) [ClassicSimilarity], result of:
      0.017906228 = score(doc=2215,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.1455159 = fieldWeight in 2215, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2215)
  0.25 = coord(1/4)

Abstract

Purpose - The purpose of this paper is to explore query expansion via conceptual distance in thesaurus indexed collections Design/methodology/approach - An extract of the National Museum of Science and Industry's collections database, indexed with the Getty Art and Architecture Thesaurus (AAT), was the dataset for the research. The system architecture and algorithms for semantic closeness and the matching function are outlined. Standalone and web interfaces are described and formative qualitative user studies are discussed. One user session is discussed in detail, together with a scenario based on a related public inquiry. Findings are set in context of the literature on thesaurus-based query expansion. This paper discusses the potential of query expansion techniques using the semantic relationships in a faceted thesaurus. Findings - Thesaurus-assisted retrieval systems have potential for multi-concept descriptors, permitting very precise queries and indexing. However, indexer and searcher may differ in terminology judgments and there may not be any exactly matching results. The integration of semantic closeness in the matching function permits ranked results for multi-concept queries in thesaurus-indexed applications. An in-memory representation of the thesaurus semantic network allows a combination of automatic and interactive control of expansion and control of expansion on individual query terms. Originality/value - The application of semantic expansion to browsing may be useful in interface options where thesaurus structure is hidden.

0.004476557 = product of:
  0.017906228 = sum of:
    0.017906228 = weight(_text_:science in 3179) [ClassicSimilarity], result of:
      0.017906228 = score(doc=3179,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.1455159 = fieldWeight in 3179, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3179)
  0.25 = coord(1/4)

Abstract

There are many advantages for Digital Libraries in indexing with classifications or thesauri, but some current disincentive in the lack of flexible retrieval tools that deal with compound descriptors. This paper discusses a matching function for compound descriptors, or multi-concept subject headings, that does not rely an exact matching but incorporates term expansion via thesaurus semantic relationships to produce ranked results that take account of missing and partially matching terms. The matching function is based an a measure of semantic closeness between terms, which has the potential to help with recall problems. The work reported is part of the ongoing FACET project in collaboration with the National Museum of Science and Industry and its collections database. The architecture of the prototype system and its Interface are outlined. The matching problem for compound descriptors is reviewed and the FACET implementation described. Results are discussed from scenarios using the faceted Getty Art and Architecture Thesaurus. We argue that automatic traversal of thesaurus relationships can augment the user's browsing possibilities. The techniques can be applied both to unstructured multi-concept subject headings and potentially to more syntactically structured strings. The notion of a focus term is used by the matching function to model AAT modified descriptors (noun phrases). The relevance of the approach to precoordinated indexing and matching faceted strings is discussed.

0.004476557 = product of:
  0.017906228 = sum of:
    0.017906228 = weight(_text_:science in 4171) [ClassicSimilarity], result of:
      0.017906228 = score(doc=4171,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.1455159 = fieldWeight in 4171, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4171)
  0.25 = coord(1/4)

Abstract

Purpose - Traditional subject indexing and classification are considered infeasible in many digital collections. This paper seeks to investigate ways of enhancing social tagging via knowledge organization systems, with a view to improving the quality of tags for increased information discovery and retrieval performance. Design/methodology/approach - Enhanced tagging interfaces were developed for exemplar online repositories, and trials were undertaken with author and reader groups to evaluate the effectiveness of tagging augmented with control vocabulary for subject indexing of papers in online repositories. Findings - The results showed that using a knowledge organisation system to augment tagging does appear to increase the effectiveness of non-specialist users (that is, without information science training) in subject indexing. Research limitations/implications - While limited by the size and scope of the trials undertaken, these results do point to the usefulness of a mixed approach in supporting the subject indexing of online resources. Originality/value - The value of this work is as a guide to future developments in the practical support for resource indexing in online repositories.

0.004476557 = product of:
  0.017906228 = sum of:
    0.017906228 = weight(_text_:science in 2895) [ClassicSimilarity], result of:
      0.017906228 = score(doc=2895,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.1455159 = fieldWeight in 2895, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2895)
  0.25 = coord(1/4)

Source

Journal of the Association for Information Science and Technology. 67(2016) no.5, S.1138-1152

0.0035812457 = product of:
  0.014324983 = sum of:
    0.014324983 = weight(_text_:science in 175) [ClassicSimilarity], result of:
      0.014324983 = score(doc=175,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.11641272 = fieldWeight in 175, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.03125 = fieldNorm(doc=175)
  0.25 = coord(1/4)

Abstract

There are many advantages for Digital Libraries in indexing with classifications or thesauri, but some current disincentive in the lack of flexible retrieval tools that deal with compound descriptors. This demonstration of a research prototype illustrates a matching function for compound descriptors, or multi-concept subject headings, that does not rely on exact matching but incorporates term expansion via thesaurus semantic relationships to produce ranked results that take account of missing and partially matching terms. The matching function is based on a measure of semantic closeness between terms.The work is part of the EPSRC funded FACET project in collaboration with the UK National Museum of Science and Industry (NMSI) which includes the National Railway Museum. An export of NMSI's Collections Database is used as the dataset for the research. The J. Paul Getty Trust's Art and Architecture Thesaurus (AAT) is the main thesaurus in the project. The AAT is a widely used thesaurus (over 120,000 terms). Descriptors are organised in 7 facets representing separate conceptual classes of terms.The FACET application is a multi tiered architecture accessing a SQL Server database, with an OLE DB connection. The thesauri are stored as relational tables in the Server's database. However, a key component of the system is a parallel representation of the underlying semantic network as an in-memory structure of thesaurus concepts (corresponding to preferred terms). The structure models the hierarchical and associative interrelationships of thesaurus concepts via weighted poly-hierarchical links. Its primary purpose is real-time semantic expansion of query terms, achieved by a spreading activation semantic closeness algorithm. Queries with associated results are stored persistently using XML format data. A Visual Basic interface combines a thesaurus browser and an initial term search facility that takes into account equivalence relationships. Terms are dragged to a direct manipulation Query Builder which maintains the facet structure.

0.0035812457 = product of:
  0.014324983 = sum of:
    0.014324983 = weight(_text_:science in 1955) [ClassicSimilarity], result of:
      0.014324983 = score(doc=1955,freq=2.0), product of:
        0.12305341 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0467152 = queryNorm
        0.11641272 = fieldWeight in 1955, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.03125 = fieldNorm(doc=1955)
  0.25 = coord(1/4)

Source

Bulletin of the American Society for Information Science and Technology. 33(2006) no.5, S.xx-xx