Search (40 results, page 1 of 2)

0.08580963 = product of:
  0.12871444 = sum of:
    0.105127774 = weight(_text_:sites in 1026) [ClassicSimilarity], result of:
      0.105127774 = score(doc=1026,freq=2.0), product of:
        0.26002133 = queryWeight, product of:
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.049739745 = queryNorm
        0.40430441 = fieldWeight in 1026, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1026)
    0.02358667 = product of:
      0.04717334 = sum of:
        0.04717334 = weight(_text_:22 in 1026) [ClassicSimilarity], result of:
          0.04717334 = score(doc=1026,freq=2.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.2708308 = fieldWeight in 1026, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1026)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

We have created software applications that allow users to both author and use Semantic Web metadata. To create and use a layer of semantic content on top of the existing Web, we have (1) implemented a user interface that expedites the task of attributing metadata to resources on the Web, and (2) augmented a Web browser to leverage this semantic metadata to provide relevant information and tasks to the user. This project provides a framework for annotating and reorganizing existing files, pages, and sites on the Web that is similar to Vannevar Bushrsquos original concepts of trail blazing and associative indexing.

Source

Research and advanced technology for digital libraries : 7th European Conference, proceedings / ECDL 2003, Trondheim, Norway, August 17-22, 2003

0.049034074 = product of:
  0.07355111 = sum of:
    0.06007301 = weight(_text_:sites in 1626) [ClassicSimilarity], result of:
      0.06007301 = score(doc=1626,freq=2.0), product of:
        0.26002133 = queryWeight, product of:
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.049739745 = queryNorm
        0.23103109 = fieldWeight in 1626, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.03125 = fieldNorm(doc=1626)
    0.0134780975 = product of:
      0.026956195 = sum of:
        0.026956195 = weight(_text_:22 in 1626) [ClassicSimilarity], result of:
          0.026956195 = score(doc=1626,freq=2.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.15476047 = fieldWeight in 1626, 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=1626)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Purpose - The growing volumes of semantic data available in the web result in the need for handling the information overload phenomenon. The potential of this amount of data is enormous but in most cases it is very difficult for users to visualize, explore and use this data, especially for lay-users without experience with Semantic Web technologies. The paper aims to discuss these issues. Design/methodology/approach - The Visual Information-Seeking Mantra "Overview first, zoom and filter, then details-on-demand" proposed by Shneiderman describes how data should be presented in different stages to achieve an effective exploration. The overview is the first user task when dealing with a data set. The objective is that the user is capable of getting an idea about the overall structure of the data set. Different information architecture (IA) components supporting the overview tasks have been developed, so they are automatically generated from semantic data, and evaluated with end-users. Findings - The chosen IA components are well known to web users, as they are present in most web pages: navigation bars, site maps and site indexes. The authors complement them with Treemaps, a visualization technique for displaying hierarchical data. These components have been developed following an iterative User-Centered Design methodology. Evaluations with end-users have shown that they get easily used to them despite the fact that they are generated automatically from structured data, without requiring knowledge about the underlying semantic technologies, and that the different overview components complement each other as they focus on different information search needs. Originality/value - Obtaining semantic data sets overviews cannot be easily done with the current semantic web browsers. Overviews become difficult to achieve with large heterogeneous data sets, which is typical in the Semantic Web, because traditional IA techniques do not easily scale to large data sets. There is little or no support to obtain overview information quickly and easily at the beginning of the exploration of a new data set. This can be a serious limitation when exploring a data set for the first time, especially for lay-users. The proposal is to reuse and adapt existing IA components to provide this overview to users and show that they can be generated automatically from the thesaurus and ontologies that structure semantic data while providing a comparable user experience to traditional web sites.

Date

20. 1.2015 18:30:22

0.035237364 = product of:
  0.105712086 = sum of:
    0.105712086 = sum of:
      0.08212542 = weight(_text_:index in 1633) [ClassicSimilarity], result of:
        0.08212542 = score(doc=1633,freq=10.0), product of:
          0.21735094 = queryWeight, product of:
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.049739745 = queryNorm
          0.37784708 = fieldWeight in 1633, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.02734375 = fieldNorm(doc=1633)
      0.02358667 = weight(_text_:22 in 1633) [ClassicSimilarity], result of:
        0.02358667 = score(doc=1633,freq=2.0), product of:
          0.1741801 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049739745 = queryNorm
          0.1354154 = fieldWeight in 1633, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.02734375 = fieldNorm(doc=1633)
  0.33333334 = coord(1/3)

Abstract

Purpose - The purpose of this paper is to improve the conceptual-based search by incorporating structural ontological information such as concepts and relations. Generally, Semantic-based information retrieval aims to identify relevant information based on the meanings of the query terms or on the context of the terms and the performance of semantic information retrieval is carried out through standard measures-precision and recall. Higher precision leads to the (meaningful) relevant documents obtained and lower recall leads to the less coverage of the concepts. Design/methodology/approach - In this paper, the authors enhance the existing ontology-based indexing proposed by Kohler et al., by incorporating sibling information to the index. The index designed by Kohler et al., contains only super and sub-concepts from the ontology. In addition, in our approach, we focus on two tasks; query expansion and ranking of the expanded queries, to improve the efficiency of the ontology-based search. The aforementioned tasks make use of ontological concepts, and relations existing between those concepts so as to obtain semantically more relevant search results for a given query. Findings - The proposed ontology-based indexing technique is investigated by analysing the coverage of concepts that are being populated in the index. Here, we introduce a new measure called index enhancement measure, to estimate the coverage of ontological concepts being indexed. We have evaluated the ontology-based search for the tourism domain with the tourism documents and tourism-specific ontology. The comparison of search results based on the use of ontology "with and without query expansion" is examined to estimate the efficiency of the proposed query expansion task. The ranking is compared with the ORank system to evaluate the performance of our ontology-based search. From these analyses, the ontology-based search results shows better recall when compared to the other concept-based search systems. The mean average precision of the ontology-based search is found to be 0.79 and the recall is found to be 0.65, the ORank system has the mean average precision of 0.62 and the recall is found to be 0.51, while the concept-based search has the mean average precision of 0.56 and the recall is found to be 0.42. Practical implications - When the concept is not present in the domain-specific ontology, the concept cannot be indexed. When the given query term is not available in the ontology then the term-based results are retrieved. Originality/value - In addition to super and sub-concepts, we incorporate the concepts present in same level (siblings) to the ontological index. The structural information from the ontology is determined for the query expansion. The ranking of the documents depends on the type of the query (single concept query, multiple concept queries and concept with relation queries) and the ontological relations that exists in the query and the documents. With this ontological structural information, the search results showed us better coverage of concepts with respect to the query.

Date

20. 1.2015 18:30:22

0.019786924 = product of:
  0.05936077 = sum of:
    0.05936077 = product of:
      0.11872154 = sum of:
        0.11872154 = weight(_text_:index in 436) [ClassicSimilarity], result of:
          0.11872154 = score(doc=436,freq=4.0), product of:
            0.21735094 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.049739745 = queryNorm
            0.5462205 = fieldWeight in 436, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0625 = fieldNorm(doc=436)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

This paper discusses the use of wiki technology to provide a navigation structure for a collection of newspaper clippings. We overview the architecture of the wiki, discuss the navigation structure and pose the question: is the navigation structure an index, and if so, what type, or is it just a linkage structure or topic map. Does such a distinction really matter? Are these definitions in reality function based?

0.01588409 = product of:
  0.047652267 = sum of:
    0.047652267 = product of:
      0.095304534 = sum of:
        0.095304534 = weight(_text_:22 in 1352) [ClassicSimilarity], result of:
          0.095304534 = score(doc=1352,freq=4.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.54716086 = fieldWeight in 1352, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=1352)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 2.2003 17:25:39
22. 2.2003 18:17:40

0.015724447 = product of:
  0.04717334 = sum of:
    0.04717334 = product of:
      0.09434668 = sum of:
        0.09434668 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
          0.09434668 = score(doc=2134,freq=2.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.5416616 = fieldWeight in 2134, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=2134)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

30. 3.2001 13:32:22

0.01514621 = product of:
  0.04543863 = sum of:
    0.04543863 = product of:
      0.09087726 = sum of:
        0.09087726 = weight(_text_:index in 3223) [ClassicSimilarity], result of:
          0.09087726 = score(doc=3223,freq=6.0), product of:
            0.21735094 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.049739745 = queryNorm
            0.418113 = fieldWeight in 3223, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3223)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The aim of the study was to test whether query expansion by approximate string matching methods is beneficial in retrieval from historical newspaper collections in a language rich with compounds and inflectional forms (Finnish). First, approximate string matching methods were used to generate lists of index words most similar to contemporary query terms in a digitized newspaper collection from the 1800s. Top index word variants were categorized to estimate the appropriate query expansion ranges in the retrieval test. Second, the effectiveness of approximate string matching methods, automatically generated inflectional forms, and their combinations were measured in a Cranfield-style test. Finally, a detailed topic-level analysis of test results was conducted. In the index of historical newspaper collection the occurrences of a word typically spread to many linguistic and historical variants along with optical character recognition (OCR) errors. All query expansion methods improved the baseline results. Extensive expansion of around 30 variants for each query word was required to achieve the highest performance improvement. Query expansion based on approximate string matching was superior to using the inflectional forms of the query words, showing that coverage of the different types of variation is more important than precision in handling one type of variation.

0.013991467 = product of:
  0.0419744 = sum of:
    0.0419744 = product of:
      0.0839488 = sum of:
        0.0839488 = weight(_text_:index in 7729) [ClassicSimilarity], result of:
          0.0839488 = score(doc=7729,freq=2.0), product of:
            0.21735094 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.049739745 = queryNorm
            0.3862362 = fieldWeight in 7729, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0625 = fieldNorm(doc=7729)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Content

Enthält die Abschnitte: What constitutes a record; What constitutes a word and what 'words' to index; Use of stop lists; Use of suffixing or stemming; Advanced automatic indexing techniques (term weighting, query expansion, the use of multiple-word phrases for indexing)

0.011231748 = product of:
  0.033695243 = sum of:
    0.033695243 = product of:
      0.06739049 = sum of:
        0.06739049 = weight(_text_:22 in 2751) [ClassicSimilarity], result of:
          0.06739049 = score(doc=2751,freq=2.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.38690117 = fieldWeight in 2751, 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=2751)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

1. 2.2016 18:25:22

0.011231748 = product of:
  0.033695243 = sum of:
    0.033695243 = product of:
      0.06739049 = sum of:
        0.06739049 = weight(_text_:22 in 2754) [ClassicSimilarity], result of:
          0.06739049 = score(doc=2754,freq=2.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.38690117 = fieldWeight in 2754, 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=2754)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

1. 2.2016 18:25:22

0.011231748 = product of:
  0.033695243 = sum of:
    0.033695243 = product of:
      0.06739049 = sum of:
        0.06739049 = weight(_text_:22 in 3279) [ClassicSimilarity], result of:
          0.06739049 = score(doc=3279,freq=2.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.38690117 = fieldWeight in 3279, 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=3279)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou

0.011231748 = product of:
  0.033695243 = sum of:
    0.033695243 = product of:
      0.06739049 = sum of:
        0.06739049 = weight(_text_:22 in 3280) [ClassicSimilarity], result of:
          0.06739049 = score(doc=3280,freq=2.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.38690117 = fieldWeight in 3280, 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=3280)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou

0.011118863 = product of:
  0.03335659 = sum of:
    0.03335659 = product of:
      0.06671318 = sum of:
        0.06671318 = weight(_text_:22 in 5295) [ClassicSimilarity], result of:
          0.06671318 = score(doc=5295,freq=4.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.38301262 = fieldWeight in 5295, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5295)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 7.2006 17:56:22

0.009893462 = product of:
  0.029680384 = sum of:
    0.029680384 = product of:
      0.05936077 = sum of:
        0.05936077 = weight(_text_:index in 6625) [ClassicSimilarity], result of:
          0.05936077 = score(doc=6625,freq=4.0), product of:
            0.21735094 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.049739745 = queryNorm
            0.27311024 = fieldWeight in 6625, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.03125 = fieldNorm(doc=6625)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Es wird eine Methode vorgestellt, wie sich Ordnungssysteme für die Suche in textbasierten Datenbeständen verwenden lassen. "Ordnungssystem" wird hier als Oberbegriff für beliebige geordnete Begriffssammlungen verwendet. Dies sind beispielsweise Thesauri, Klassifikationen und formale Systematiken. Weil Thesauri dabei die leistungsfähigsten Ordnungssysteme sind, finden sie eine besondere Berücksichtigung. Der Beitrag ist streng praxisbezogenen und auf die Nutzerschnittstelle konzentriert. Die Basis für die Nutzerschnittstelle bilden Ordnungssysteme, die über eine WWW-Schnittstelle angeboten werden. Je nach Fachgebiet kann der Nutzer ein spezielles Ordnungssystem für die Suche auswählen. Im Unterschied zu klassischen Verfahren werden die Ordnungssysteme nicht zur ausschließlichen Suche in Deskriptorenfeldern, sondern für die Suche in einem Basic Index verwendet. In der Anwendung auf den Basic Index sind die Ordnungssysteme quasi "entkoppelt" von der ursprünglichen Datenbank und den Deskriptorenfeldern, für die das Ordnungssystem entwickelt wurde. Die Inhalte einer Datenbank spielen bei der Wahl der Ordnungssysteme zunächst keine Rolle. Sie machen sich erst bei der Suche in der Anzahl der Treffer bemerkbar: so findet ein rechtswissenschaftlicher Thesaurus natürlicherweise in einer Medizin-Datenbank weniger relevante Dokumente als in einer Rechts-Datenbank, weil das im Rechts-Thesaurus abgebildete Begriffsgut eher in einer Rechts-Datenbank zu finden ist. Das Verfahren ist modular aufgebaut und sieht in der Konzeption nachgeordnete semantische Retrievalverfahren vor, die zu einer Verbesserung von Retrievaleffektivität und -effizienz führen werden. So werden aus einer Ergebnismenge, die ausschließlich durch exakten Zeichenkettenabgleich gefunden wurde, in einem nachfolgenden Schritt durch eine semantische Analyse diejenigen Dokumente herausgefiltert, die für die Suchfrage relevant sind. Die WWW-Nutzerschnittstelle und die Verwendung bereits bestehender Ordnungssysteme führen zu einer Minimierung des Arbeitsaufwands auf Nutzerseite. Die Kosten für eine Suche lassen sich sowohl auf der Input-Seite verringern, indem eine aufwendige "manuelle" Indexierung entfällt, als auch auf der Output-Seite, indem den Nutzern leicht bedienbare Suchoptionen zur Verfügung gestellt werden

0.008985398 = product of:
  0.026956195 = sum of:
    0.026956195 = product of:
      0.05391239 = sum of:
        0.05391239 = weight(_text_:22 in 5693) [ClassicSimilarity], result of:
          0.05391239 = score(doc=5693,freq=2.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.30952093 = fieldWeight in 5693, 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=5693)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

30. 3.2001 13:35:22

0.008744667 = product of:
  0.026234 = sum of:
    0.026234 = product of:
      0.052468 = sum of:
        0.052468 = weight(_text_:index in 5691) [ClassicSimilarity], result of:
          0.052468 = score(doc=5691,freq=2.0), product of:
            0.21735094 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.049739745 = queryNorm
            0.24139762 = fieldWeight in 5691, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5691)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The second half of a 'before and after' study to evaluate the impact of an online catalogue on subject searching behaviour is reported. A holistic approach is adopted encompassing both catalogue use and browsing at the shelves for catalogue users and non-users. Verbal and non-verbal data were elicited from searchers using a combined methodology including talk-aloud technique, observation and a screen logging facility. An extensive qualitative analysis was carried out correlating expressed topics, search formulation strategies and documents retrieved at the shelves. The online catalogue environment does not appear to have increased the extent of subject searching nor the use of the bibliographic tool. The manual PRECIS index supported a contextual approach for broad and more interactive search formulations whereas the OPAC encouraged a matching approach and narrow formulations with fewer but user generated formulations. The success rate of the online catalogue was slightly better than that of the manual tools but fewer items were retrieved at the shelves. Non-users of the bibliographic tools seemed to be just as successful. To improve retrieval effectiveness it is suggested that online catalogues should cater for both matching and contextual approaches to searching. Recent research indicates that a more interactive process could be promoted by providing query expansion through a combination of searching aids for matching, for search formulation assistance and for structured contextual retrieval

0.008744667 = product of:
  0.026234 = sum of:
    0.026234 = product of:
      0.052468 = sum of:
        0.052468 = weight(_text_:index in 5962) [ClassicSimilarity], result of:
          0.052468 = score(doc=5962,freq=2.0), product of:
            0.21735094 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.049739745 = queryNorm
            0.24139762 = fieldWeight in 5962, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5962)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Seit 3. Juli 2006 stellt das ZPID eine verbesserte Suchoberfläche für die Recherche in der bibliographischen Psychologie-Datenbank PSYNDEX zur Verfügung. Hauptmerkmal der neuen Version 1.1 des 'ZPID-Retrieval für PSYNDEX' ist die Einbindung von 'PSYNDEX Terms', dem kontrollierten Wortschatz der psychologischen Fachsprache. PSYNDEX Terms basiert auf dem 'Thesaurus of Psychological Index Terms' der American Psychological Association (APA) und enthält im Moment über 5.400 Deskriptoren. Zu jedem Deskriptor werden ggf. Oberbegriffe, Unterbegriffe und verwandte Begriffe angezeigt. Wer die Suchoberfläche nutzt, kann entweder im Thesaurus blättern oder gezielt nach Thesaurusbegriffen suchen. Kommt der eigene frei gewählte Suchbegriff nicht im Thesaurus vor, macht das System selbsttätig Vorschläge für passende Thesaurusbegriffe. DerThesaurus ist komplett zweisprachig (deutsch/englisch) implementiert, sodass er auch als Übersetzungshilfe dient. Weitere Verbesserungen der Suchoberfläche betreffen die Darstellbarkeit in unterschiedlichen Web-Browsern mit dem Ziel der Barrierefreiheit, die Erweiterung der OnlineHilfe mit Beispielen für erfolgreiche Suchstrategien, die Möglichkeit, zu speziellen Themen vertiefte Informationen abzurufen (den Anfang machen psychologische Behandlungsprogramme) und die Bereitstellung eines Export-Filters für EndNote. Zielgruppe des ZPID-Retrieval sind Einzelpersonen, die keinen institutionellen PSYNDEX-Zugang, z.B. am Campus einer Universität, nutzen können. Sie können das kostenpflichtige Retrieval direkt online erwerben und werden binnen weniger Minuten freigeschaltet. Kunden mit existierendem Vertrag kommen automatisch in den Genuss der verbesserten Suchoberfläche.

0.008744667 = product of:
  0.026234 = sum of:
    0.026234 = product of:
      0.052468 = sum of:
        0.052468 = weight(_text_:index in 431) [ClassicSimilarity], result of:
          0.052468 = score(doc=431,freq=2.0), product of:
            0.21735094 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.049739745 = queryNorm
            0.24139762 = fieldWeight in 431, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=431)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The birth of the Web has brought an exponential growth to the amount of the information that is freely available to the Internet population, overloading users and entangling their efforts to satisfy their information needs. Web search engines such Google, Yahoo, or Bing have become popular mainly due to the fact that they offer an easy-to-use query interface (i.e., based on keywords) and an effective and efficient query execution mechanism. The majority of these search engines do not consider information stored on the deep or hidden Web [9,28], despite the fact that the size of the deep Web is estimated to be much bigger than the surface Web [9,47]. There have been a number of systems that record interactions with the deep Web sources or automatically submit queries them (mainly through their Web form interfaces) in order to index their context. Unfortunately, this technique is only partially indexing the data instance. Moreover, it is not possible to take advantage of the query capabilities of data sources, for example, of the relational query features, because their interface is often restricted from the Web form. Besides, Web search engines focus on retrieving documents and not on querying structured sources, so they are unable to access information based on concepts.

0.008744667 = product of:
  0.026234 = sum of:
    0.026234 = product of:
      0.052468 = sum of:
        0.052468 = weight(_text_:index in 2854) [ClassicSimilarity], result of:
          0.052468 = score(doc=2854,freq=2.0), product of:
            0.21735094 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.049739745 = queryNorm
            0.24139762 = fieldWeight in 2854, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2854)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

In this article, we propose a new approach for indexing biomedical documents based on a possibilistic network that carries out partial matching between documents and biomedical vocabulary. The main contribution of our approach is to deal with the imprecision and uncertainty of the indexing task using possibility theory. We enhance estimation of the similarity between a document and a given concept using the two measures of possibility and necessity. Possibility estimates the extent to which a document is not similar to the concept. The second measure can provide confirmation that the document is similar to the concept. Our contribution also reduces the limitation of partial matching. Although the latter allows extracting from the document other variants of terms than those in dictionaries, it also generates irrelevant information. Our objective is to filter the index using the knowledge provided by the Unified Medical Language System®. Experiments were carried out on different corpora, showing encouraging results (the improvement rate is +26.37% in terms of main average precision when compared with the baseline).

0.007862223 = product of:
  0.02358667 = sum of:
    0.02358667 = product of:
      0.04717334 = sum of:
        0.04717334 = weight(_text_:22 in 6958) [ClassicSimilarity], result of:
          0.04717334 = score(doc=6958,freq=2.0), product of:
            0.1741801 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049739745 = queryNorm
            0.2708308 = fieldWeight in 6958, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6958)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon