By Topic

A clustering approach for XML linked documents

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
B. Catania ; Univ. of Genova, Italy ; A. Maddalena

Clustering algorithms for hypertext documents consider not only the document content but also the links existing between them. All the similarity functions proposed in the literature assume that just one type of link exists between documents, with a unique semantic meaning. With the rapid diffusion of XML documents, a specific language, called XLink, has been proposed to specify inside XML documents different types of links. Each type of link forces a different degree of similarity between the documents on which it is defined, thus we claim it must influence in a different way the computation of distance values. In this paper, after presenting a graph-based formalization of the hypertexts we consider, we introduce a distance function, based on both the number and the type of the links connecting documents. Some preliminary experimental results on clustering algorithms based on the proposed function conclude the paper.

Published in:

Database and Expert Systems Applications, 2002. Proceedings. 13th International Workshop on

Date of Conference:

2-6 Sept. 2002