Search (113 results, page 1 of 6)

0.07694328 = product of:
  0.15388656 = sum of:
    0.15388656 = sum of:
      0.0841448 = weight(_text_:search in 5295) [ClassicSimilarity], result of:
        0.0841448 = score(doc=5295,freq=6.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.46558946 = fieldWeight in 5295, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0546875 = fieldNorm(doc=5295)
      0.069741756 = weight(_text_:22 in 5295) [ClassicSimilarity], result of:
        0.069741756 = score(doc=5295,freq=4.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = 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)

Abstract

A new search paradigm, in which the primary user activity is the guided exploration of a complex information space rather than the retrieval of items based on precise specifications, is proposed. The author claims that this paradigm is the norm in most practical applications, and that solutions based on traditional search methods are not effective in this context. He then presents a solution based on dynamic taxonomies, a knowledge management model that effectively guides users to reach their goal while giving them total freedom in exploring the information base. Applications, benefits, and current research are discussed.

Date

22. 7.2006 17:56:22

Footnote

Beitrag in einer Special Section "Perspectives on Search User Interfaces: Best Practices and Future Visions"

0.069925636 = product of:
  0.13985127 = sum of:
    0.13985127 = sum of:
      0.06940146 = weight(_text_:search in 2751) [ClassicSimilarity], result of:
        0.06940146 = score(doc=2751,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.3840117 = fieldWeight in 2751, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.078125 = fieldNorm(doc=2751)
      0.07044981 = weight(_text_:22 in 2751) [ClassicSimilarity], result of:
        0.07044981 = score(doc=2751,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = 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)

Date

1. 2.2016 18:25:22

Source

Semantic keyword-based search on structured data sources: First COST Action IC1302 International KEYSTONE Conference, IKC 2015, Coimbra, Portugal, September 8-9, 2015. Revised Selected Papers. Eds.: J. Cardoso et al

0.069925636 = product of:
  0.13985127 = sum of:
    0.13985127 = sum of:
      0.06940146 = weight(_text_:search in 2754) [ClassicSimilarity], result of:
        0.06940146 = score(doc=2754,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.3840117 = fieldWeight in 2754, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.078125 = fieldNorm(doc=2754)
      0.07044981 = weight(_text_:22 in 2754) [ClassicSimilarity], result of:
        0.07044981 = score(doc=2754,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = 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)

Date

1. 2.2016 18:25:22

Source

Semantic keyword-based search on structured data sources: First COST Action IC1302 International KEYSTONE Conference, IKC 2015, Coimbra, Portugal, September 8-9, 2015. Revised Selected Papers. Eds.: J. Cardoso et al

0.069925636 = product of:
  0.13985127 = sum of:
    0.13985127 = sum of:
      0.06940146 = weight(_text_:search in 3279) [ClassicSimilarity], result of:
        0.06940146 = score(doc=3279,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.3840117 = fieldWeight in 3279, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.078125 = fieldNorm(doc=3279)
      0.07044981 = weight(_text_:22 in 3279) [ClassicSimilarity], result of:
        0.07044981 = score(doc=3279,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = 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)

Source

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

0.063517205 = product of:
  0.12703441 = sum of:
    0.12703441 = sum of:
      0.091809504 = weight(_text_:search in 56) [ClassicSimilarity], result of:
        0.091809504 = score(doc=56,freq=14.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.5079997 = fieldWeight in 56, product of:
            3.7416575 = tf(freq=14.0), with freq of:
              14.0 = termFreq=14.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0390625 = fieldNorm(doc=56)
      0.035224903 = weight(_text_:22 in 56) [ClassicSimilarity], result of:
        0.035224903 = score(doc=56,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.19345059 = fieldWeight in 56, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=56)
  0.5 = coord(1/2)

Abstract

The study reported here investigated the query expansion behavior of end-users interacting with a thesaurus-enhanced search system on the Web. Two groups, namely academic staff and postgraduate students, were recruited into this study. Data were collected from 90 searches performed by 30 users using the OVID interface to the CAB abstracts database. Data-gathering techniques included questionnaires, screen capturing software, and interviews. The results presented here relate to issues of search-topic and search-term characteristics, number and types of expanded queries, usefulness of thesaurus terms, and behavioral differences between academic staff and postgraduate students in their interaction. The key conclusions drawn were that (a) academic staff chose more narrow and synonymous terms than did postgraduate students, who generally selected broader and related terms; (b) topic complexity affected users' interaction with the thesaurus in that complex topics required more query expansion and search term selection; (c) users' prior topic-search experience appeared to have a significant effect on their selection and evaluation of thesaurus terms; (d) in 50% of the searches where additional terms were suggested from the thesaurus, users stated that they had not been aware of the terms at the beginning of the search; this observation was particularly noticeable in the case of postgraduate students.

Date

22. 7.2006 16:32:43

0.0590094 = product of:
  0.1180188 = sum of:
    0.1180188 = sum of:
      0.068703935 = weight(_text_:search in 6958) [ClassicSimilarity], result of:
        0.068703935 = score(doc=6958,freq=4.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.38015217 = fieldWeight in 6958, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0546875 = fieldNorm(doc=6958)
      0.049314864 = weight(_text_:22 in 6958) [ClassicSimilarity], result of:
        0.049314864 = score(doc=6958,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = 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)

Abstract

Reports on the design of a GUI for the Okapi 'best match' retrieval system developed at the Centre for Interactive Systems Research, City University, UK, for online library catalogues. The X-Windows interface includes an interactive query expansion (IQE) facilty which involves the user in the selection of query terms to reformulate a search. Presents the design rationale, based on a game board metaphor, and describes the features of each of the stages of the search interaction. Reports on the early operational field trial and discusses relevant evaluation issues and objectives

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

0.052609973 = product of:
  0.105219945 = sum of:
    0.105219945 = sum of:
      0.08056251 = weight(_text_:search in 1633) [ClassicSimilarity], result of:
        0.08056251 = score(doc=1633,freq=22.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.44576794 = fieldWeight in 1633, product of:
            4.690416 = tf(freq=22.0), with freq of:
              22.0 = termFreq=22.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.02734375 = fieldNorm(doc=1633)
      0.024657432 = weight(_text_:22 in 1633) [ClassicSimilarity], result of:
        0.024657432 = score(doc=1633,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = 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.5 = coord(1/2)

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.050579485 = product of:
  0.10115897 = sum of:
    0.10115897 = sum of:
      0.058889087 = weight(_text_:search in 2419) [ClassicSimilarity], result of:
        0.058889087 = score(doc=2419,freq=4.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.3258447 = fieldWeight in 2419, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.046875 = fieldNorm(doc=2419)
      0.04226988 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
        0.04226988 = score(doc=2419,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.23214069 = fieldWeight in 2419, 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=2419)
  0.5 = coord(1/2)

Abstract

The digital library system Daffodil is targeted at strategic support of users during the information search process. For searching, exploring and managing digital library objects it provides user-customisable information seeking patterns over a federation of heterogeneous digital libraries. In this paper evaluation results with respect to retrieval effectiveness, efficiency and user satisfaction are presented. The analysis focuses on strategic support for the scientific work-flow. Daffodil supports the whole work-flow, from data source selection over information seeking to the representation, organisation and reuse of information. By embedding high level search functionality into the scientific work-flow, the user experiences better strategic system support due to a more systematic work process. These ideas have been implemented in Daffodil followed by a qualitative evaluation. The evaluation has been conducted with 28 participants, ranging from information seeking novices to experts. The results are promising, as they support the chosen model.

Date

16.11.2008 16:22:48

0.048947945 = product of:
  0.09789589 = sum of:
    0.09789589 = sum of:
      0.048581023 = weight(_text_:search in 1319) [ClassicSimilarity], result of:
        0.048581023 = score(doc=1319,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.2688082 = fieldWeight in 1319, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1319)
      0.049314864 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
        0.049314864 = score(doc=1319,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.2708308 = fieldWeight in 1319, 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=1319)
  0.5 = coord(1/2)

Abstract

Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web

Date

1. 8.1996 22:08:06

0.048947945 = product of:
  0.09789589 = sum of:
    0.09789589 = sum of:
      0.048581023 = weight(_text_:search in 1466) [ClassicSimilarity], result of:
        0.048581023 = score(doc=1466,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.2688082 = fieldWeight in 1466, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1466)
      0.049314864 = weight(_text_:22 in 1466) [ClassicSimilarity], result of:
        0.049314864 = score(doc=1466,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.2708308 = fieldWeight in 1466, 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=1466)
  0.5 = coord(1/2)

Abstract

The paper discusses the issue of increasing users' access to library records by their publication in Google. Data from the records, converted into html format, have been indexed by Google. The process covered basic formal description fields of the records, description of the content, supported with a thesaurus, as well as an abstract, if present in the record. In addition to monitoring the end users' statistics, the pilot testing covered visibility of library records in Google search results.

Source

Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik

0.036062058 = product of:
  0.072124116 = sum of:
    0.072124116 = product of:
      0.14424823 = sum of:
        0.14424823 = weight(_text_:search in 3310) [ClassicSimilarity], result of:
          0.14424823 = score(doc=3310,freq=24.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.79815334 = fieldWeight in 3310, product of:
              4.8989797 = tf(freq=24.0), with freq of:
                24.0 = termFreq=24.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=3310)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Introducing context to a user query is effective to improve the search effectiveness. In this article we propose a method employing the taxonomy-based search services such as Web directories to facilitate searches in any Web search interfaces that support Boolean queries. The proposed method enables one to convey current search context an taxonomy of a taxonomy-based search service to the searches conducted with the Web search interfaces. The basic idea is to learn the search context in the form of a Boolean condition that is commonly accepted by many Web search interfaces, and to use the condition to modify the user query before forwarding it to the Web search interfaces. To guarantee that the modified query can always be processed by the Web search interfaces and to make the method adaptive to different user requirements an search result effectiveness, we have developed new fast classification learning algorithms.

0.034962818 = product of:
  0.069925636 = sum of:
    0.069925636 = sum of:
      0.03470073 = weight(_text_:search in 5697) [ClassicSimilarity], result of:
        0.03470073 = score(doc=5697,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.19200584 = fieldWeight in 5697, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5697)
      0.035224903 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
        0.035224903 = score(doc=5697,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.19345059 = fieldWeight in 5697, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5697)
  0.5 = coord(1/2)

Abstract

The performance of 8 ranking algorithms was evaluated with respect to their effectiveness in ranking terms for query expansion. The evaluation was conducted within an investigation of interactive query expansion and relevance feedback in a real operational environment. Focuses on the identification of algorithms that most effectively take cognizance of user preferences. user choices (i.e. the terms selected by the searchers for the query expansion search) provided the yardstick for the evaluation of the 8 ranking algorithms. This methodology introduces a user oriented approach in evaluating ranking algorithms for query expansion in contrast to the standard, system oriented approaches. Similarities in the performance of the 8 algorithms and the ways these algorithms rank terms were the main focus of this evaluation. The findings demonstrate that the r-lohi, wpq, enim, and porter algorithms have similar performance in bringing good terms to the top of a ranked list of terms for query expansion. However, further evaluation of the algorithms in different (e.g. full text) environments is needed before these results can be generalized beyond the context of the present study

Date

22. 2.1996 13:14:10

0.034962818 = product of:
  0.069925636 = sum of:
    0.069925636 = sum of:
      0.03470073 = weight(_text_:search in 1343) [ClassicSimilarity], result of:
        0.03470073 = score(doc=1343,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.19200584 = fieldWeight in 1343, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1343)
      0.035224903 = weight(_text_:22 in 1343) [ClassicSimilarity], result of:
        0.035224903 = score(doc=1343,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.19345059 = fieldWeight in 1343, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1343)
  0.5 = coord(1/2)

Abstract

A substantial fraction of web search queries contain references to entities, such as persons, organizations, and locations. Recently, methods that exploit named entities have been shown to be more effective for query expansion than traditional pseudorelevance feedback methods. In this article, we introduce a supervised learning approach that exploits named entities for query expansion using Wikipedia as a repository of high-quality feedback documents. In contrast with existing entity-oriented pseudorelevance feedback approaches, we tackle query expansion as a learning-to-rank problem. As a result, not only do we select effective expansion terms but we also weigh these terms according to their predicted effectiveness. To this end, we exploit the rich structure of Wikipedia articles to devise discriminative term features, including each candidate term's proximity to the original query terms, as well as its frequency across multiple article fields and in category and infobox descriptors. Experiments on three Text REtrieval Conference web test collections attest the effectiveness of our approach, with gains of up to 23.32% in terms of mean average precision, 19.49% in terms of precision at 10, and 7.86% in terms of normalized discounted cumulative gain compared with a state-of-the-art approach for entity-oriented query expansion.

Date

22. 8.2014 17:07:50

0.03371966 = product of:
  0.06743932 = sum of:
    0.06743932 = sum of:
      0.039259393 = weight(_text_:search in 1626) [ClassicSimilarity], result of:
        0.039259393 = score(doc=1626,freq=4.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.21722981 = fieldWeight in 1626, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.03125 = fieldNorm(doc=1626)
      0.028179923 = weight(_text_:22 in 1626) [ClassicSimilarity], result of:
        0.028179923 = score(doc=1626,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = 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)

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

Series

Special issue: Semantic search

0.03245956 = product of:
  0.06491912 = sum of:
    0.06491912 = product of:
      0.12983824 = sum of:
        0.12983824 = weight(_text_:search in 2678) [ClassicSimilarity], result of:
          0.12983824 = score(doc=2678,freq=28.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.7184201 = fieldWeight in 2678, product of:
              5.2915025 = tf(freq=28.0), with freq of:
                28.0 = termFreq=28.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2678)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Analyzing and modeling users' online search behaviors when conducting exploratory search tasks could be instrumental in discovering search behavior patterns that can then be leveraged to assist users in reaching their search task goals. We propose a framework for evaluating exploratory search based on implicit features and user search action sequences extracted from the transactional log data to model different aspects of exploratory search namely uncertainty, creativity, exploration, and knowledge discovery. We show the effectiveness of the proposed framework by demonstrating how it can be used to understand and evaluate user search performance and thereby make meaningful recommendations to improve the overall search performance of users. We used data collected from a user study consisting of 18 users conducting an exploratory search task for two sessions with two different topics in the experimental analysis. With this analysis we show that we can effectively model their behavior using implicit features to predict the user's future performance level with above 70% accuracy in most cases. Further, using simulations we demonstrate that our search process based recommendations improve the search performance of low performing users over time and validate these findings using both qualitative and quantitative approaches.

0.03127882 = product of:
  0.06255764 = sum of:
    0.06255764 = product of:
      0.12511528 = sum of:
        0.12511528 = weight(_text_:search in 2717) [ClassicSimilarity], result of:
          0.12511528 = score(doc=2717,freq=26.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.69228697 = fieldWeight in 2717, product of:
              5.0990195 = tf(freq=26.0), with freq of:
                26.0 = termFreq=26.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2717)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

As the volume and breadth of online information is rapidly increasing, ad hoc search systems become less and less efficient to answer information needs of modern users. To support the growing complexity of search tasks, researchers in the field of information developed and explored a range of approaches that extend the traditional ad hoc retrieval paradigm. Among these approaches, personalized search systems and exploratory search systems attracted many followers. Personalized search explored the power of artificial intelligence techniques to provide tailored search results according to different user interests, contexts, and tasks. In contrast, exploratory search capitalized on the power of human intelligence by providing users with more powerful interfaces to support the search process. As these approaches are not contradictory, we believe that they can re-enforce each other. We argue that the effectiveness of personalized search systems may be increased by allowing users to interact with the system and learn/investigate the problem in order to reach the final goal. We also suggest that an interactive visualization approach could offer a good ground to combine the strong sides of personalized and exploratory search approaches. This paper proposes a specific way to integrate interactive visualization and personalized search and introduces an adaptive visualization based search system Adaptive VIBE that implements it. We tested the effectiveness of Adaptive VIBE and investigated its strengths and weaknesses by conducting a full-scale user study. The results show that Adaptive VIBE can improve the precision and the productivity of the personalized search system while helping users to discover more diverse sets of information.

0.031230655 = product of:
  0.06246131 = sum of:
    0.06246131 = product of:
      0.12492262 = sum of:
        0.12492262 = weight(_text_:search in 644) [ClassicSimilarity], result of:
          0.12492262 = score(doc=644,freq=18.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.691221 = fieldWeight in 644, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=644)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

While the search interfaces used by common academic digital libraries provide easy access to a wealth of peer-reviewed literature, their interfaces provide little support for exploratory browsing. When faced with a complex search task (such as one that requires knowledge discovery), exploratory browsing is an important first step in an exploratory search process. To more effectively support exploratory browsing, we have designed and implemented a novel academic digital library search interface (KLink Search) with two new features: visually linked keywords and an interactive workspace. To study the potential value of these features, we have conducted a controlled laboratory study with 32 participants, comparing KLink Search to a baseline digital library search interface modeled after that used by IEEE Xplore. Based on subjective opinions, objective performance, and behavioral data, we show the value of adding lightweight visual and interactive features to academic digital library search interfaces to support exploratory browsing.

0.028772324 = product of:
  0.05754465 = sum of:
    0.05754465 = product of:
      0.1150893 = sum of:
        0.1150893 = weight(_text_:search in 4331) [ClassicSimilarity], result of:
          0.1150893 = score(doc=4331,freq=22.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6368113 = fieldWeight in 4331, product of:
              4.690416 = tf(freq=22.0), with freq of:
                22.0 = termFreq=22.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4331)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Purpose - This paper seeks to report an investigation into the ways in which end-users perceive a thesaurus-enhanced search interface, in particular thesaurus and search interface usability. Design/methodology/approach - Thirty academic users, split between staff and postgraduate students, carrying out real search requests were observed during this study. Users were asked to comment on a range of thesaurus and interface characteristics including: ease of use, ease of learning, ease of browsing and navigation, problems and difficulties encountered while interacting with the system, and the effect of browsing on search term selection. Findings - The results suggest that interface usability is a factor affecting thesaurus browsing/navigation and other information-searching behaviours. Academic staff viewed the function of a thesaurus as being useful for narrowing down a search and providing alternative search terms, while postgraduates stressed the role of the thesaurus for broadening searches and providing new terms. Originality/value - The paper provides an insight into the ways in which end-users make use of and interact with a thesaurus-enhanced search interface. This area is new since previous research has particularly focused on how professional searchers and librarians make use of thesauri and thesaurus-enhanced search interfaces. The research reported here suggests that end-users with varying levels of domain knowledge are able to use thesauri that are integrated into search interfaces. It also provides design implications for search interface developers as well as information professionals who are involved in teaching online searching.

0.027760584 = product of:
  0.055521168 = sum of:
    0.055521168 = product of:
      0.111042336 = sum of:
        0.111042336 = weight(_text_:search in 411) [ClassicSimilarity], result of:
          0.111042336 = score(doc=411,freq=32.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6144187 = fieldWeight in 411, product of:
              5.656854 = tf(freq=32.0), with freq of:
                32.0 = termFreq=32.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.03125 = fieldNorm(doc=411)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The Web has become the world's largest database, with search being the main tool that allows organizations and individuals to exploit its huge amount of information. Search on the Web has been traditionally based on textual and structural similarities, ignoring to a large degree the semantic dimension, i.e., understanding the meaning of the query and of the document content. Combining search and semantics gives birth to the idea of semantic search. Traditional search engines have already advertised some semantic dimensions. Some of them, for instance, can enhance their generated result sets with documents that are semantically related to the query terms even though they may not include these terms. Nevertheless, the exploitation of the semantic search has not yet reached its full potential. In this book, Roberto De Virgilio, Francesco Guerra and Yannis Velegrakis present an extensive overview of the work done in Semantic Search and other related areas. They explore different technologies and solutions in depth, making their collection a valuable and stimulating reading for both academic and industrial researchers. The book is divided into three parts. The first introduces the readers to the basic notions of the Web of Data. It describes the different kinds of data that exist, their topology, and their storing and indexing techniques. The second part is dedicated to Web Search. It presents different types of search, like the exploratory or the path-oriented, alongside methods for their efficient and effective implementation. Other related topics included in this part are the use of uncertainty in query answering, the exploitation of ontologies, and the use of semantics in mashup design and operation. The focus of the third part is on linked data, and more specifically, on applying ideas originating in recommender systems on linked data management, and on techniques for the efficiently querying answering on linked data.

Content

Inhalt: Introduction.- Part I Introduction to Web of Data.- Topology of the Web of Data.- Storing and Indexing Massive RDF Data Sets.- Designing Exploratory Search Applications upon Web Data Sources.- Part II Search over the Web.- Path-oriented Keyword Search query over RDF.- Interactive Query Construction for Keyword Search on the SemanticWeb.- Understanding the Semantics of Keyword Queries on Relational DataWithout Accessing the Instance.- Keyword-Based Search over Semantic Data.- Semantic Link Discovery over Relational Data.- Embracing Uncertainty in Entity Linking.- The Return of the Entity-Relationship Model: Ontological Query Answering.- Linked Data Services and Semantics-enabled Mashup.- Part III Linked Data Search engines.- A Recommender System for Linked Data.- Flint: from Web Pages to Probabilistic Semantic Data.- Searching and Browsing Linked Data with SWSE.

0.027760584 = product of:
  0.055521168 = sum of:
    0.055521168 = product of:
      0.111042336 = sum of:
        0.111042336 = weight(_text_:search in 2221) [ClassicSimilarity], result of:
          0.111042336 = score(doc=2221,freq=8.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6144187 = fieldWeight in 2221, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0625 = fieldNorm(doc=2221)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

In the last few years, Twitter has become a powerful tool for publishing and discussing information. Yet, content exploration in Twitter requires substantial efforts and users often have to scan information streams by hand. In this paper, we approach this problem by means of faceted search. We propose strategies for inferring facets and facet values on Twitter by enriching the semantics of individual Twitter messages and present di erent methods, including personalized and context-adaptive methods, for making faceted search on Twitter more effective.

Source

http://fabianabel.de/papers/2011-wis-twitter-faceted-search-sasweb.pdf