Search (179 results, page 1 of 9)

0.0762796 = product of:
  0.1144194 = sum of:
    0.09732476 = weight(_text_:interest in 2565) [ClassicSimilarity], result of:
      0.09732476 = score(doc=2565,freq=4.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.38814518 = fieldWeight in 2565, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2565)
    0.017094642 = product of:
      0.034189284 = sum of:
        0.034189284 = weight(_text_:22 in 2565) [ClassicSimilarity], result of:
          0.034189284 = score(doc=2565,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.19345059 = fieldWeight in 2565, 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=2565)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

This paper introduces a family of link-based ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ranking function of this family. The main objective of this paper is to determine whether this family of ranking techniques has some interest per se, and how different choices for the damping function impact on rank quality and on convergence speed. Even though our results suggest that PageRank can be approximated with other simpler forms of rankings that may be computed more efficiently, our focus is of more speculative nature, in that it aims at separating the kernel of PageRank, that is, link-based importance propagation, from the way propagation decays over paths. We focus on three damping functions, having linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. Our presentation includes algorithms, analysis, comparisons and experiments that study their behavior under different parameters in real Web graph data. Among other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to PageRank's using a fixed small number of iterations; comparisons were performed using Kendall's tau on large domain datasets.

Date

16. 1.2016 10:22:28

Source

http://chato.cl/papers/baeza06_general_pagerank_damping_functions_link_ranking.pdf [Proceedings of the ACM Special Interest Group on Information Retrieval (SIGIR) Conference, SIGIR'06, August 6-10, 2006, Seattle, Washington, USA]

0.06873091 = product of:
  0.103096366 = sum of:
    0.082582794 = weight(_text_:interest in 5228) [ClassicSimilarity], result of:
      0.082582794 = score(doc=5228,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.3293521 = fieldWeight in 5228, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=5228)
    0.02051357 = product of:
      0.04102714 = sum of:
        0.04102714 = weight(_text_:22 in 5228) [ClassicSimilarity], result of:
          0.04102714 = score(doc=5228,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.23214069 = fieldWeight in 5228, 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=5228)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Bilal, in this third part of her Yahooligans! study looks at children's performance with self-generated search tasks, as compared to previously assigned search tasks looking for differences in success, cognitive behavior, physical behavior, and task preference. Lotus ScreenCam was used to record interactions and post search interviews to record impressions. The subjects, the same 22 seventh grade children in the previous studies, generated topics of interest that were mediated with the researcher into more specific topics where necessary. Fifteen usable sessions form the basis of the study. Eleven children were successful in finding information, a rate of 73% compared to 69% in assigned research questions, and 50% in assigned fact-finding questions. Eighty-seven percent began using one or two keyword searches. Spelling was a problem. Successful children made fewer keyword searches and the number of search moves averaged 5.5 as compared to 2.4 on the research oriented task and 3.49 on the factual. Backtracking and looping were common. The self-generated task was preferred by 47% of the subjects.

0.06873091 = product of:
  0.103096366 = sum of:
    0.082582794 = weight(_text_:interest in 108) [ClassicSimilarity], result of:
      0.082582794 = score(doc=108,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.3293521 = fieldWeight in 108, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=108)
    0.02051357 = product of:
      0.04102714 = sum of:
        0.04102714 = weight(_text_:22 in 108) [ClassicSimilarity], result of:
          0.04102714 = score(doc=108,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.23214069 = fieldWeight in 108, 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=108)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The explosion of the information available on the Internet has made traditional information retrieval systems, characterized by one size fits all approaches, less effective. Indeed, users are overwhelmed by the information delivered by such systems in response to their queries, particularly when the latter are ambiguous. In order to tackle this problem, the state-of-the-art reveals that there is a growing interest towards contextual information retrieval (CIR) which relies on various sources of evidence issued from the user's search background and environment, in order to improve the retrieval accuracy. This chapter focuses on mobile context, highlights challenges they present for IR, and gives an overview of CIR approaches applied in this environment. Then, the authors present an approach to personalize search results for mobile users by exploiting both cognitive and spatio-temporal contexts. The experimental evaluation undertaken in front of Yahoo search shows that the approach improves the quality of top search result lists and enhances search result precision.

Date

20. 4.2012 13:19:22

0.03881132 = product of:
  0.11643395 = sum of:
    0.11643395 = sum of:
      0.06856895 = weight(_text_:classification in 1673) [ClassicSimilarity], result of:
        0.06856895 = score(doc=1673,freq=6.0), product of:
          0.16072905 = queryWeight, product of:
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.05046903 = queryNorm
          0.42661208 = fieldWeight in 1673, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1673)
      0.047864996 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
        0.047864996 = score(doc=1673,freq=2.0), product of:
          0.17673394 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05046903 = queryNorm
          0.2708308 = fieldWeight in 1673, 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=1673)
  0.33333334 = coord(1/3)

Abstract

The Wolverhampton Web Library (WWLib) is a WWW search engine that provides access to UK based information. The experimental version developed in 1995, was a success but highlighted the need for a much higher degree of automation. An interesting feature of the experimental WWLib was that it organised information according to DDC. Discusses the advantages of classification and describes the automatic classifier that is being developed in Java as part of the new, fully automated WWLib

Date

1. 8.1996 22:08:06

0.036703467 = product of:
  0.110110395 = sum of:
    0.110110395 = weight(_text_:interest in 3524) [ClassicSimilarity], result of:
      0.110110395 = score(doc=3524,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.43913615 = fieldWeight in 3524, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.0625 = fieldNorm(doc=3524)
  0.33333334 = coord(1/3)

Abstract

Lists search engines in Internet, covering wide areas of interest

0.033315543 = product of:
  0.099946626 = sum of:
    0.099946626 = sum of:
      0.045243774 = weight(_text_:classification in 4869) [ClassicSimilarity], result of:
        0.045243774 = score(doc=4869,freq=2.0), product of:
          0.16072905 = queryWeight, product of:
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.05046903 = queryNorm
          0.28149095 = fieldWeight in 4869, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.0625 = fieldNorm(doc=4869)
      0.054702852 = weight(_text_:22 in 4869) [ClassicSimilarity], result of:
        0.054702852 = score(doc=4869,freq=2.0), product of:
          0.17673394 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05046903 = queryNorm
          0.30952093 = fieldWeight in 4869, 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=4869)
  0.33333334 = coord(1/3)

Abstract

This article gives an overview of the design and organisation of DutchESS, a Dutch information subject gateway created as a national collaborative effort of the National Library and a number of academic libraries. The combined centralised and distributed model of DutchESS is discussed, as well as its selection policy, its metadata format, classification scheme and retrieval options. Also some options for future collaboration on an international level are explored

Date

22. 6.2002 19:39:23

0.031786136 = product of:
  0.0953584 = sum of:
    0.0953584 = weight(_text_:interest in 5167) [ClassicSimilarity], result of:
      0.0953584 = score(doc=5167,freq=6.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.38030308 = fieldWeight in 5167, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.03125 = fieldNorm(doc=5167)
  0.33333334 = coord(1/3)

Abstract

In this issue Ford, Miller and Moss utilize 68 volunteers from a population of 250 Master's students to complete on the web three search tasks with clear fact based goals and three or less facets. One task required broadening the search concepts from those given, a second provided a specific terminology for one facet but required a second facet that would require translation, and the third required general to specific transformation. The students were measured as to their performance on Entewistle's Revised Inventory of Approaches to Studying providing values for ten study variables and asked to assess their experience on the Internet, with Alta Vista, and with Boolean search. Searches were conducted on Alta Vista using Netscape Navigator 4 with participants free to choose and switch Boolean, best match or combined search modes at will while a front end script recorded all submitted searches and help access. Search related variables extracted were from Boolean only queries, best match only queries, and combined queries. Factor analyses were conducted on all variables for each search mode for each search. In task one Boolean is differentiated from best match search by sharing high loads on active interest, intention to reproduce, fear of failure, and relating ideas. The combined searcher is linked with the best match searcher with low active interest, low intention to reproduce and low fear of failure. In task 2 Boolean is differentiated from best match search by sharing high loads on intention to reproduce and low on intention to understand. Best match loads positively with intention to understand and negatively with intention to reproduce. Combined searching linked with both good and with poor time management. In task 3 the loads mimic task 1. It seems Boolean is consistently linked to a reproductive rather than a meaning seeking approach, but also with high levels of interest and fear of failure. Best match associates with the converse of these measures.

0.0291511 = product of:
  0.0874533 = sum of:
    0.0874533 = sum of:
      0.039588302 = weight(_text_:classification in 3559) [ClassicSimilarity], result of:
        0.039588302 = score(doc=3559,freq=2.0), product of:
          0.16072905 = queryWeight, product of:
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.05046903 = queryNorm
          0.24630459 = fieldWeight in 3559, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.0546875 = fieldNorm(doc=3559)
      0.047864996 = weight(_text_:22 in 3559) [ClassicSimilarity], result of:
        0.047864996 = score(doc=3559,freq=2.0), product of:
          0.17673394 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05046903 = queryNorm
          0.2708308 = fieldWeight in 3559, 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=3559)
  0.33333334 = coord(1/3)

Abstract

Describes the concept of a proxy based information classification and filtering utility, named Web Assistant. On the behalf of users a private view of the WWW is generated based on a previously determined profile. This profile is created by monitoring the user anf group activities when browsing WWW pages. Additional features are integrated to allow for easy interoperability workgroups with similar project interests, maintain personal and common hotlists with automatic modification checks and a sophisticated search engine front-end

Date

1. 8.1996 22:08:06

0.0291511 = product of:
  0.0874533 = sum of:
    0.0874533 = sum of:
      0.039588302 = weight(_text_:classification in 631) [ClassicSimilarity], result of:
        0.039588302 = score(doc=631,freq=2.0), product of:
          0.16072905 = queryWeight, product of:
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.05046903 = queryNorm
          0.24630459 = fieldWeight in 631, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.0546875 = fieldNorm(doc=631)
      0.047864996 = weight(_text_:22 in 631) [ClassicSimilarity], result of:
        0.047864996 = score(doc=631,freq=2.0), product of:
          0.17673394 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05046903 = queryNorm
          0.2708308 = fieldWeight in 631, 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=631)
  0.33333334 = coord(1/3)

Abstract

'Quality-controlled subject gateways' are Internet services which apply a rich set of quality measures to support systematic resource discovery. Considerable manual effort is used to secure a selection of resources which meet quality criteria and to display a rich description of these resources with standards-based metadata. Regular checking and updating ensure good collection management. A main goal is to provide a high quality of subject access through indexing resources using controlled vocabularies and by offering a deep classification structure for advanced searching and browsing. This article provides an initial empirical overview of existing services of this kind, their approaches and technologies, based on proposed working definitions and typologies of subject gateways

Date

22. 6.2002 19:37:55

0.027527599 = product of:
  0.082582794 = sum of:
    0.082582794 = weight(_text_:interest in 5661) [ClassicSimilarity], result of:
      0.082582794 = score(doc=5661,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.3293521 = fieldWeight in 5661, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=5661)
  0.33333334 = coord(1/3)

Abstract

In a series of capsule reviews of 20 search engines Sirapyan gives a good overview of the state of Internet search tools. She starts out with a clear discussion of the types of search tools available, the availability of advanced features such as Boolean queries and differences between directories, regular search engines and metasearch engines. It is unclear from the article whether the author and other testers used the same searches across all of the 20 tools but each review clearly outlines perceived strengths and weaknesses, gives tips on the advanced features, if any, of the search tool in question and suggests the types of searches that are most successful. The tools which receive top honors are Google, Northern Light, HotBot and Oingo. Finally, there is an extra sidebar the discusses meta and specialized search tools such as Infozoid and FirstGov. I can't help thinking that the usefulness of this article is related to the fact that Sirapyan is PC Magazine's librarian and goes into greater depth on those features that are of interest to information professionals

0.027527599 = product of:
  0.082582794 = sum of:
    0.082582794 = weight(_text_:interest in 2536) [ClassicSimilarity], result of:
      0.082582794 = score(doc=2536,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.3293521 = fieldWeight in 2536, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=2536)
  0.33333334 = coord(1/3)

Abstract

Commercial search engines are now playing an increasingly important role in Web information dissemination and access. Of particular interest to business and national governments is whether the big engines have coverage biased towards the US or other countries. In our study we tested for national biases in three major search engines and found significant differences in their coverage of commercial Web sites. The US sites were much better covered than the others in the study: sites from China, Taiwan and Singapore. We then examined the possible technical causes of the differences and found that the language of a site does not affect its coverage by search engines. However, the visibility of a site, measured by the number of links to it, affects its chance to be covered by search engines. We conclude that the coverage bias does exist but this is due not to deliberate choices of the search engines but occurs as a natural result of cumulative advantage effects of US sites on the Web. Nevertheless, the bias remains a cause for international concern.

0.027527599 = product of:
  0.082582794 = sum of:
    0.082582794 = weight(_text_:interest in 852) [ClassicSimilarity], result of:
      0.082582794 = score(doc=852,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.3293521 = fieldWeight in 852, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=852)
  0.33333334 = coord(1/3)

Abstract

Nutch is an open-source Web search engine that can be used at global, local, and even personal scale. Its initial design goal was to enable a transparent alternative for global Web search in the public interest - one of its signature features is the ability to "explain" its result rankings. Recent work has emphasized how it can also be used for intranets; by local communities with richer data models, such as the Creative Commons metadata-enabled search for licensed content; on a personal scale to index a user's files, email, and web-surfing history; and we also report on several other research projects built on Nutch. In this paper, we present how the architecture of the Nutch system enables it to be more flexible and scalable than other comparable systems today.

0.027527599 = product of:
  0.082582794 = sum of:
    0.082582794 = weight(_text_:interest in 1012) [ClassicSimilarity], result of:
      0.082582794 = score(doc=1012,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.3293521 = fieldWeight in 1012, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=1012)
  0.33333334 = coord(1/3)

Abstract

This study examines the effects of the search interface and Boolean logic training on user search performance and satisfaction. We compared the use of an assisted search tool to that of a simple search interface like those typically found at commercial search engine sites. We found that the assisted search tool had a significant positive effect on performance, satisfaction, and confidence. Promoting the use of advanced search features is therefore in the best interest of both Web search providers and users. In the absence of an assisted interface, a simple interface coupled with Boolean logic training was also an effective means for improving user performance. Given that most searchers choose to use the simple search box, it is important to provide them with applicable training to promote the effective use of the search tool. Interestingly, coupling the assisted interface with Boolean training was no more effective than either treatment alone.

0.027527599 = product of:
  0.082582794 = sum of:
    0.082582794 = weight(_text_:interest in 2038) [ClassicSimilarity], result of:
      0.082582794 = score(doc=2038,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.3293521 = fieldWeight in 2038, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.046875 = fieldNorm(doc=2038)
  0.33333334 = coord(1/3)

Abstract

Web search engines are beginning to offer access to multimedia searching, including audio, video and image searching. In this paper we report findings from a study examining the state of multimedia search functionality on major general and specialized Web search engines. We investigated 102 Web search engines to examine: (1) how many Web search engines offer multimedia searching, (2) the type of multimedia search functionality and methods offered, such as "query by example", and (3) the supports for personalization or customization which are accessible as advanced search. Findings include: (1) few major Web search engines offer multimedia searching and (2) multimedia Web search functionality is generally limited. Our findings show that despite the increasing level of interest in multimedia Web search, those few Web search engines offering multimedia Web search, provide limited multimedia search functionality. Keywords are still the only means of multimedia retrieval, while other methods such as "query by example" are offered by less than 1% of Web search engines examined.

0.026719403 = product of:
  0.080158204 = sum of:
    0.080158204 = product of:
      0.2404746 = sum of:
        0.2404746 = weight(_text_:3a in 2514) [ClassicSimilarity], result of:
          0.2404746 = score(doc=2514,freq=2.0), product of:
            0.427877 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05046903 = queryNorm
            0.56201804 = fieldWeight in 2514, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.046875 = fieldNorm(doc=2514)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Content

Vgl.: http%3A%2F%2Fdelab.csd.auth.gr%2F~dimitris%2Fcourses%2Fir_spring06%2Fpage_rank_computing%2Fp527-li.pdf. Vgl. auch: http://www2002.org/CDROM/refereed/643/.

0.023683762 = product of:
  0.035525642 = sum of:
    0.027527599 = weight(_text_:interest in 1555) [ClassicSimilarity], result of:
      0.027527599 = score(doc=1555,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.10978404 = fieldWeight in 1555, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.015625 = fieldNorm(doc=1555)
    0.007998045 = product of:
      0.01599609 = sum of:
        0.01599609 = weight(_text_:classification in 1555) [ClassicSimilarity], result of:
          0.01599609 = score(doc=1555,freq=4.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.099522084 = fieldWeight in 1555, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.015625 = fieldNorm(doc=1555)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Content

"Introduction Yahoo! is the undisputed king of the Web directories, providing one of the key information navigation tools on the Internet. It has maintained its popularity over many Internet-years as the most visited Web site, against intense competition. This is because it does a good job of shifting, cataloguing and organising the Web [1] . But what would a map of Yahoo!'s hierarchical classification of the Web look like? Would an interactive map of Yahoo!, rather than the conventional listing of sites, be more useful as navigational tool? We can get some idea what a map of Yahoo! might be like by taking a look at ET-Map, a prototype developed by Hsinchun Chen and colleagues in the Artificial Intelligence Lab [2] at the University of Arizona. ET-Map was developed in 1995 as part of innovative research in automatic Internet homepage categorization and it charts a large chunk of Yahoo!, from the entertainment section representing some 110,000 different Web links. The map is a two-dimensional, multi-layered category map; its aim is to provide an intuitive visual information browsing tool. ET-Map can be browsed interactively, explored and queried, using the familiar point-and-click navigation style of the Web to find information of interest.
ET-Map was created using a sophisticated AI technique called Kohonen self-organizing map, a neural network approach that has been used for automatic analysis and classification of semantic content of text documents like Web pages. I do not pretend to fully understand how this technique works; I tend to think of it as a clever 'black-box' that group together things that are alike [5] . It is a real challenge to automatically classify pages from a very heterogeneous information collection like the Web into categories that will match the conceptions of a typical user. Directories like Yahoo! tend to rely on the skill of human editors to achieve this. ET-Map is an interesting prototype that I think highlights well the potential for a map-based approach to Web browsing. I am surprised none of the major search engines or directories have introduced the option of mapping results. Although, I am sure many are working on ideas. People certainly need all the help they get, as Web growth shows no sign of slowing. Just last month it was reported that the Web had surpassed one billion indexable pages [6].

0.022939665 = product of:
  0.068818994 = sum of:
    0.068818994 = weight(_text_:interest in 697) [ClassicSimilarity], result of:
      0.068818994 = score(doc=697,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.27446008 = fieldWeight in 697, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.0390625 = fieldNorm(doc=697)
  0.33333334 = coord(1/3)

Abstract

Those seeking information from the Internet often start from a search engine, using either its organised directory structure or its text query facility. In response to the difficulty in identifying the most relevant pages for some information needs, many search engines offer Boolean text matching and some, including Google, AltaVista and HotBot, offer the facility to integrate additional information into a more advanced request. Amongst web users, however, it is known that the employment of complex enquiries is far from universal, with very short queries being the norm. It is demonstrated that the gap between the provision of advanced search facilities and their use can be bridged, for specific information needs, by the construction of a simple interface in the form of a website that automatically formulates the necessary requests. It is argued that this kind of resource, perhaps employing additional knowledge domain specific information, is one that could be useful for websites or portals of common interest groups. The approach is illustrated by a website that enables a user to search the individual websites of university level institutions in European Union associated countries.

0.022939665 = product of:
  0.068818994 = sum of:
    0.068818994 = weight(_text_:interest in 978) [ClassicSimilarity], result of:
      0.068818994 = score(doc=978,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.27446008 = fieldWeight in 978, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.0390625 = fieldNorm(doc=978)
  0.33333334 = coord(1/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.019340381 = product of:
  0.058021143 = sum of:
    0.058021143 = product of:
      0.116042286 = sum of:
        0.116042286 = weight(_text_:22 in 3227) [ClassicSimilarity], result of:
          0.116042286 = score(doc=3227,freq=4.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.6565931 = fieldWeight in 3227, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=3227)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

7. 2.1996 22:38:41

Pages

22 S

0.019340381 = product of:
  0.058021143 = sum of:
    0.058021143 = product of:
      0.116042286 = sum of:
        0.116042286 = weight(_text_:22 in 4007) [ClassicSimilarity], result of:
          0.116042286 = score(doc=4007,freq=4.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.6565931 = fieldWeight in 4007, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=4007)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 8.1999 20:22:06