The parallel path framework for entity discovery on the web

Abstract

It has been a dream of the database and Web communities to reconcile the unstructured nature of the World Wide Web with the neat, structured schemas of the database paradigm. Even though databases are currently used to generate Web content in some sites, the schemas of these databases are rarely consistent across a domain. This makes the comparison and aggregation of information from different domains difficult. We aim to make an important step towards resolving this disparity by using the structural and relational information on the Web to (1) extract Web lists, (2) find entity-pages, (3) map entity-pages to a database, and (4) extract attributes of the entities. Specifically, given a Web site and an entity-page (e.g., university department and faculty member home page) we seek to find all of the entity-pages of the same type (e.g., all faculty members in the department), as well as attributes of the specific entities (e.g., their phone numbers, email addresses, office numbers). To do this, we propose a Web structure mining method which grows parallel paths through the Web graph and DOM trees and propagates relevant attribute information forward. We show that by utilizing these parallel paths we can efficiently discover entity-pages and attributes. Finally, we demonstrate the accuracy of our method with a large case study.

Document Details

Document Type
Pub Defense Publication
Publication Date
Sep 01, 2013
Source ID
10.1145/2516633.2516638

Entities

People

  • Jiawei Han
  • Thomas J. Johnston
  • Tim Weninger

Organizations

  • Division of Information and Intelligent Systems
  • National Science Foundation
  • United States Air Force
  • United States Army Research Laboratory
  • University of Illinois Urbana–Champaign

Tags

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Linguistics
  • Neural Network Machine Learning.