Divyavani, M. and Amudha, T. (2021) Clustering Efficiency of ACO and K-Harmonic Means Techniques: A Comparative Study. In: Theory and Practice of Mathematics and Computer Science Vol. 11. B P International, pp. 93-107. ISBN 978-93-91215-41-5
Full text not available from this repository.Abstract
In the last two decades, many advances on the computer sciences have been based on the observation and emulation of processes of the natural world. The nature inspired methods like ant based clustering techniques have found success in solving clustering problems. They have received special attention from the research community over the recent years because these methods are particularly suitable to perform exploratory data analysis. The clustering is an important technique that has been studied in various fields with many applications such as image processing, marketing, data mining and information retrieval. Recently, the various algorithms inspired by nature are used for clustering. Data clustering is a useful process to extract meaning from sets of unlabeled data or to perform data exploration for pattern recognition. This paper focuses on the behavior of clustering procedures in two approaches, ant based clustering algorithm and K-harmonic means clustering algorithm. The two algorithms were evaluated in two of well- known benchmark data sets. Empirical results clearly show that ant clustering algorithm performs well compared to another technique called K-Harmonic means clustering algorithm.
Item Type: | Book Section |
---|---|
Subjects: | Library Keep > Computer Science |
Depositing User: | Unnamed user with email support@librarykeep.com |
Date Deposited: | 16 Nov 2023 06:10 |
Last Modified: | 16 Nov 2023 06:10 |
URI: | http://archive.jibiology.com/id/eprint/1701 |