Skip Navigation

IEICE Transactions on Information and Systems 2008 E91-D(4):986-989; doi:10.1093/ietisy/e91-d.4.986
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by TSURUTA, M.
Right arrow Articles by MASUYAMA, S.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Special Section on Knowledge-Based Software Engineering -- Letter

An Informative DOM Subtree Identification Method from Web Pages in Unfamiliar Web Sites

Masanobu TSURUTA1, Hiroyuki SAKAI1 and Shigeru MASUYAMA1

1 The authors are with the Department of Knowledge-based Information Engineering, Toyohashi University of Technology, Toyohashi-shi, 441–8580 Japan. E-mail: tsuruta{at}smlab.tutkie.tut.ac.jp; sakai{at}smlab.tutkie.tut.ac.jp; masuyama{at}tutkie.tut.ac.jp


  Abstract

We propose a method of informative DOM* subtree identification from a Web page in an unfamiliar Web site. Our method uses layout data of DOM nodes generated by a generic Web browser. The results show that our method outperforms a baseline method, and was able to identify informative DOM subtrees from Web pages robustly.

Key Words: informative region identification, Web document, DOM, layout analysis

Manuscript received July 2, 2007. Manuscript revised October 17, 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.