By Topic

Vectors and Graphs: Two Representations to Cluster Web Sites Using Hyperstructure

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
$31 $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

1 Author(s)
Meneses, E. ; Comput. Res. Center, Costa Rica Inst. of Technol., Cartago

Web site clustering consists in finding meaningful groups of related Web sites. How related is some Web site to another is a question that depends on how we represent Web sites. Traditionally, vectors and graphs have been two important structures to represent individuals in a population. Both representations can play an important role in the Web area if hyper structure is considered. By analyzing the way Web sites are linked, we can build vectors or graphs to understand how a Web site collection is partitioned. In this paper, we analyze these two models and four associated algorithms: k-means and self-organizing maps (SOM) with vectors, simulated annealing and genetic algorithms with graphs. For testing these ideas we clustered some Web sites in the Central American Web. We compare the results for clustering this Web site collection using both models and show what kind of clusters each one produces

Published in:

Web Congress, 2006. LA-Web '06. Fourth Latin American

Date of Conference:

Oct. 2006