Finding Related Web Pages Based on Connectivity Information from a Search Engine

This paper proposes a method for finding related Web pages based on connectivity information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages can be regarded as a Web community sharing a common interest. However, preparing Web snapshot data for the search of such communities is not an easy task since the Web is huge and is growing. In our method, connectivity information is acquired from a search engine by backlink search. A system based on the method succeeds in finding several genres of Web communities only from a few input URLs without analyzing the contents of Web pages. Keywords Web community, hyperlink, complete bipartite graph, search engine.

• Type: Conference
• Year: 2001
• Where: WWW
• Authors: Tsuyoshi Murata
• Keywords: Internet Technology, Keywords Web Community, Related Web Pages, Web Pages, WWW 2001