A Graph-Theoretic Approach to Webpage Segmentation
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.
Webpage sectioning webpage segmentation energy minimization graph cuts correlation clustering
Deepayan Chakrabarti Ravi Kumar Kunal Punera
Yahoo! Research 701 First Ave.Sunnyvale, CA 94089.
国际会议
第十七届国际万维网大会(the 17th International World Wide Web Conference)(WWW08)
北京
英文
2008-04-21(万方平台首次上网日期,不代表论文的发表时间)