Minimum Spanning Trees Displaying Semantic Similarity

Similarity of semantic content of web pages is displayed using interactive graphs presenting fragments of minimum spanning trees. Homepages of people are analyzed, parsed into XML documents and visualized using TouchGraph LinkBrowser, displaying clusters of people that share common interest. The structure of these graphs is strongly affected by selection of information used to calculate similarity. Influence of simple selection and Latent Semantic Analysis (LSA) on structures of such graphs is analyzed. Homepages and lists of publications are converted to a word frequency vector, filtered, weighted and similarity matrix between normalized vectors is used to create separate minimum sub-trees showing clustering of people’s interest. Results show that in this application simple selection of important keywords is as good as LSA but with much lower algorithmic complexity.

Authors and Affiliations

1. Department of Informatics, Nicholaus Copernicus University, Toruń, Poland

   Włodzisław Duch & Paweł Matykiewicz

2. School of Computer Engineering, Nanyang Technological University, Singapore

   Włodzisław Duch

3. Department of Biomedical Informatics, Children’s Hospital Research Foundation, Cincinnati, Ohio, USA

   Paweł Matykiewicz

Editors and Affiliations

1. Institute of Computer Sciences, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warszawa, Poland

   Mieczysław A. Kłopotek , Sławomir T. Wierzchoń  & Krzysztof Trojanowski ,  & 

Reprints and permissions

© 2005 Springer-Verlag Berlin Heidelberg

Policies and ethics