Decomposing the Web Graph into Parameterized Connected Components

• MASADA Tomonari

  Graduate School of Information Science and Technology, The University of Tokyo

• TAKASU Atsuhiro

  NII

• ADACHI Jun

  NII

抄録

We propose a novel method for Web page grouping based only on hyperlink information. Because of the explosive growth of the World Wide Web, page grouping is expected to provide a general grasp of the Web for effective information search and netsurfing. The Web can be regarded as a gigantic digraph where pages are vertices and links are arcs. Our grouping method is a generalization of decomposition into strongly connected components, in which each group is constructed as a subset of a strongly connected component. Moreover, group sizes can be controlled by adjusting a parameter, called the threshold parameter. We call the resulting groups parameterized connected components (PCCs). The algorithm is simple and admits parallelization. Notably, we apply Dijkstra's shortest path algorithm in our grouping method. This paper also includes experimental results for 15 million Web pages, which show the contribution of our method to efficient Web surfer navigation.

収録刊行物

• IEICE transactions on information and systems

  IEICE transactions on information and systems 87 (2), 380-388, 2004-02-01

  一般社団法人電子情報通信学会

キーワード

• link analysis
• Web mining
• strongly connected component

詳細情報

• CRID: 1571698602271170048
• NII論文ID: 110003223360
• NII書誌ID: AA10826272
• ISSN: 09168532
• 本文言語コード: en
• データソース種別:
  • CiNii Articles