1,398 research outputs found
Document clustering based on firefly algorithm
Document clustering is widely used in Information Retrieval however, existing clustering techniques suffer from local optima problem in determining the k number of clusters.Various efforts have been put to address such drawback and this includes the utilization of swarm-based algorithms such as particle swarm optimization and Ant Colony Optimization.This study explores the adaptation of another swarm algorithm which is the Firefly Algorithm (FA) in text clustering.We present two variants of FA; Weight- based Firefly Algorithm (WFA) and Weight-based Firefly Algorithm II (WFAII).The difference between the two algorithms is that the WFAII, includes a more restricted condition in determining members of a cluster.The proposed FA methods are later evaluated using the 20Newsgroups dataset.Experimental results on the quality of clustering between the two FA variants are presented and are later compared against the one produced by particle swarm optimization, K-means and the hybrid of FA and -K-means. The obtained results demonstrated that the WFAII outperformed the WFA, PSO, K-means and FA-Kmeans. This result indicates that a better clustering can be obtained once the exploitation of a search solution is improved
Adaptive firefly algorithm for hierarchical text clustering
Text clustering is essentially used by search engines to increase the recall and precision in information retrieval. As search engine operates on Internet content that is constantly being updated, there is a need for a clustering algorithm that offers automatic grouping of items without prior knowledge on the collection. Existing clustering methods have problems in determining optimal number of clusters and producing compact clusters. In this research, an adaptive hierarchical text clustering
algorithm is proposed based on Firefly Algorithm. The proposed Adaptive Firefly Algorithm (AFA) consists of three components: document clustering, cluster refining, and cluster merging. The first component introduces Weight-based Firefly Algorithm (WFA) that automatically identifies initial centers and their clusters for any given text collection. In order to refine the obtained clusters, a second algorithm, termed as Weight-based Firefly Algorithm with Relocate (WFAR), is proposed. Such an approach allows the relocation of a pre-assigned document into a newly created cluster. The third component, Weight-based Firefly Algorithm with Relocate and
Merging (WFARM), aims to reduce the number of produced clusters by merging nonpure clusters into the pure ones. Experiments were conducted to compare the proposed algorithms against seven existing methods. The percentage of success in
obtaining optimal number of clusters by AFA is 100% with purity and f-measure of 83% higher than the benchmarked methods. As for entropy measure, the AFA produced the lowest value (0.78) when compared to existing methods. The result indicates that Adaptive Firefly Algorithm can produce compact clusters. This research contributes to the text mining domain as hierarchical text clustering
facilitates the indexing of documents and information retrieval processes
Document clustering for knowledge discovery using nature-inspired algorithm
As the internet is overload with information, various knowledge based systems are now equipped with data analytics features that
facilitate knowledge discovery.This includes
the utilization of optimization algorithms that mimics the behavior of insects or animals.This paper presents an experiment on
document clustering utilizing the Gravitation Firefly algorithm (GFA).The advantage of GFA
is that clustering can be performed without
a pre-defined value of k clusters.GFA determines the center of clusters by identifying documents with high force.Upon
identification of the centers, clusters are
created based on cosine similarity measurement.Experimental results demonstrated
that GFA utilizing a random positioning of
documents outperforms existing clustering algorithm such as Particles Swarm Optimization (PSO) and K-means
GF-CLUST: A nature-inspired algorithm for automatic text clustering
Text clustering is a task of grouping similar documents into a cluster while assigning the dissimilar ones in other clusters.A well-known clustering method which is the K-means algorithm is extensively employed in many disciplines.However, there is a big challenge to determine the number of clusters using K-means.
This paper presents a new clustering algorithm, termed Gravity Firefly Clustering (GF-CLUST) that utilizes Firefly Algorithm for dynamic document clustering. The GF-CLUST features the ability of identifying the appropriate number of clusters
for a given text collection, which is a challenging problem in document clustering. It determines documents having strong force as centers and creates clusters based on cosine similarity measurement.This is followed by selecting potential clusters and merging small clusters to them. Experiments on various
document datasets, such as 20 Newgroups, Reuters-21578 and TREC collection are conducted to evaluate the performance of the proposed GF-CLUST. The results of purity, F-measure and Entropy of GF-CLUST outperform the ones produced by existing clustering techniques, such as K-means, Particle Swarm Optimization (PSO) and Practical General Stochastic Clustering Method (pGSCM).Furthermore, the number of obtained clusters in GF-CLUST is near to the actual number of clusters as compared to pGSCM
Bibliometric Analysis of Firefly Algorithm Applications in the Field of Wireless Sensor Networks
Wireless Sensor Network is a network of wireless sensor nodes that are capable of sensing information from their surroundings and transmit the sensed information to data collection point known as a base station. Applications of wireless sensor networks are large in number and forest fire detection, landslide monitoring, etc. are few applications to note. The research challenges in wireless sensor networks is the transmission of data from the sensor node to the base station in an energy-efficient manner and network life prolongation. Cluster-based routing techniques are extensively adopted to address this research challenge. Researchers have used different metaheuristic and soft computing techniques for designing such energy-efficient routing techniques. In the literature, a lot of survey article on cluster-based routing methods are available, but there is no bibliometric analysis conducted so far. Hence in this research article, bibliometric study with the focus on the firefly algorithm and its applications in wireless sensor network is undertaken. The purpose of this article is to explore the nature of research conducted concerning to authors, the connection between keywords, the importance of journals and scope for further research in soft computing based clustered routing methods. A detailed bibliometric analysis is carried out by collecting the details of published articles from the Scopus database. In this article, the collected data is articulated in terms of yearly document statistics, key affiliations of authors, contributing geographical locations, subject area statistics, author-keyword mapping, and many more essential aspects of bibliometric analysis. The conducted study helped in understanding that there is a vast scope for the research community to perform research work concerning firefly algorithm applications in the field of wireless sensor networks
- …