Carrière, J.; Kazman, R.: WebQuery : searching and visualizing the Web through connectivity (1996)
0.01
0.013419857 = product of:
0.04025957 = sum of:
0.04025957 = weight(_text_:search in 2676) [ClassicSimilarity], result of:
0.04025957 = score(doc=2676,freq=2.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.230407 = fieldWeight in 2676, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=2676)
0.33333334 = coord(1/3)
- Abstract
- Finding information located somewhere on the WWW is an error-prone and frustrating task. The WebQuey system offers a powerful new method for searching the Web based on connectivity and content. We do this by examining links among the nodes returned in a keyword-based query. We then rank the nodes, giving the highest rank to the most highly connected nodes. By doing so, we are finding 'hot spots' on the Web that contain onformation 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 hoghly connected to those sites returned by the original query. Even with WebQuery filtering and ranking query results, the result sets can be enourmous. So, wen need to visualize the returned information. We explore several techniques for visualizing this information - including cone trees, 2D graphs, 3D graphy, lists, and bullseyes - and discuss the criteria for using each of the techniques
