Symmetry in Intelligent Algorithms

A special issue of Symmetry (ISSN 2073-8994). This special issue belongs to the section "Computer".

Deadline for manuscript submissions: 30 November 2024 | Viewed by 1065

Special Issue Editors


E-Mail Website
Guest Editor
1. School of Software, Yunnan University, Kunming 650500, China
2. Yunnan key laboratory of software engineering, Yunnan University, Kunming 650504, China
Interests: evolutionary algorithm; cooperative coevolution; differential evolution

E-Mail Website
Guest Editor
School of Software, Yunnan University, Kunming 650500, China
Interests: swarm intelligence; evolutionary computation; evolutionary game; machine learning

Special Issue Information

Dear Colleagues,

We are delighted to announce the launch of a new Special Issue entitled "Symmetry in Intelligent Algorithms". Intelligent Algorithms, which range from machine learning to evolutionary computation, are pivotal in modern computing.  However, challenges persist in understanding their intricacies, ensuring fairness, and maximizing efficiency. From swarm intelligence to evolutionary computation and machine learning, symmetry can be leveraged to optimize algorithmic behavior, streamline computational processes, and enhance the quality of solutions.  Understanding and harnessing symmetry can lead to more robust, scalable, and interpretable algorithms. This Special Issue aims to explore the integration of symmetry into the design and application of intelligent algorithms.  It seeks to connect researchers, practitioners, and experts to discuss novel approaches, theoretical foundations, and real-world applications.  By providing a platform for sharing insights and fostering collaboration, this Special Issue seeks to advance the understanding and application of symmetry in intelligent algorithms, addressing current challenges and setting the stage for future developments. Below is an outline of topics, key areas of interest, and the significance of this Special Issue. 

  • Fundamentals and Theoretical Advances
    • Theoretical foundations and mathematical modeling of swarm intelligence and evolutionary algorithms.
    • Comparative analyses and benchmarks of different swarm and evolutionary algorithms.
    • Hybrid models combining swarm intelligence with evolutionary computation or other optimization techniques.
    • Convergence analysis and performance metrics for swarm and evolutionary algorithms. 
  • Algorithm Design and Optimization
    • Novel swarm intelligence algorithms (e.g., Ant Colony Optimization, Particle Swarm Optimization, Artificial Bee Colony).
    • Innovative evolutionary computation techniques (e.g., Genetic Algorithms, Genetic Programming, Differential Evolution).
    • Enhancements and modifications to existing algorithms to enhance performance and robustness.
    • Parallel and distributed implementations of swarm and evolutionary algorithms.
  • Applications in Engineering and Industry
    • Applications in robotics, including multi-robot systems, path planning, and control.
    • Use of swarm and evolutionary algorithms in manufacturing, logistics, and supply chain optimization.
    • Optimization of telecommunications and network design.
    • Applications in energy systems, including smart grids, renewable energy, and resource management.
    • Data Science and Artificial Intelligence 
  • Machine learning and data mining using swarm intelligence and evolutionary algorithms.
    • Feature selection, parameter tuning, and model optimization.
    • Applications in natural language processing and text mining.
    • Image and video analysis using evolutionary and swarm-based approaches.
    • Symmetry in Swarm Intelligence 
  • Behavioral symmetry in intelligence algorithms.
    • Spatial symmetry in swarm formations and movement patterns.
    • Communication symmetry and its effects on information dissemination and coordination.l  Symmetrical task allocation and role distribution in swarm systems.
    • Symmetry in Evolutionary Computation
    • Symmetric crossover, mutation, and other genetic operations.
    • Fitness evaluation symmetry and its impact on evolutionary search efficiency.
    • Symmetry-breaking techniques that avoid local optima and enhance diversity.
    • Symmetry in Machine Learning Algorithms
    • Data augmentation and transformation using symmetrical properties.
    • Group-equivariant neural networks and applications in pattern recognition.
    • Symmetry in training, optimization, and regularization techniques.

Dr. Hongwei Kang
Dr. Xinping Sun
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Symmetry is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • swarm intelligence
  • evolutionary computation
  • machine learning
  • behavioral symmetry
  • spatial symmetry
  • genetic algorithms
  • particle swarm optimization
  • ant colony optimization
  • artificial bee colony
  • genetic programming
  • differential evolution
  • neural networks
  • group-equivariant neural networks
  • symmetry in neural architectures
  • fitness evaluation
  • hybrid algorithms
  • natural language processing
  • text analysis
  • bioinformatics
  • environmental modeling
  • optimization problems
  • algorithm performance
  • scalability
  • convergence analysis
  • diversity in algorithms
  • hybrid approaches
  • real-world applications
  • symmetry

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

23 pages, 5712 KiB  
Article
Sparse Fuzzy C-Means Clustering with Lasso Penalty
by Shazia Parveen and Miin-Shen Yang
Symmetry 2024, 16(9), 1208; https://doi.org/10.3390/sym16091208 - 13 Sep 2024
Viewed by 314
Abstract
Clustering is a technique of grouping data into a homogeneous structure according to the similarity or dissimilarity measures between objects. In clustering, the fuzzy c-means (FCM) algorithm is the best-known and most commonly used method and is a fuzzy extension of k-means in [...] Read more.
Clustering is a technique of grouping data into a homogeneous structure according to the similarity or dissimilarity measures between objects. In clustering, the fuzzy c-means (FCM) algorithm is the best-known and most commonly used method and is a fuzzy extension of k-means in which FCM has been widely used in various fields. Although FCM is a good clustering algorithm, it only treats data points with feature components under equal importance and has drawbacks for handling high-dimensional data. The rapid development of social media and data acquisition techniques has led to advanced methods of collecting and processing larger, complex, and high-dimensional data. However, with high-dimensional data, the number of dimensions is typically immaterial or irrelevant. For features to be sparse, the Lasso penalty is capable of being applied to feature weights. A solution for FCM with sparsity is sparse FCM (S-FCM) clustering. In this paper, we propose a new S-FCM, called S-FCM-Lasso, which is a new type of S-FCM based on the Lasso penalty. The irrelevant features can be diminished towards exactly zero and assigned zero weights for unnecessary characteristics by the proposed S-FCM-Lasso. Based on various clustering performance measures, we compare S-FCM-Lasso with the S-FCM and other existing sparse clustering algorithms on several numerical and real-life datasets. Comparisons and experimental results demonstrate that, in terms of these performance measures, the proposed S-FCM-Lasso performs better than S-FCM and existing sparse clustering algorithms. This validates the efficiency and usefulness of the proposed S-FCM-Lasso algorithm for high-dimensional datasets with sparsity. Full article
(This article belongs to the Special Issue Symmetry in Intelligent Algorithms)
Show Figures

Figure 1

28 pages, 16506 KiB  
Article
A Modified Osprey Optimization Algorithm for Solving Global Optimization and Engineering Optimization Design Problems
by Liping Zhou, Xu Liu, Ruiqing Tian, Wuqi Wang and Guowei Jin
Symmetry 2024, 16(9), 1173; https://doi.org/10.3390/sym16091173 - 6 Sep 2024
Viewed by 532
Abstract
The osprey optimization algorithm (OOA) is a metaheuristic algorithm with a simple framework, which is inspired by the hunting process of ospreys. To enhance its searching capabilities and overcome the drawbacks of susceptibility to local optima and slow convergence speed, this paper proposes [...] Read more.
The osprey optimization algorithm (OOA) is a metaheuristic algorithm with a simple framework, which is inspired by the hunting process of ospreys. To enhance its searching capabilities and overcome the drawbacks of susceptibility to local optima and slow convergence speed, this paper proposes a modified osprey optimization algorithm (MOOA) by integrating multiple advanced strategies, including a Lévy flight strategy, a Brownian motion strategy and an RFDB selection method. The Lévy flight strategy and Brownian motion strategy are used to enhance the algorithm’s exploration ability. The RFDB selection method is conducive to search for the global optimal solution, which is a symmetrical strategy. Two sets of benchmark functions from CEC2017 and CEC2022 are employed to evaluate the optimization performance of the proposed method. By comparing with eight other optimization algorithms, the experimental results show that the MOOA has significant improvements in solution accuracy, stability, and convergence speed. Moreover, the efficacy of the MOOA in tackling real-world optimization problems is demonstrated using five engineering optimization design problems. Therefore, the MOOA has the potential to solve real-world complex optimization problems more effectively. Full article
(This article belongs to the Special Issue Symmetry in Intelligent Algorithms)
Show Figures

Figure 1

Back to TopTop