An effective implementation of Social Spider Optimization for text document clustering using single cluster approach

2018 ◽  
Author(s):  
T. Ravi Chandran ◽  
A.V. Reddy ◽  
B. Janet
Keyword(s):  
Document Clustering ◽  
Cluster Approach ◽  
Social Spider ◽  
Effective Implementation ◽  
Text Document ◽  
Social Spider Optimization ◽  
Single Cluster

An Improved B-hill Climbing Optimization Technique for Solving the Text Documents Clustering Problem

2020 ◽  
Vol 16 (4) ◽  
pp. 296-306 ◽  
Author(s):  
Laith Mohammad Abualigah ◽  
Essam Said Hanandeh ◽  
Ahamad Tajudin Khader ◽  
Mohammed Abdallh Otair ◽  
Shishir Kumar Shandilya
Keyword(s):  
Optimization Technique ◽  
Document Clustering ◽  
Text Clustering ◽  
Hill Climbing ◽  
Text Documents ◽  
Clustering Problem ◽  
Text Document ◽  
Text Information ◽  
Amount Of Knowledge ◽  
The Hill

Background: Considering the increasing volume of text document information on Internet pages, dealing with such a tremendous amount of knowledge becomes totally complex due to its large size. Text clustering is a common optimization problem used to manage a large amount of text information into a subset of comparable and coherent clusters. Aims: This paper presents a novel local clustering technique, namely, β-hill climbing, to solve the problem of the text document clustering through modeling the β-hill climbing technique for partitioning the similar documents into the same cluster. Methods: The β parameter is the primary innovation in β-hill climbing technique. It has been introduced in order to perform a balance between local and global search. Local search methods are successfully applied to solve the problem of the text document clustering such as; k-medoid and kmean techniques. Results: Experiments were conducted on eight benchmark standard text datasets with different characteristics taken from the Laboratory of Computational Intelligence (LABIC). The results proved that the proposed β-hill climbing achieved better results in comparison with the original hill climbing technique in solving the text clustering problem. Conclusion: The performance of the text clustering is useful by adding the β operator to the hill climbing.

scholarly journals Social spider optimization algorithm for tuning parameters in PD-like Interval Type-2 Fuzzy Logic Controller applied to a parallel robot

2021 ◽  
Vol 54 (3-4) ◽  
pp. 303-323
Author(s):  
Amjad J Humaidi ◽  
Huda T Najem ◽  
Ayad Q Al-Dujaili ◽  
Daniel A Pereira ◽  
Ibraheem Kasim Ibraheem ◽  
...  
Keyword(s):  
Fuzzy Logic ◽  
Trajectory Tracking ◽  
Fuzzy Logic Controller ◽  
Optimization Technique ◽  
Parallel Robot ◽  
Design Parameters ◽  
Social Spider ◽  
Social Spider Optimization ◽  
Interval Type

This paper presents control design based on an Interval Type-2 Fuzzy Logic (IT2FL) for the trajectory tracking of 3-RRR (3-Revolute-Revolute-Revolute) planar parallel robot. The design of Type-1 Fuzzy Logic Controller (T1FLC) is also considered for the purpose of comparison with the IT2FLC in terms of robustness and trajectory tracking characteristics. The scaling factors in the output and input of T1FL and IT2FL controllers play a vital role in improving the performance of the closed-loop system. However, using trial-and-error procedure for tuning these design parameters is exhaustive and hence an optimization technique is applied to achieve their optimal values and to reach an improved performance. In this study, Social Spider Optimization (SSO) algorithm is proposed as a useful tool to tune the parameters of proportional-derivative (PD) versions of both IT2FLC and T1FLC. Two scenarios, based on two square desired trajectories (with and without disturbance), have been tested to evaluate the tracking performance and robustness characteristics of proposed controllers. The effectiveness of controllers have been verified via numerical simulations based on MATLAB/SIMULINK programming software, which showed the superior of IT2FLC in terms of robustness and tracking errors.

Minimum attribute reduction algorithm based on quick extraction and multi-strategy social spider optimization

2021 ◽  
pp. 1-16
Author(s):  
Qianjin Wei ◽  
Chengxian Wang ◽  
Yimin Wen
Keyword(s):  
Rough Set Theory ◽  
Attribute Reduction ◽  
Search Space ◽  
Initial State ◽  
Solution Quality ◽  
Social Spider ◽  
Opposition Based Learning ◽  
Social Spider Optimization ◽  
Intelligent Optimization Algorithm ◽  
Redundancy Detection

Intelligent optimization algorithm combined with rough set theory to solve minimum attribute reduction (MAR) is time consuming due to repeated evaluations of the same position. The algorithm also finds in poor solution quality because individuals are not fully explored in space. This study proposed an algorithm based on quick extraction and multi-strategy social spider optimization (QSSOAR). First, a similarity constraint strategy was called to constrain the initial state of the population. In the iterative process, an adaptive opposition-based learning (AOBL) was used to enlarge the search space. To obtain a reduction with fewer attributes, the dynamic redundancy detection (DRD) strategy was applied to remove redundant attributes in the reduction result. Furthermore, the quick extraction strategy was introduced to avoid multiple repeated computations in this paper. By combining an array with key-value pairs, the corresponding value can be obtained by simple comparison. The proposed algorithm and four representative algorithms were compared on nine UCI datasets. The results show that the proposed algorithm performs well in reduction ability, running time, and convergence speed. Meanwhile, the results confirm the superiority of the algorithm in solving MAR.

scholarly journals A semantic approach for text document clustering using frequent itemsets and WordNet

2018 ◽  
Vol 7 (2.18) ◽  
pp. 102
Author(s):  
Harsha Patil ◽  
Ramjeevan Singh Thakur
Keyword(s):  
Clustering Algorithms ◽  
Document Clustering ◽  
Knowledge Bases ◽  
Experimental Result ◽  
Semantic Approach ◽  
Text Document ◽  
Clustering Quality ◽  
Ship Function ◽  
Membership Score ◽  
Specific Cluster

Document Clustering is an unsupervised method for classified documents in clusters on the basis of their similarity. Any document get it place in any specific cluster, on the basis of membership score, which calculated through membership function. But many of the traditional clustering algorithms are generally based on only BOW (Bag of Words), which ignores the semantic similarity between document and Cluster. In this research we consider the semantic association between cluster and text document during the calculation of membership score of any document for any specific cluster. Several researchers are working on semantic aspects of document clustering to develop clustering performance. Many external knowledge bases like WordNet, Wikipedia, Lucene etc. are utilized for this purpose. The proposed approach exploits WordNet to improve cluster member ship function. The experimental result shows that clustering quality improved significantly by using proposed framework of semantic approach. 

Sign in / Sign up

Export Citation Format

Share Document