Omar, Wafa'a; Badr, Amr; El-Fattah Hegazy, Abd
June 2013
Journal of Computer Science;Jun2013, Vol. 9 Issue 6, p780
Academic Journal
Cluster analysis is a data mining technology designed to derive a good understanding of data to solve clustering problems by extracting useful information from a large volume of mixed data elements. Recently, researchers have aimed to derive clustering algorithms from nature's swarm behaviors. Ant-based clustering is an approach inspired by the natural clustering and sorting behavior of ant colonies. In this research, a hybrid ant-based clustering method is presented with new modifications to the original ant colony clustering model (ACC) to enhance the operations of ants, picking up and dropping off data items. Ants' decisions are supported by operating two cluster analysis methods: Agglomerative Hierarchical Clustering (AHC) and density-based clustering. The proximity function and refinement process approaches are inspired by previous clustering methods, in addition to an adaptive threshold method. The results obtained show that the hybrid ant-based clustering algorithm attains better results than the ant-based clustering Handl model ATTA-C, k-means and AHC over some real and artificial datasets and the method requires less initial information about class numbers and dataset size.


Related Articles

  • Applying Data Clustering Feature to Speed Up Ant Colony Optimization. Chao-Yang Pang; Ben-Qiong Hu; Jie Zhang; Wei Hu; Zheng-Chao Shan // Abstract & Applied Analysis;2014, p1 

    Ant colony optimization (ACO) is often used to solve optimization problems, such as traveling salesman problem (TSP). When it is applied to TSP, its runtime is proportional to the squared size of problem N so as to look less efficient. The following statistical feature is observed during the...

  • MULTI-DENSITY DBSCAN USING REPRESENTATIVES: MDBSCAN-UR. Ahmed, Rwand; El-Zaza, Eman; Ashour, Wesam // Computing & Information Systems;Oct2011, Vol. 15 Issue 2, p1 

    DBSCAN is one of the most popular algorithms for cluster analysis. It can discover clusters with arbitrary shape and separate noises. But this algorithm cannot choose its parameter according to distributing of dataset. It simply uses the global uses minimum number of points (MinPts) parameter,...

  • AVOIDING NOISE AND OUTLIERS IN K-MEANS. Jnena, Rami; Timraz, Mohammed; Ashour, Wesam // Computing & Information Systems;Oct2011, Vol. 15 Issue 2, p1 

    Applying k-means algorithm on the datasets that include large number of noise and outlier objects, gives unclear clusters results. In this paper we proposed a new technique for avoiding these noise and outliers by applying some preprocessing and post processing steps for the dataset that have to...

  • DERIVING CLUSTER KNOWLEDGE USING ROUGH SET THEORY. Upadhyaya, Shuchita; Arora, Alka; Jain, Rajni // Journal of Theoretical & Applied Information Technology;2008, Vol. 4 Issue 8, p688 

    Clustering algorithms gives general description of the clusters listing number of clusters and member entities in those clusters. It lacks in generating cluster description in the form of pattern. Deriving pattern from clusters along with grouping of data into clusters is important from data...

  • Avoiding Objects with few Neighbors in the K-Means Process and Adding ROCK Links to Its Distance. Alnabriss, Hadi A.; Ashour, Wesam // International Journal of Computer Applications;Aug2011, Vol. 28, p12 

    K-means is considered as one of the most common and powerful algorithms in data clustering, in this paper we're going to present new techniques to solve two problems in the K-means traditional clustering algorithm, the 1st problem is its sensitivity for outliers, in this part we are going to...

  • K-Means for Spherical Clusters with Large Variance in Sizes. Fahim, A. M.; Saake, G.; Salem, A. M.; Torkey, F. A.; Ramadan, M. A. // International Journal of Computer Science;2009, Vol. 4 Issue 3, p145 

    Data clustering is an important data exploration technique with many applications in data mining. The k-means algorithm is well known for its efficiency in clustering large data sets. However, this algorithm is suitable for spherical shaped clusters of similar sizes and densities. The quality of...

  • A hybrid ACO-GRASP algorithm for clustering analysis. Marinakis, Yannis; Marinaki, Magdalene; Doumpos, Michael; Matsatsinis, Nikolaos; Zopounidis, Constantin // Annals of Operations Research;Aug2011, Vol. 188 Issue 1, p343 

    Cluster analysis is an important tool for data exploration and it has been applied in a wide variety of fields like engineering, economics, computer sciences, life and medical sciences, earth sciences and social sciences. The typical cluster analysis consists of four steps (i.e. feature...

  • An Analysis of Ant Colony Clustering Methods: Models, Algorithms and Applications. Gong Zhe; Li Dan; An Baoyu; Ou Yangxi; Cui Wei; Niu Xinxin; Xin Yang // International Journal of Advancements in Computing Technology;Dec2011, Vol. 3 Issue 11, p112 

    In recent years the ant colony clustering methods have emerged as a new kind of data mining schemes. The research of ant colony clustering methods is also an important direction for swarm intelligence. Today these methods have been deeply investigated and most of them show good performance. This...

  • An Online Hot Topics Detection Approach Using the Improved Ant Colony Text Clustering Algorithm. Gong Zhe; Li Dong; Li Qi; Zhang Jianyi; Xin Yang; Niu Xinxin // Journal of Convergence Information Technology;Feb2012, Vol. 7 Issue 2, p243 

    Recently, with an increasing number of major events spreading all over the Internet, the research for online hot topics detection system has been paid more and more attention. In this paper, we proposed an unsupervised and efficient hot topics detection approach, which is based on an improved...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics