SOLVING THE TASK OF LOCAL OPTIMA TRAPS IN DATA MINING APPLICATIONS THROUGH INTELLIGENT MULT-AGENT SWARM AND ORTHOPAIR FUZZY SETS
Local optima traps pose a significant challenge in optimizing complex problems, particularly in data mining applications, where traditional algorithms may get stuck in suboptimal solutions. This study addresses this issue by combining the power of intelligent multi-agent swarm algorithms and orthopa...
Gespeichert in:
Veröffentlicht in: | ICTACT journal on soft computing 2024-01, Vol.14 (3), p.3263-3268 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Local optima traps pose a significant challenge in optimizing complex problems, particularly in data mining applications, where traditional algorithms may get stuck in suboptimal solutions. This study addresses this issue by combining the power of intelligent multi-agent swarm algorithms and orthopair fuzzy sets to enhance optimization processes. We propose a novel approach that leverages the collective intelligence of a multi-agent swarm system, enabling effective exploration and exploitation of solution spaces. Additionally, orthopair fuzzy sets are introduced to model and represent uncertainties inherent in data mining tasks, providing a more robust optimization framework. Our work contributes to the advancement of optimization techniques in data mining by offering a synergistic solution to local optima traps. The integration of intelligent multi-agent swarms and orthopair fuzzy sets enhances the algorithm’s adaptability and resilience, leading to improved convergence and better solutions. Experimental results demonstrate the efficacy of our proposed approach in overcoming local optima traps, showcasing superior performance compared to traditional algorithms. The hybrid system exhibits increased convergence rates and consistently discovers more accurate and diverse solutions across various data mining scenarios. |
---|---|
ISSN: | 0976-6561 2229-6956 |
DOI: | 10.21917/ijsc.2024.0458 |