Clustering and Embedding Graphs into Trees

Please enable javascript in your browser.

Nodehi Sabet, Amirhossein | 2014

535 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 45318 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Daneshgar, Amir
Abstract:
In this thesis, we study the following question stating that “how well a tree structure can approximate the clustering structure of a graph”.To do this, we first focus on the DJS algorithm proposed by Daneshgar et.al. and second we consider the minimum distortion tree approximation algorithm proposed by Abraham et.al.We conclude, using some experimental results, that the minimum spanning tree algorithm extracts some geometric aspects of the data set that the Abraham et.al. algorithm can not track
Keywords:
Clustering ; Embedding Graph into Tree ; Minimum Spanning Tree