Search (1001 results, page 1 of 51)

0.14173794 = product of:
  0.2126069 = sum of:
    0.05889038 = weight(_text_:query in 5493) [ClassicSimilarity], result of:
      0.05889038 = score(doc=5493,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.25674784 = fieldWeight in 5493, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5493)
    0.15371652 = sum of:
      0.120283864 = weight(_text_:page in 5493) [ClassicSimilarity], result of:
        0.120283864 = score(doc=5493,freq=4.0), product of:
          0.27565226 = queryWeight, product of:
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.049352113 = queryNorm
          0.4363609 = fieldWeight in 5493, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5493)
      0.03343265 = weight(_text_:22 in 5493) [ClassicSimilarity], result of:
        0.03343265 = score(doc=5493,freq=2.0), product of:
          0.1728227 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049352113 = queryNorm
          0.19345059 = fieldWeight in 5493, 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=5493)
  0.6666667 = coord(2/3)

Abstract

Purpose Web search is more and more moving into mobile contexts. However, screen size of mobile devices is limited and search engine result pages face a trade-off between offering informative snippets and optimal use of space. One factor clearly influencing this trade-off is snippet length. The purpose of this paper is to find out what snippet size to use in mobile web search. Design/methodology/approach For this purpose, an eye-tracking experiment was conducted showing participants search interfaces with snippets of one, three or five lines on a mobile device to analyze 17 dependent variables. In total, 31 participants took part in the study. Each of the participants solved informational and navigational tasks. Findings Results indicate a strong influence of page fold on scrolling behavior and attention distribution across search results. Regardless of query type, short snippets seem to provide too little information about the result, so that search performance and subjective measures are negatively affected. Long snippets of five lines lead to better performance than medium snippets for navigational queries, but to worse performance for informational queries. Originality/value Although space in mobile search is limited, this study shows that longer snippets improve usability and user experience. It further emphasizes that page fold plays a stronger role in mobile than in desktop search for attention distribution.

Date

20. 1.2015 18:30:22

0.13936773 = product of:
  0.2090516 = sum of:
    0.15801947 = weight(_text_:query in 378) [ClassicSimilarity], result of:
      0.15801947 = score(doc=378,freq=10.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.68892676 = fieldWeight in 378, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.046875 = fieldNorm(doc=378)
    0.051032126 = product of:
      0.10206425 = sum of:
        0.10206425 = weight(_text_:page in 378) [ClassicSimilarity], result of:
          0.10206425 = score(doc=378,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.37026453 = fieldWeight in 378, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.046875 = fieldNorm(doc=378)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

In this article, we propose new word sense disambiguation strategies for resolving the senses of polysemous query terms issued to Web search engines, and we explore the application of those strategies when used in a query expansion framework. The novelty of our approach lies in the exploitation of the Web page PageRank values as indicators of the significance the different senses of a term carry when employed in search queries. We also aim at scalable query sense resolution techniques that can be applied without loss of efficiency to large data sets such as those on the Web. Our experimental findings validate that the proposed techniques perform more accurately than do the traditional disambiguation strategies and improve the quality of the search results, when involved in query expansion.

0.13592485 = product of:
  0.20388725 = sum of:
    0.16986583 = weight(_text_:query in 5033) [ClassicSimilarity], result of:
      0.16986583 = score(doc=5033,freq=26.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.74057406 = fieldWeight in 5033, product of:
          5.0990195 = tf(freq=26.0), with freq of:
            26.0 = termFreq=26.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.03125 = fieldNorm(doc=5033)
    0.03402142 = product of:
      0.06804284 = sum of:
        0.06804284 = weight(_text_:page in 5033) [ClassicSimilarity], result of:
          0.06804284 = score(doc=5033,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.24684301 = fieldWeight in 5033, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.03125 = fieldNorm(doc=5033)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Academic search concerns the retrieval and profiling of information objects in the domain of academic research. In this paper we reveal important observations of academic search queries, and provide an algorithmic solution to address a type of failure during search sessions: null queries. We start by providing a general characterization of academic search queries, by analyzing a large-scale transaction log of a leading academic search engine. Unlike previous small-scale analyses of academic search queries, we find important differences with query characteristics known from web search. E.g., in academic search there is a substantially bigger proportion of entity queries, and a heavier tail in query length distribution. We then focus on search failures and, in particular, on null queries that lead to an empty search engine result page, on null sessions that contain such null queries, and on users who are prone to issue null queries. In academic search approximately 1 in 10 queries is a null query, and 25% of the sessions contain a null query. They appear in different types of search sessions, and prevent users from achieving their search goal. To address the high rate of null queries in academic search, we consider the task of providing query suggestions. Specifically we focus on a highly frequent query type: non-boolean informational queries. To this end we need to overcome query sparsity and make effective use of session information. We find that using entities helps to surface more relevant query suggestions in the face of query sparsity. We also find that query suggestions should be conditioned on the type of session in which they are offered to be more effective. After casting the session classification problem as a multi-label classification problem, we generate session-conditional query suggestions based on predicted session type. We find that this session-conditional method leads to significant improvements over a generic query suggestion method. Personalization yields very little further improvements over session-conditional query suggestions.

0.12906206 = product of:
  0.19359308 = sum of:
    0.052256163 = product of:
      0.15676849 = sum of:
        0.15676849 = weight(_text_:3a in 5820) [ClassicSimilarity], result of:
          0.15676849 = score(doc=5820,freq=2.0), product of:
            0.41840777 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.049352113 = queryNorm
            0.3746787 = fieldWeight in 5820, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=5820)
      0.33333334 = coord(1/3)
    0.14133692 = weight(_text_:query in 5820) [ClassicSimilarity], result of:
      0.14133692 = score(doc=5820,freq=18.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.61619484 = fieldWeight in 5820, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.03125 = fieldNorm(doc=5820)
  0.6666667 = coord(2/3)

Abstract

The successes of information retrieval (IR) in recent decades were built upon bag-of-words representations. Effective as it is, bag-of-words is only a shallow text understanding; there is a limited amount of information for document ranking in the word space. This dissertation goes beyond words and builds knowledge based text representations, which embed the external and carefully curated information from knowledge bases, and provide richer and structured evidence for more advanced information retrieval systems. This thesis research first builds query representations with entities associated with the query. Entities' descriptions are used by query expansion techniques that enrich the query with explanation terms. Then we present a general framework that represents a query with entities that appear in the query, are retrieved by the query, or frequently show up in the top retrieved documents. A latent space model is developed to jointly learn the connections from query to entities and the ranking of documents, modeling the external evidence from knowledge bases and internal ranking features cooperatively. To further improve the quality of relevant entities, a defining factor of our query representations, we introduce learning to rank to entity search and retrieve better entities from knowledge bases. In the document representation part, this thesis research also moves one step forward with a bag-of-entities model, in which documents are represented by their automatic entity annotations, and the ranking is performed in the entity space.

Content

Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Language and Information Technologies. Vgl.: https%3A%2F%2Fwww.cs.cmu.edu%2F~cx%2Fpapers%2Fknowledge_based_text_representation.pdf&usg=AOvVaw0SaTSvhWLTh__Uz_HtOtl3.

0.12824604 = product of:
  0.19236904 = sum of:
    0.14133692 = weight(_text_:query in 4105) [ClassicSimilarity], result of:
      0.14133692 = score(doc=4105,freq=8.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.61619484 = fieldWeight in 4105, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.046875 = fieldNorm(doc=4105)
    0.051032126 = product of:
      0.10206425 = sum of:
        0.10206425 = weight(_text_:page in 4105) [ClassicSimilarity], result of:
          0.10206425 = score(doc=4105,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.37026453 = fieldWeight in 4105, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.046875 = fieldNorm(doc=4105)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

This study investigated a relatively unexamined query type, queries composed of URLs. The extent, variation, and user click-through behavior was examined to determine the intent behind URL queries. The study made use of a search log from which URL queries were identified and selected for both qualitative and quantitative analyses. It was found that URL queries accounted for ?17% of the sample. There were statistically significant differences between URL queries and non-URL queries in the following attributes: mean query length; mean number of tokens per query; and mean number of clicks per query. Users issuing such queries clicked on fewer result list items higher up the ranking compared to non-URL queries. Classification indicated that nearly 86% of queries were navigational in intent with informational and transactional queries representing about 7% of URL queries each. This is in contrast to past research that suggested that URL queries were 100% navigational. The conclusions of this study are that URL queries are relatively common and that simply returning the page that matches a user's URL is not an optimal strategy.

0.11710644 = product of:
  0.17565966 = sum of:
    0.10200114 = weight(_text_:query in 4364) [ClassicSimilarity], result of:
      0.10200114 = score(doc=4364,freq=6.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.44470036 = fieldWeight in 4364, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4364)
    0.073658526 = product of:
      0.14731705 = sum of:
        0.14731705 = weight(_text_:page in 4364) [ClassicSimilarity], result of:
          0.14731705 = score(doc=4364,freq=6.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.5344308 = fieldWeight in 4364, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4364)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Caching of query results is an important mechanism for efficiency and scalability of web search engines. Query results are cached and presented in terms of pages, which typically include 10 results each. In navigational queries, users seek a particular website, which would be typically listed at the top ranks (maybe, first or second) by the search engine, if found. For this type of query, caching and presenting results in the 10-per-page manner may waste cache space and network bandwidth. In this article, we propose nonuniform result page models with varying numbers of results for navigational queries. The experimental results show that our approach reduces the cache miss count by up to 9.17% (because of better utilization of cache space). Furthermore, bandwidth usage, which is measured in terms of number of snippets sent, is also reduced by 71% for navigational queries. This means a considerable reduction in the number of transmitted network packets, i.e., a crucial gain especially for mobile-search scenarios. A user study reveals that users easily adapt to the proposed result page model and that the efficiency gains observed in the experiments can be carried over to real-life situations.

0.10731181 = product of:
  0.16096771 = sum of:
    0.14425138 = weight(_text_:query in 2702) [ClassicSimilarity], result of:
      0.14425138 = score(doc=2702,freq=12.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.6289012 = fieldWeight in 2702, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2702)
    0.016716326 = product of:
      0.03343265 = sum of:
        0.03343265 = weight(_text_:22 in 2702) [ClassicSimilarity], result of:
          0.03343265 = score(doc=2702,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.19345059 = fieldWeight in 2702, 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=2702)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Query suggestion is a common feature of many information search systems. While much research has been conducted about how to generate suggestions, fewer studies have been conducted about how people interact with and use suggestions. The purpose of this paper is to investigate how and when people integrate query suggestions into their searches and the outcome of this usage. The paper further investigates the relationships between search expertise, topic difficulty, and temporal segment of the search and query suggestion usage. A secondary analysis of data was conducted using data collected in a previous controlled laboratory study. In this previous study, 23 undergraduate research participants used an experimental search system with query suggestions to conduct four topic searches. Results showed that participants integrated the suggestions into their searching fairly quickly and that participants with less search expertise used more suggestions and saved more documents. Participants also used more suggestions towards the end of their searches and when searching for more difficult topics. These results show that query suggestion can provide support in situations where people have less search expertise, greater difficulty searching and at specific times during the search.

Date

25. 1.2016 18:43:22

0.106666565 = product of:
  0.15999985 = sum of:
    0.13325372 = weight(_text_:query in 344) [ClassicSimilarity], result of:
      0.13325372 = score(doc=344,freq=4.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5809541 = fieldWeight in 344, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0625 = fieldNorm(doc=344)
    0.026746122 = product of:
      0.053492244 = sum of:
        0.053492244 = weight(_text_:22 in 344) [ClassicSimilarity], result of:
          0.053492244 = score(doc=344,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.30952093 = fieldWeight in 344, 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=344)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

In diesem Kapitel wird beschrieben, wie Suchmaschinen Suchanfragen interpretieren können, um letztendlich den Nutzern besser auf ihren Kontext zugeschnittene Ergebnisse liefern zu können. Nach einer Diskussion der Notwendigkeit und der Einsatzmöglichkeiten des Query Understanding wird aufgezeigt, auf welcher Datenbasis und an welchen Ansatzpunkten Suchanfragen interpretiert werden können. Dann erfolgt eine Erläuterung der Interpretationsmöglichkeiten anhand der Suchanfragen-Facetten von Calderon-Benavides et al. (2010), welcher sich eine Diskussion der Verfahren zur Ermittlung der Facetten anschließt.

Date

18. 9.2018 18:22:18

0.10210096 = product of:
  0.15315144 = sum of:
    0.09422461 = weight(_text_:query in 1264) [ClassicSimilarity], result of:
      0.09422461 = score(doc=1264,freq=8.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.41079655 = fieldWeight in 1264, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.03125 = fieldNorm(doc=1264)
    0.058926824 = product of:
      0.11785365 = sum of:
        0.11785365 = weight(_text_:page in 1264) [ClassicSimilarity], result of:
          0.11785365 = score(doc=1264,freq=6.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.42754465 = fieldWeight in 1264, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.03125 = fieldNorm(doc=1264)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Over the past decade, the volume of information available digitally over the Internet has grown enormously. Technical developments in the area of search, such as Google's Page Rank algorithm, have proved so good at serving relevant results that Internet search has become integrated into daily human activity. One can endlessly explore topics of interest simply by querying and reading through the resulting links. Yet, although search engines are well known for providing relevant results based on users' queries, users do not always receive the results they are looking for. Google's Director of Research describes clickstream evidence of frustrated users repeatedly reformulating queries and searching through page after page of results. Given the general quality of search engine results, one must consider the possibility that the frustrated user's query is not effective; that is, it does not describe the essence of the user's interest. Indeed, extensive research into human search behavior has found that humans are not very effective at formulating good search queries that describe what they are interested in. Ideally, the user should simply point to a portion of text that sparked the user's interest, and a system should automatically formulate a search query that captures the essence of the text. In this paper, we describe an implemented system that provides this capability. We first describe how our work differs from existing work in automatic query formulation, and propose a new method for improved quantification of the relevance of candidate search terms drawn from input text using phrase-level analysis. We then propose an implementable method designed to provide relevant queries based on a user's text input. We demonstrate the quality of our results and performance of our system through experimental studies. Our results demonstrate that our system produces relevant search terms with roughly two-thirds precision and recall compared to search terms selected by experts, and that typical users find significantly more relevant results (31% more relevant) more quickly (64% faster) using our system than self-formulated search queries. Further, we show that our implementation can scale to request loads of up to 10 requests per second within current online responsiveness expectations (<2-second response times at the highest loads tested).

0.10080894 = product of:
  0.15121341 = sum of:
    0.11778076 = weight(_text_:query in 2754) [ClassicSimilarity], result of:
      0.11778076 = score(doc=2754,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5134957 = fieldWeight in 2754, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.078125 = fieldNorm(doc=2754)
    0.03343265 = product of:
      0.0668653 = sum of:
        0.0668653 = weight(_text_:22 in 2754) [ClassicSimilarity], result of:
          0.0668653 = score(doc=2754,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = 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.6666667 = coord(2/3)

Date

1. 2.2016 18:25:22

0.100648284 = product of:
  0.15097243 = sum of:
    0.09994029 = weight(_text_:query in 3294) [ClassicSimilarity], result of:
      0.09994029 = score(doc=3294,freq=4.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.43571556 = fieldWeight in 3294, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.046875 = fieldNorm(doc=3294)
    0.051032126 = product of:
      0.10206425 = sum of:
        0.10206425 = weight(_text_:page in 3294) [ClassicSimilarity], result of:
          0.10206425 = score(doc=3294,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.37026453 = fieldWeight in 3294, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.046875 = fieldNorm(doc=3294)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

This study focuses on the impact of age, prior domain knowledge and cognitive abilities on performance, query production and navigation strategies during information searching. Twenty older adults and nineteen young adults had to answer 12 information search problems of varying nature within two domain knowledge: health and manga. In each domain, participants had to perform two simple fact-finding problems (keywords provided and answer directly accessible on the search engine results page), two difficult fact-finding problems (keywords had to be inferred) and two open-ended information search problems (multiple answers possible and navigation necessary). Results showed that prior domain knowledge helped older adults improve navigation (i.e. reduced the number of webpages visited and thus decreased the feeling of disorientation), query production and reformulation (i.e. they formulated semantically more specific queries, and they inferred a greater number of new keywords).

0.09894903 = product of:
  0.14842354 = sum of:
    0.1367221 = weight(_text_:query in 1633) [ClassicSimilarity], result of:
      0.1367221 = score(doc=1633,freq=22.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5960754 = fieldWeight in 1633, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.02734375 = fieldNorm(doc=1633)
    0.011701428 = product of:
      0.023402857 = sum of:
        0.023402857 = weight(_text_:22 in 1633) [ClassicSimilarity], result of:
          0.023402857 = score(doc=1633,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = 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)
  0.6666667 = coord(2/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.09893282 = product of:
  0.14839922 = sum of:
    0.13168289 = weight(_text_:query in 1177) [ClassicSimilarity], result of:
      0.13168289 = score(doc=1177,freq=10.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5741056 = fieldWeight in 1177, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1177)
    0.016716326 = product of:
      0.03343265 = sum of:
        0.03343265 = weight(_text_:22 in 1177) [ClassicSimilarity], result of:
          0.03343265 = score(doc=1177,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.19345059 = fieldWeight in 1177, 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=1177)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Search engine users typically engage in multiquery sessions in their quest to fulfill their information needs. Despite a plethora of research findings suggesting that a significant group of users look for information within a specific geographical scope, existing reformulation studies lack a focused analysis of how users reformulate geographic queries. This study comprehensively investigates the ways in which users reformulate such needs in an attempt to fill this gap in the literature. Reformulated sessions were sampled from a query log of a major search engine to extract 2,400 entries that were manually inspected to filter geo sessions. This filter identified 471 search sessions that included geographical intent, and these sessions were analyzed quantitatively and qualitatively. The results revealed that one in five of the users who reformulated their queries were looking for geographically related information. They reformulated their queries by changing the content of the query rather than the structure. Users were not following a unified sequence of modifications and instead performed a single reformulation action. However, in some cases it was possible to anticipate their next move. A number of tasks in geo modifications were identified, including standard, multi-needs, multi-places, and hybrid approaches. The research concludes that it is important to specialize query reformulation studies to focus on particular query types rather than generically analyzing them, as it is apparent that geographic queries have their special reformulation characteristics.

Date

26. 1.2014 18:48:22

0.09893282 = product of:
  0.14839922 = sum of:
    0.13168289 = weight(_text_:query in 1343) [ClassicSimilarity], result of:
      0.13168289 = score(doc=1343,freq=10.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5741056 = fieldWeight in 1343, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1343)
    0.016716326 = product of:
      0.03343265 = sum of:
        0.03343265 = weight(_text_:22 in 1343) [ClassicSimilarity], result of:
          0.03343265 = score(doc=1343,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = 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)
  0.6666667 = coord(2/3)

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.09561701 = product of:
  0.14342551 = sum of:
    0.08328357 = weight(_text_:query in 498) [ClassicSimilarity], result of:
      0.08328357 = score(doc=498,freq=4.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.3630963 = fieldWeight in 498, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=498)
    0.060141932 = product of:
      0.120283864 = sum of:
        0.120283864 = weight(_text_:page in 498) [ClassicSimilarity], result of:
          0.120283864 = score(doc=498,freq=4.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.4363609 = fieldWeight in 498, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.0390625 = fieldNorm(doc=498)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Search engines are essential tools for web users today. They rely on a large number of features to compute the rank of search results for each given query. The estimated reputation of pages is among the effective features available for search engine designers, probably being adopted by most current commercial search engines. Page reputation is estimated by analyzing the linkage relationships between pages. This information is used by link analysis algorithms as a query-independent feature, to be taken into account when computing the rank of the results. Unfortunately, several types of links found on the web may damage the estimated page reputation and thus cause a negative effect on the quality of search results. This work studies alternatives to reduce the negative impact of such noisy links. More specifically, the authors propose and evaluate new methods that deal with noisy links, considering scenarios where the reputation of pages is computed using the PageRank algorithm. They show, through experiments with real web content, that their methods achieve significant improvements when compared to previous solutions proposed in the literature.

0.09460085 = product of:
  0.14190127 = sum of:
    0.047112305 = weight(_text_:query in 1628) [ClassicSimilarity], result of:
      0.047112305 = score(doc=1628,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.20539828 = fieldWeight in 1628, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.03125 = fieldNorm(doc=1628)
    0.09478896 = sum of:
      0.06804284 = weight(_text_:page in 1628) [ClassicSimilarity], result of:
        0.06804284 = score(doc=1628,freq=2.0), product of:
          0.27565226 = queryWeight, product of:
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.049352113 = queryNorm
          0.24684301 = fieldWeight in 1628, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.03125 = fieldNorm(doc=1628)
      0.026746122 = weight(_text_:22 in 1628) [ClassicSimilarity], result of:
        0.026746122 = score(doc=1628,freq=2.0), product of:
          0.1728227 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049352113 = queryNorm
          0.15476047 = fieldWeight in 1628, 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=1628)
  0.6666667 = coord(2/3)

Abstract

Purpose - The purpose of this paper is to propose the Collaborative Search System that attempts to achieve collaboration by implicitly identifying and reflecting search behaviour of collaborators in an academic network that is automatically and dynamically formed. By using the constructed Collaborative Hit Matrix (CHM), results are obtained that are based on the search behaviour and earned preferences of specialist communities of researchers, which are relevant to the user's need and reduce the time spent on bad links. Design/methodology/approach - By using the Digital Bibliography Library Project (DBLP), the research communities are formed implicitly and dynamically based on the users' research presence in the search environment and in the publication scenario, which is also used to assign users' roles and establish links between the users. The CHM, to store the hit count and hit list of page results for queries, is also constructed and updated after every search session to enhance the collaborative search among the researchers. Findings - The implicit researchers community formation, the assignment and dynamic updating of roles of the researchers based on research, search presence and search behaviour on the web as well as the usage of these roles during Collaborative Web Search have highly improved the relevancy of results. The CHM that holds the collaborative responses provided by the researchers on the search query results to support searching distinguishes this system from others. Thus the proposed system considerably improves the relevancy and reduces the time spent on bad links, thus improving recall and precision. Originality/value - The research findings illustrate the better performance of the system, by connecting researchers working in the same field and allowing them to help each other in a web search environment.

Date

20. 1.2015 18:30:22

0.093333244 = product of:
  0.13999987 = sum of:
    0.116597004 = weight(_text_:query in 2651) [ClassicSimilarity], result of:
      0.116597004 = score(doc=2651,freq=4.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5083348 = fieldWeight in 2651, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2651)
    0.023402857 = product of:
      0.046805713 = sum of:
        0.046805713 = weight(_text_:22 in 2651) [ClassicSimilarity], result of:
          0.046805713 = score(doc=2651,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.2708308 = fieldWeight in 2651, 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=2651)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

All text is ephemeral. Some texts are more ephemeral than others. The web has proved to be among the most ephemeral and changing of information vehicles. The research note revisits Koehler's original data set after about 20 years since it was first collected. By late 2013, the number of URLs responding to a query had fallen to 1.6% of the original sample. A query of the 6 remaining URLs in February 2015 showed only 2 still responding.

Date

22. 1.2016 14:37:14

0.08966473 = product of:
  0.13449709 = sum of:
    0.11778076 = weight(_text_:query in 4189) [ClassicSimilarity], result of:
      0.11778076 = score(doc=4189,freq=8.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5134957 = fieldWeight in 4189, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4189)
    0.016716326 = product of:
      0.03343265 = sum of:
        0.03343265 = weight(_text_:22 in 4189) [ClassicSimilarity], result of:
          0.03343265 = score(doc=4189,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.19345059 = fieldWeight in 4189, 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=4189)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Effective patent management is essential for organizations to maintain their competitive advantage. The classification of patents is a critical part of patent management and industrial analysis. This study proposes a hybrid-patent-classification approach that combines a novel patent-network-based classification method with three conventional classification methods to analyze query patents and predict their classes. The novel patent network contains various types of nodes that represent different features extracted from patent documents. The nodes are connected based on the relationship metrics derived from the patent metadata. The proposed classification method predicts a query patent's class by analyzing all reachable nodes in the patent network and calculating their relevance to the query patent. It then classifies the query patent with a modified k-nearest neighbor classifier. To further improve the approach, we combine it with content-based, citation-based, and metadata-based classification methods to develop a hybrid-classification approach. We evaluate the performance of the hybrid approach on a test dataset of patent documents obtained from the U.S. Patent and Trademark Office, and compare its performance with that of the three conventional methods. The results demonstrate that the proposed patent-network-based approach yields more accurate class predictions than the patent network-based approach.

Date

22. 1.2011 13:04:21

0.079354875 = product of:
  0.11903231 = sum of:
    0.05889038 = weight(_text_:query in 2674) [ClassicSimilarity], result of:
      0.05889038 = score(doc=2674,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.25674784 = fieldWeight in 2674, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2674)
    0.060141932 = product of:
      0.120283864 = sum of:
        0.120283864 = weight(_text_:page in 2674) [ClassicSimilarity], result of:
          0.120283864 = score(doc=2674,freq=4.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.4363609 = fieldWeight in 2674, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2674)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Temporal aspects have been receiving a great deal of interest in Information Retrieval and related fields. Although previous studies have proposed, designed and implemented temporal-aware systems and solutions, understanding of people's temporal information searching behaviour is still limited. This paper reports the findings of a user study that explored temporal information searching behaviour and strategies in a laboratory setting. Information needs were grouped into three temporal classes (Past, Recency, and Future) to systematically study their characteristics. The main findings of our experiment are as follows. (1) It is intuitive for people to augment topical keywords with temporal expressions such as history, recent, or future as a tactic of temporal search. (2) However, such queries produce mixed results and the success of query reformulations appears to depend on topics to a large extent. (3) Search engine interfaces should detect temporal information needs to trigger the display of temporal search options. (4) Finding a relevant Wikipedia page or similar summary page is a popular starting point of past information needs. (5) Current search engines do a good job for information needs related to recent events, but more work is needed for past and future tasks. (6) Participants found it most difficult to find future information. Searching for domain experts was a key tactic in Future search, and file types of relevant documents are different from other temporal classes. Overall, the comparison of search across temporal classes indicated that Future search was the most difficult and the least successful followed by the search for the Past and then for Recency information. This paper discusses the implications of these findings on the design of future temporal IR systems

0.07914498 = product of:
  0.11871746 = sum of:
    0.10200114 = weight(_text_:query in 1623) [ClassicSimilarity], result of:
      0.10200114 = score(doc=1623,freq=6.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.44470036 = fieldWeight in 1623, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1623)
    0.016716326 = product of:
      0.03343265 = sum of:
        0.03343265 = weight(_text_:22 in 1623) [ClassicSimilarity], result of:
          0.03343265 = score(doc=1623,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.19345059 = fieldWeight in 1623, 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=1623)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Purpose - Previous work highlights two key challenges in searching for information about individual entities (such as persons, places and organisations) over semantic data: query ambiguity and redundant attributes. The purpose of this paper is to consider these challenges and proposes the Attribute Importance Model (AIM) for clustering and ranking aggregated entity search to improve the overall users' experience of finding and navigating entities over the Web of Data. Design/methodology/approach - The proposed model describes three distinct techniques for augmenting semantic search: first, presenting entity type-based query suggestions; second, clustering aggregated attributes; and third, ranking attributes based on their importance to a given query. To evaluate the model, 36 subjects were recruited to experience entity search with and without AIM. Findings - The experimental results show that the model achieves significant improvements over the default method of semantic aggregated search provided by Sig.ma, a leading entity search and navigation tool. Originality/value - This proposal develops more informative views for aggregated entity search and exploration to enhance users' understanding of semantic data. The user study is the first to evaluate user interaction with Sig.ma's search capabilities in a systematic way.

Date

20. 1.2015 18:30:22