A graph-theoretic approach to webpage segmentation
Authors:
Open Access
- 21 April 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 377-386
Abstract
We consider the problem of segmenting a webpage into visually and semantically cohesive pieces. Our approach is based on formulating an appropriate optimization problem on weighted graphs, where the weights capture if two nodes in the DOM tree should be placed together or apart in the segmentation; we present a learning framework to learn these weights from manually labeled data in a principled manner. Our work is a significant departure from previous heuristic and rule-based solutions to the segmentation problem. The results of our empirical analysis bring out interesting aspects of our framework, including variants of the optimization problem and the role of learning.Keywords
This publication has 17 references indexed in Scilit:
- Page-level template detection via isotonic smoothing2007
- Aggregating inconsistent information2005
- Adapting Web Pages for Small-Screen DevicesIEEE Internet Computing, 2005
- What energy functions can be minimized via graph cuts?IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Approximation algorithms for classification problems with pairwise relationshipsJournal of the ACM, 2002
- Fast approximate energy minimization via graph cutsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- 10.1162/153244303321897735Applied Physics Letters, 2000
- Syntactic clustering of the WebComputer Networks and ISDN Systems, 1997
- A Study of the Comparability of External Criteria for Hierarchical Cluster AnalysisMultivariate Behavioral Research, 1986
- Comparing partitionsJournal of Classification, 1985