Please use this identifier to cite or link to this item:
|Title||Overcoming the problem of different density-regions using the Inter-Connectivity and the Closeness.|
The density based algorithms considered as one of the most common and powerful algorithms in data clustering, this paper presents new way to solve the problem of detecting the clusters of varying density which most of the density based algorithms can't deal with it correctly. Our approach depending on the merging of the Inter-Connectivity and the Closeness techniques, which applied on the resulting of the subclusters by using the density based clustering technique to conflation it in a new clusters, the proposed algorithm help to decide if the different density regions belonged to the same cluster or not. The experimental results show that the proposed clustering algorithm gives satisfied results.
|Published in||Computing & Information Systems|
|Series||Volume: 16, Number: 3|
|Item link||Item Link|
|Files in this item|
|There are no files associated with this item.|