Search (297 results, page 1 of 15)

0.1896001 = product of:
  0.28440014 = sum of:
    0.09994029 = weight(_text_:query in 5278) [ClassicSimilarity], result of:
      0.09994029 = score(doc=5278,freq=4.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.43571556 = fieldWeight in 5278, 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=5278)
    0.18445984 = sum of:
      0.14434065 = weight(_text_:page in 5278) [ClassicSimilarity], result of:
        0.14434065 = score(doc=5278,freq=4.0), product of:
          0.27565226 = queryWeight, product of:
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.049352113 = queryNorm
          0.5236331 = fieldWeight in 5278, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.046875 = fieldNorm(doc=5278)
      0.040119182 = weight(_text_:22 in 5278) [ClassicSimilarity], result of:
        0.040119182 = score(doc=5278,freq=2.0), product of:
          0.1728227 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049352113 = queryNorm
          0.23214069 = fieldWeight in 5278, 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=5278)
  0.6666667 = coord(2/3)

Abstract

Most Web search tools integrate sponsored results with results from their internal editorial database in providing results to users. The goal of this research is to get a better idea of how much of the screen real estate displays real editorial results as compared to sponsored results. The overall average results are that 40% of all results presented on the first screen are real results, and when the entire first Web page is considered, 67% of the results are nonsponsored results. For general search tools such as Google, 56% of the first screen and 82% of the first Web page contain nonsponsored results. Other results include that query structure makes a significant difference in the percentage of nonsponsored results returned by a search. Similarly, the topic of the query also can have a significant effect on the percentage of sponsored results displayed by most Web search tools.

Date

22. 7.2006 16:32:57

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.12788323 = product of:
  0.19182482 = sum of:
    0.13168289 = weight(_text_:query in 1081) [ClassicSimilarity], result of:
      0.13168289 = score(doc=1081,freq=10.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.5741056 = fieldWeight in 1081, 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=1081)
    0.060141932 = product of:
      0.120283864 = sum of:
        0.120283864 = weight(_text_:page in 1081) [ClassicSimilarity], result of:
          0.120283864 = score(doc=1081,freq=4.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.4363609 = fieldWeight in 1081, 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=1081)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The aim of the work described in this paper is to evaluate the influencing effects of query-biased summaries in web searching. For this purpose, a summarisation system has been developed, and a summary tailored to the user's query is generated automatically for each document retrieved. The system aims to provide both a better means of assessing document relevance than titles or abstracts typical of many web search result lists. Through visiting each result page at retrieval-time, the system provides the user with an idea of the current page content and thus deals with the dynamic nature of the web. To examine the effectiveness of this approach, a task-oriented, comparative evaluation between four different web retrieval systems was performed; two that use query-biased summarisation, and two that use the standard ranked titles/abstracts approach. The results from the evaluation indicate that query-biased summarisation techniques appear to be more useful and effective in helping users gauge document relevance than the traditional ranked titles/abstracts approach. The same methodology was used to compare the effectiveness of two of the web's major search engines; AltaVista and Google.

0.124703124 = product of:
  0.18705468 = sum of:
    0.10200114 = weight(_text_:query in 6104) [ClassicSimilarity], result of:
      0.10200114 = score(doc=6104,freq=6.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.44470036 = fieldWeight in 6104, 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=6104)
    0.08505354 = product of:
      0.17010708 = sum of:
        0.17010708 = weight(_text_:page in 6104) [ClassicSimilarity], result of:
          0.17010708 = score(doc=6104,freq=8.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.6171075 = fieldWeight in 6104, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6104)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The World Wide Web has become one of our more important information sources, and commercial search engines are the major tools for locating information; however, it is not enough for a Web page to be indexed by the search engines-it also must rank high on relevant queries. One of the parameters involved in ranking is the number and quality of links pointing to the page, based on the assumption that links convey appreciation for a page. This article presents the results of a content analysis of the links to two top pages retrieved by Google for the query "jew" as of July 2004: the "jew" entry on the free online encyclopedia Wikipedia, and the home page of "Jew Watch," a highly anti-Semitic site. The top results for the query "jew" gained public attention in April 2004, when it was noticed that the "Jew Watch" homepage ranked number 1. From this point on, both sides engaged in "Googlebombing" (i.e., increasing the number of links pointing to these pages). The results of the study show that most of the links to these pages come from blogs and discussion links, and the number of links pointing to these pages in appreciation of their content is extremely small. These findings have implications for ranking algorithms based on link counts, and emphasize the huge difference between Web links and citations in the scientific community.

0.11871937 = product of:
  0.17807905 = sum of:
    0.15801947 = weight(_text_:query in 2674) [ClassicSimilarity], result of:
      0.15801947 = score(doc=2674,freq=10.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.68892676 = fieldWeight in 2674, 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=2674)
    0.020059591 = product of:
      0.040119182 = sum of:
        0.040119182 = weight(_text_:22 in 2674) [ClassicSimilarity], result of:
          0.040119182 = score(doc=2674,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.23214069 = fieldWeight in 2674, 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=2674)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The WebQuery system offers a powerful new method for searching the Web based on connectivity and content. Examines links among the nodes returned in a keyword-based query. Rankes the nodes, giving the highest rank to the most highly connected nodes. By doing so, finds hot spots on the Web that contain information germane to a user's query. WebQuery not only ranks and filters the results of a Web query; it also extends the result set beyond what the search engine retrieves, by finding interesting sites that are highly connected to those sites returned by the original query. Even with WebQuery filering and ranking query results, the result set can be enormous. Explores techniques for visualizing the returned information and discusses the criteria for using each of the technique

Date

1. 8.1996 22:08:06

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.1081783 = product of:
  0.16226745 = sum of:
    0.09422461 = weight(_text_:query in 5785) [ClassicSimilarity], result of:
      0.09422461 = score(doc=5785,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.41079655 = fieldWeight in 5785, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0625 = fieldNorm(doc=5785)
    0.06804284 = product of:
      0.13608567 = sum of:
        0.13608567 = weight(_text_:page in 5785) [ClassicSimilarity], result of:
          0.13608567 = score(doc=5785,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.49368602 = fieldWeight in 5785, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.0625 = fieldNorm(doc=5785)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Provides a glossary of Internet search terms. Outlines a number of network retrieval tools and directories: Netscape's Internet search page, W3 search engines, Lycos, WebCrawler, InfoSeek, Yahoo, and CERN's Net Directory. Gices an example of how the Internet can be used to answer a reference query and the types of materials that can be retrieved

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.10378559 = product of:
  0.31135675 = sum of:
    0.31135675 = sum of:
      0.2357073 = weight(_text_:page in 3601) [ClassicSimilarity], result of:
        0.2357073 = score(doc=3601,freq=6.0), product of:
          0.27565226 = queryWeight, product of:
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.049352113 = queryNorm
          0.8550893 = fieldWeight in 3601, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.0625 = fieldNorm(doc=3601)
      0.075649455 = weight(_text_:22 in 3601) [ClassicSimilarity], result of:
        0.075649455 = score(doc=3601,freq=4.0), product of:
          0.1728227 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049352113 = queryNorm
          0.4377287 = fieldWeight in 3601, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0625 = fieldNorm(doc=3601)
  0.33333334 = coord(1/3)

Abstract

Explains how 5 Internet search engines (AltaVista, HotBot, InfoSeek, Lycos, and Yahoo) handle field searching. Includes a chart which identifies where on a search engine's page a particular field is searched and the prefix syntax used, and gives examples. Details the individual fields that can be searched: data, title, URL, images, audiovideo and other page content, links and page depth

Source

Online. 22(1998) no.3, S.18-22

0.100648284 = product of:
  0.15097243 = sum of:
    0.09994029 = weight(_text_:query in 1060) [ClassicSimilarity], result of:
      0.09994029 = score(doc=1060,freq=4.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.43571556 = fieldWeight in 1060, 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=1060)
    0.051032126 = product of:
      0.10206425 = sum of:
        0.10206425 = weight(_text_:page in 1060) [ClassicSimilarity], result of:
          0.10206425 = score(doc=1060,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.37026453 = fieldWeight in 1060, 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=1060)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

This paper talks about several schemes for improving retrieval effectiveness that can be used in the named page finding tasks of web information retrieval (Overview of the TREC-2002 web track. In: Proceedings of the Eleventh Text Retrieval Conference TREC-2002, NIST Special Publication #500-251, 2003). These methods were applied on top of the basic information retrieval model as additional mechanisms to upgrade the system. Use of the title of web pages was found to be effective. It was confirmed that anchor texts of incoming links was beneficial as suggested in other works. Sentence-query similarity is a new type of information proposed by us and was identified to be the best information to take advantage of. Stratifying and re-ranking the retrieval list based on the maximum count of index terms in common between a sentence and a query resulted in significant improvement of performance. To demonstrate these facts a large-scale web information retrieval system was developed and used for experimentation.

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.096351944 = product of:
  0.14452791 = sum of:
    0.10200114 = weight(_text_:query in 607) [ClassicSimilarity], result of:
      0.10200114 = score(doc=607,freq=6.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.44470036 = fieldWeight in 607, 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=607)
    0.04252677 = product of:
      0.08505354 = sum of:
        0.08505354 = weight(_text_:page in 607) [ClassicSimilarity], result of:
          0.08505354 = score(doc=607,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.30855376 = fieldWeight in 607, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.0390625 = fieldNorm(doc=607)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Understanding what kinds of Web pages are the most useful for Web search engine users is a critical task in Web information retrieval (IR). Most previous works used hyperlink analysis algorithms to solve this problem. However, little research has been focused on query-independent Web data cleansing for Web IR. In this paper, we first provide analysis of the differences between retrieval target pages and ordinary ones based on more than 30 million Web pages obtained from both the Text Retrieval Conference (TREC) and a widely used Chinese search engine, SOGOU (www.sogou.com). We further propose a learning-based data cleansing algorithm for reducing Web pages that are unlikely to be useful for user requests. We found that there exists a large proportion of low-quality Web pages in both the English and the Chinese Web page corpus, and retrieval target pages can be identified using query-independent features and cleansing algorithms. The experimental results showed that our algorithm is effective in reducing a large portion of Web pages with a small loss in retrieval target pages. It makes it possible for Web IR tools to meet a large fraction of users' needs with only a small part of pages on the Web. These results may help Web search engines make better use of their limited storage and computation resources to improve search performance.

0.096351944 = product of:
  0.14452791 = sum of:
    0.10200114 = weight(_text_:query in 978) [ClassicSimilarity], result of:
      0.10200114 = score(doc=978,freq=6.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.44470036 = fieldWeight in 978, 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=978)
    0.04252677 = product of:
      0.08505354 = sum of:
        0.08505354 = weight(_text_:page in 978) [ClassicSimilarity], result of:
          0.08505354 = score(doc=978,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.30855376 = fieldWeight in 978, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.0390625 = fieldNorm(doc=978)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

To improve search engine effectiveness, we have observed an increased interest in gathering additional feedback about users' information needs that goes beyond the queries they type in. Adaptive search engines use explicit and implicit feedback indicators to model users or search tasks. In order to create appropriate models, it is essential to understand how users interact with search engines, including the determining factors of their actions. Using eye tracking, we extend this understanding by analyzing the sequences and patterns with which users evaluate query result returned to them when using Google. We find that the query result abstracts are viewed in the order of their ranking in only about one fifth of the cases, and only an average of about three abstracts per result page are viewed at all. We also compare search behavior variability with respect to different classes of users and different classes of search tasks to reveal whether user models or task models may be greater predictors of behavior. We discover that gender and task significantly influence different kinds of search behaviors discussed here. The results are suggestive of improvements to query-based search interface designs with respect to both their use of space and workflow.

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.09465601 = product of:
  0.14198402 = sum of:
    0.08244653 = weight(_text_:query in 5033) [ClassicSimilarity], result of:
      0.08244653 = score(doc=5033,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.35944697 = fieldWeight in 5033, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5033)
    0.05953748 = product of:
      0.11907496 = sum of:
        0.11907496 = weight(_text_:page in 5033) [ClassicSimilarity], result of:
          0.11907496 = score(doc=5033,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.43197528 = 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.0546875 = fieldNorm(doc=5033)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Object

Multithreaded query page

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

Abstract

Presents Inquirus, a WWW meta search engine which works by downloading and analysing the individual documents. It makes improvements over existing search engines in a number of areas: more useful document summaries incorporating query term context, identification of both pages which no longer exist and pages which no longer contain the query terms, advanced detection of duplicate pages, improved document ranking using proximity information, dramatically improved precision for certain queries by using specific expressive forms, and quick jump links and highlighting when viewing the full document

Date

1. 8.1996 22:08:06

0.08647631 = product of:
  0.12971446 = sum of:
    0.08160091 = weight(_text_:query in 6980) [ClassicSimilarity], result of:
      0.08160091 = score(doc=6980,freq=6.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.35576028 = fieldWeight in 6980, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.03125 = fieldNorm(doc=6980)
    0.048113547 = product of:
      0.096227095 = sum of:
        0.096227095 = weight(_text_:page in 6980) [ClassicSimilarity], result of:
          0.096227095 = score(doc=6980,freq=4.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.34908873 = fieldWeight in 6980, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.03125 = fieldNorm(doc=6980)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

In previous articles, we reported the state of Web searching in 1997 (Jansen, Spink, & Saracevic, 2000) and in 1999 (Spink, Wolfram, Jansen, & Saracevic, 2001). Such snapshot studies and statistics on Web use appear regularly (OCLC, 1999), but provide little information about Web searching trends. In this article, we compare and contrast results from our two previous studies of Excite queries' data sets, each containing over 1 million queries submitted by over 200,000 Excite users collected on 16 September 1997 and 20 December 1999. We examine how public Web searching changing during that 2-year time period. As Table 1 shows, the overall structure of Web queries in some areas did not change, while in others we see change from 1997 to 1999. Our comparison shows how Web searching changed incrementally and also dramatically. We see some moves toward greater simplicity, including shorter queries (i.e., fewer terms) and shorter sessions (i.e., fewer queries per user), with little modification (addition or deletion) of terms in subsequent queries. The trend toward shorter queries suggests that Web information content should target specific terms in order to reach Web users. Another trend was to view fewer pages of results per query. Most Excite users examined only one page of results per query, since an Excite results page contains ten ranked Web sites. Were users satisfied with the results and did not need to view more pages? It appears that the public continues to have a low tolerance of wading through retrieved sites. This decline in interactivity levels is a disturbing finding for the future of Web searching. Queries that included Boolean operators were in the minority, but the percentage increased between the two time periods. Most Boolean use involved the AND operator with many mistakes. The use of relevance feedback almost doubled from 1997 to 1999, but overall use was still small. An unusually large number of terms were used with low frequency, such as personal names, spelling errors, non-English words, and Web-specific terms, such as URLs. Web query vocabulary contains more words than found in large English texts in general. The public language of Web queries has its own and unique characteristics. How did Web searching topics change from 1997 to 1999? We classified a random sample of 2,414 queries from 1997 and 2,539 queries from 1999 into 11 categories (Table 2). From 1997 to 1999, Web searching shifted from entertainment, recreation and sex, and pornography, preferences to e-commerce-related topics under commerce, travel, employment, and economy. This shift coincided with changes in information distribution on the publicly indexed Web.

0.08647631 = product of:
  0.12971446 = sum of:
    0.08160091 = weight(_text_:query in 2567) [ClassicSimilarity], result of:
      0.08160091 = score(doc=2567,freq=6.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.35576028 = fieldWeight in 2567, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.03125 = fieldNorm(doc=2567)
    0.048113547 = product of:
      0.096227095 = sum of:
        0.096227095 = weight(_text_:page in 2567) [ClassicSimilarity], result of:
          0.096227095 = score(doc=2567,freq=4.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.34908873 = fieldWeight in 2567, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.03125 = fieldNorm(doc=2567)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

As the Web continues to grow and encompass broader and more diverse sources of information, providing effective search facilities to users becomes an increasingly challenging problem. To help users deal with the deluge of Web-accessible information, we propose a search system which makes use of context to improve search results in a scalable way. By context, we mean any sources of information, in addition to any search query, that provide clues about the user's true information need. For instance, a user's bookmarks and search history can be considered a part of the search context. We consider two types of context-based search. The first type of functionality we consider is "similarity search." In this case, as the user is browsing Web pages, URLs for pages similar to the current page are retrieved and displayed in a side panel. No query is explicitly issued; context alone (i.e., the page currently being viewed) is used to provide the user with useful related information. The second type of functionality involves taking search context into account when ranking results to standard search queries. Web search differs from traditional information retrieval tasks in several major ways, making effective context-sensitive Web search challenging. First, scalability is of critical importance. With billions of publicly accessible documents, the Web is much larger than traditional datasets. Similarly, with millions of search queries issued each day, the query load is much higher than for traditional information retrieval systems. Second, there are no guarantees on the quality ofWeb pages, with Web-authors taking an adversarial, rather than cooperative, approach in attempts to inflate the rankings of their pages. Third, there is a significant amount of metadata embodied in the link structure corresponding to the hyperlinks between Web pages that can be exploitedduring the retrieval process. In this thesis, we design a search system, using the Stanford WebBase platform, that exploits the link structure of the Web to provide scalable, context-sensitive search.

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

Abstract

Web searchers typically fall to view search results beyond the first page nor fully examine those results presented to them. In this article we describe an approach that encourages a deeper examination of the contents of the document set retrieved in response to a searcher's query. The approach shifts the focus of perusal and interaction away from potentially uninformative document surrogates (such as titles, sentence fragments, and URLs) to actual document content, and uses this content to drive the information seeking process. Current search interfaces assume searchers examine results document-by-document. In contrast our approach extracts, ranks, and presents the contents of the top-ranked document set. We use query-relevant topranking sentences extracted from the top documents at retrieval time as fine-grained representations of topranked document content and, when combined in a ranked list, an overview of these documents. The interaction of the searcher provides implicit evidence that is used to reorder the sentences where appropriate. We evaluate our approach in three separate user studies, each applying these sentences in a different way. The findings of these studies show that top-ranking sentences can facilitate effective information access.