2007 IEEE 23rd International Conference on Data Engineering (2007)
Apr. 15, 2007 to Apr. 20, 2007
Luciano Barbosa , University of Utah, email@example.com
Juliana Freire , University of Utah, firstname.lastname@example.org
Altigran Silva , Universidade Federal do Amazonas, email@example.com
In this paper we address the problem of organizing hidden-Web databases. Given a heterogeneous set of Web forms that serve as entry points to hidden-Web databases, our goal is to cluster the forms according to the database domains to which they belong. We propose a new clustering approach that models Web forms as a set of hyperlinked objects and considers visible information in the form context both within and in the neighborhood of formsas the basis for similarity comparison. Since the clustering is performed over features that can be automatically extracted, the process is scalable. In addition, because it uses a rich set of metadata, our approach is able to handle a wide range of forms, including content-rich forms that contain multiple attributes, as well as simple keyword-based search interfaces. An experimental evaluation over real Web data shows that our strategy generates high-quality clustersmeasured both in terms of entropy and F-measure. This indicates that our approach provides an effective and general solution to the problem of organizing hidden-Web databases.
L. Barbosa, A. Silva and J. Freire, "Organizing Hidden-Web Databases by Clustering Visible Web Documents," 2007 IEEE 23rd International Conference on Data Engineering(ICDE), Istanbul, Turkey, 2007, pp. 326-335.