WebQuery: searching and visualizing the Web through connectivity
J. Carrière, и R. Kazman. Computer Networks and ISDN Systems, 29 (8):
1257--1267(сентября 1997)
Аннотация
Finding information located somewhere on the World-Wide Web is an error-prone and frustrating task. The WebQuery 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 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 filtering and ranking query results, the result sets can be enormous. So, we need to visualize the returned information. We explore several techniques for visualizing this information -- including cone trees, 2D graphs, 3D graphs, lists, and bullseyes -- and discuss the criteria for using each of the techniques.
%0 Journal Article
%1 carriere1997webquery
%A Carrière, Jeromy
%A Kazman, Rick
%D 1997
%J Computer Networks and ISDN Systems
%K ranking, visualization, web-graph
%N 8
%P 1257--1267
%T WebQuery: searching and visualizing the Web through connectivity
%U http://www.ingentaconnect.com/content/els/01697552/1997/00000029/00000008/art00062
%V 29
%X Finding information located somewhere on the World-Wide Web is an error-prone and frustrating task. The WebQuery 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 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 filtering and ranking query results, the result sets can be enormous. So, we need to visualize the returned information. We explore several techniques for visualizing this information -- including cone trees, 2D graphs, 3D graphs, lists, and bullseyes -- and discuss the criteria for using each of the techniques.
@article{carriere1997webquery,
abstract = {Finding information located somewhere on the World-Wide Web is an error-prone and frustrating task. The WebQuery 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 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 filtering and ranking query results, the result sets can be enormous. So, we need to visualize the returned information. We explore several techniques for visualizing this information -- including cone trees, 2D graphs, 3D graphs, lists, and bullseyes -- and discuss the criteria for using each of the techniques.},
added-at = {2009-08-06T15:16:38.000+0200},
author = {Carri\`{e}re, Jeromy and Kazman, Rick},
biburl = {https://www.bibsonomy.org/bibtex/21a8074ec534ecf6125fed15b555a3771/chato},
citeulike-article-id = {1083093},
citeulike-linkout-0 = {http://www.ingentaconnect.com/content/els/01697552/1997/00000029/00000008/art00062},
citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=283202.283412},
interhash = {8d033e4d6be9447257fbebb8aeb5b823},
intrahash = {1a8074ec534ecf6125fed15b555a3771},
journal = {Computer Networks and ISDN Systems},
keywords = {ranking, visualization, web-graph},
month = {September},
number = 8,
pages = {1257--1267},
posted-at = {2007-02-02 10:42:39},
priority = {2},
timestamp = {2009-08-06T15:16:49.000+0200},
title = {WebQuery: searching and visualizing the Web through connectivity},
url = {http://www.ingentaconnect.com/content/els/01697552/1997/00000029/00000008/art00062},
volume = 29,
year = 1997
}