WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
| Hi-index | 0.00 |
Foraging information in large and complex web sites simply using keyword search usually results in unpleasant experience due to the overloaded search results. To support more effective information search, some descriptive abstractions of the web sites (e.g., sitemaps) are mostly needed. However, their creation and maintenance normally requires recurrent manual effort due to the fast-changing web contents. In this paper, we extend the HITS algorithm and integrate hyperlink topology and web site hierarchy to identify a hierarchy of web page clusters as the abstraction of a web site. As the algorithm is based on HITS, each identified cluster follows the bipartite graph structure, with an authority and hub pair as the cluster summary. The effectiveness of the algorithm has been evaluated using three differentweb sites (containing ~ 6000-14000 web pages) with promising results. Detailed interpretation of the experimental results as well as qualitative comparison with other related works are also included.