Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12358/24809
Title | A novel construction of connectivity graphs for clustering and visualization |
---|---|
Untitled | |
Abstract |
We [5, 6] have recently investigated several families of clustering algorithms. In this paper, we show how a novel similarity function can be integrated into one of our algorithms as a method of performing clustering and show that the resulting method is superior to existing methods in that it can be shown to reliably find a globally optimal clustering rather than local optima which other methods often find. We discuss some of the current difficulties with using connectivity graphs for solving clustering problems, and then we introduce a new algorithm to build the connectivity graphs. We compare this new algorithm with some famous algorithms used to build connectivity graphs. The new algorithm is shown to be superior to those in the current literature. We also extend the method to perform topology preserving mappings and show the results of such mappings on artificial and real data. |
Authors | |
Type | Journal Article |
Date | 2008 |
Published in | WSEAS Transactions on Computers |
Series | Volume: 7, Number: 5 |
Publisher | World Scientific and Engineering Academy and Society (WSEAS) |
Citation | |
Item link | Item Link |
License | ![]() |
Collections | |
Files in this item | ||
---|---|---|
Ashour, Wesam M._42.pdf | 636.5Kb |