Clustering Algorithms and Latent Semantic Indexing to Identify Similar Pages in Web Applications

  • Authors:

  • Andrea de Lucia;Michele Risi;Genoveffa Tortora;Giuseppe Scanniello

  • Affiliations:

  • Dipartimento di Matematica e Informatica, University of Salerno, Via Ponte Don Melillo, 84084, Fisciano (SA), ITALY, adelucia@unisa.it;Dipartimento di Matematica e Informatica, University of Salerno, Via Ponte Don Melillo, 84084, Fisciano (SA), ITALY, mrisi@unisa.it;Dipartimento di Matematica e Informatica, University of Salerno, Via Ponte Don Melillo, 84084, Fisciano (SA), ITALY, tortora@unisa.it;Dipartimento di Matematica e Informatica, University of Basilicata, Viale Dell'Ateneo, Macchia, Romana, 85100, Potenza, ITALY, giuseppe.scanniello@unibas.it

  • Venue:
  • WSE '07 Proceedings of the 2007 9th IEEE International Workshop on Web Site Evolution
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we analyze some clustering algorithms that have been widely employed in the past to support the comprehension of web applications. To this end, we have defined an approach to identify static pages that are duplicated or cloned at the content level. This approach is based on a process that first computes the dissimilarity between web pages using Latent Semantic Indexing, a well known information retrieval technique, and then groups similar pages using clustering algorithms. We consider five instances of this process, each based on three variants of the agglomerative hierarchical clustering algorithm, a divisive clustering algorithm, k-means partitional clustering algorithm, and a widely employed partitional competitive clustering algorithm, namely Winner Takes All. In order to assess the proposed approach, we have used the static pages of three web applications and one static web site.