Search (3 results, page 1 of 1)

Sugiura, A.; Etzioni, O.: Query routing for Web search engines : architecture and experiments (2000) 0.00

0.00334869 = product of:
  0.00669738 = sum of:
    0.00669738 = product of:
      0.01339476 = sum of:
        0.01339476 = weight(_text_:a in 5009) [ClassicSimilarity], result of:
          0.01339476 = score(doc=5009,freq=4.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.25222903 = fieldWeight in 5009, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.109375 = fieldNorm(doc=5009)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Type: a

Selberg, E.; Etzioni, O.: ¬The MetaCrawler architecture for resource aggregation on the Web (1997) 0.00

0.00270615 = product of:
  0.0054123 = sum of:
    0.0054123 = product of:
      0.0108246 = sum of:
        0.0108246 = weight(_text_:a in 778) [ClassicSimilarity], result of:
          0.0108246 = score(doc=778,freq=8.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.20383182 = fieldWeight in 778, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=778)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract: 2nd part of a 2 part section on search engines for the WWW. The MetaCrawler Softbot ia a parallel WWW search service which has been available since 1994. It provides a single interface search service. Describes the advantages of this type of system, how it operates, its architectural design and future development plans
Type: a

Zamir, O.; Etzioni, O.: Grouper : a dynamic clustering interface to Web search results (1999) 0.00
```
0.001757696 = product of:
  0.003515392 = sum of:
    0.003515392 = product of:
      0.007030784 = sum of:
        0.007030784 = weight(_text_:a in 6207) [ClassicSimilarity], result of:
          0.007030784 = score(doc=6207,freq=6.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.13239266 = fieldWeight in 6207, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=6207)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

Clustering is an effective way of organizing documents into collections for ease of browsing. Recently with the growth of WWW, clustering has become a paradigm for organizing search results. Online systems face many new challenges, including the need for fast response time, generating high quality clusters with simple descriptions for novice users, and working with document distributions that violates many traditional assumptions. How do different clustering algorithms trade off quality of clusters and speed? What modifications are necessary to adapt traditional clustering algorithm to the WWW? How do these system scale to larger document collection? How do these systems evaluate the quality of the cluster they generate? How are the clusters generated in each case, and are there any processing after cluster generation to improve on the cluster quality?

Type

a

Search (3 results, page 1 of 1)

Authors

Years

Themes