We propose a novel method for Web page grouping based only on hyperlink information. Because of the explosive growth of the Web, page grouping is expected to provide a general grasp of the Web for effective Web search and netsurfing. The Web can be regarded as a gigantic digraph where pages are vertices and links are arcs. Our method is a generalization of the decomposition into strongly connected components. Each group is constructed as a subset of a strongly connected component. Moreover, group sizes can be controlled by a parameter, called the threshold parameter. We call the resulting groups parameterized connected components. The algorithm is simple and admits parallelization. Notably, we apply Dijkstra's shortest path algorithm in our method. © Springer-Verlag 2004.
CITATION STYLE
Masada, T., Takasu, A., & Adachi, J. (2004). Web page grouping based on parameterized connectivity. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2973, 374–380. https://doi.org/10.1007/978-3-540-24571-1_34
Mendeley helps you to discover research relevant for your work.