Year: 2019
Type: conference-paper
Abstract: Web page segmentation aims to break a page into smaller blocks, in which contents with coherent semantics are kept together.Examples of tasks targeted by such a technique are advertisement detection or main content extraction.In this paper, we study different segmentation strategies for the task of non visual skimming.For that purpose, we consider web page segmentation as a clustering problem of visual elements, where (1) all visual elements must be clustered, (2) a fixed number of clusters must be discovered, and (3) the elements of a cluster should be visually connected.Therefore, we study three different algorithms that comply to these constraints: K-means, F-K-means, and Guided Expansion.Evaluation shows that Guided Expansion evidences statistically-relevant results in terms of compactness and separateness, and satisfies more logical constraints when compared to the other strategies.
Authors: Andrew, Judith Jeyafreeda, 99059, Ferrari, Stephane, 99060, Maurel, Fabrice, 99061, Dias, Gael, 99062, Giguet, Emmanuel, 99063
Institution: GREYC
Language: English
Topic: Web Data Mining and Analysis
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3109166473
