This study introduces the ’Black-Backed Jackal Optimization’ (BBJO), a nature-inspired meta-heuristic algorithm designed for complex, non-linear, and high-dimensional search spaces. The fundamental mathematical model of BBJO relies on the opportunistic hunting behavior and survivability strategies of the black-backed jackal (Lupulella mesomelas). We use non-linear energy decrease and adaptive Lévy flight to maintain the equilibrium of the search. This allows the algorithm to scan large areas first, then zoom in with a high degree of precision once it has identified a suitable location. This configuration prevents the algorithm from getting stuck on a suboptimal local solution, which is a frequent danger during searches in complex spaces. BBJO has been validated against 23 standard benchmark functions, demonstrating significantly greater accuracy than Particle Swarm Optimization (PSO) on complex and large-scale search spaces. On fixed-size domains (–), the BBJO algorithm achieved a 100% success rate with zero standard deviation, surpassing the Grey Wolf Optimizer (GWO) and Differential Evolution (DE), which frequently suffered from structural stagnation. Visual convergence study shows that BBJO efficiently identifies optimal search regions early in the iteration budget, saving time compared to traditional linear decay models. BBJO optimizes fuzzy inference systems (FISs) for two practical applications: autonomous car speed control and industrial furnace regulation. Experimental results indicate that BBJO significantly decreased cumulative penalties and improved steady-state error reduction compared to baseline configurations and established meta-heuristic methods. The results show that BBJO is a reliable and useful technique for engineering optimization.
The Hopfield Recurrent Neural Network (HRNN) is a single-point descent metaheuristic that uses a single potential solution to explore the search space of optimization problems, whose constraints and objective function are aggregated into a typical energy function. The initial point is usually randomly initialized, then moved by applying operators, characterizing the discrete dynamics of the HRNN, which modify its position or direction. Like all single-point metaheuristics, HRNN has certain drawbacks, such as being more likely to get stuck in local optima or miss global optima due to the use of a single point to explore the search space. Moreover, it is more sensitive to the initial point and operator, which can influence the quality and diversity of solutions. Moreover, it can have difficulty with dynamic or noisy environments, as it can lose track of the optimal region or be misled by random fluctuations. To overcome these shortcomings, this paper introduces a population-based fuzzy version of the HRNN, namely Gaussian Takagi–Sugeno Hopfield Recurrent Neural Network (G-TS-HRNN). For each neuron, the G-TS-HRNN associates an input fuzzy variable of d values, described by an appropriate Gaussian membership function that covers the universe of discourse. To build an instance of G-TS-HRNN(s) of size s, we generate s n-uplets of fuzzy values that present the premise of the Takagi–Sugeno system. The consequents are the differential equations governing the dynamics of the HRNN obtained by replacing each premise fuzzy value with the mean of different Gaussians. The steady points of all the rule premises are aggregated using the fuzzy center of gravity equation, considering the level of activity of each rule. G-TS-HRNN is used to solve the random optimization method based on the support vector model. Compared with HRNN, G-TS-HRNN performs better on well-known data sets.
While Graph Autoencoders (GAEs) have become a standard for unsupervised representation learning, their reliance on integer-order convolutions inherently restricts information propagation to immediate local neighborhoods. This paper introduces the Fractional Graph Autoencoder (FGAE) and its variational extension (FVGAE) to move beyond these local constraints. By integrating fractional Laplace operators, our framework generalizes conventional GAEs and enables tunable non-local propagation. We show that the fractional order acts as a structural regularizer, utilizing the Green’s function of anomalous diffusion to induce a form of structural memory within the latent space. This allows the model to recover long-range dependencies that are typically lost in standard architectures. Systematic benchmarking across eight datasets—ranging from homophilic citation networks to heterophilic and dense product graphs—shows that these fractional variants consistently outperform both foundational and state-of-the-art baselines (ARGA, SIG-VAE, and GraphMAE). Notably, on the Amazon Computers and Citeseer datasets, our methods achieve relative increases in Normalized Mutual Information (NMI) of 77.55% and 67.28%, respectively. Statistical analysis confirms these gains are robust, with large effect sizes (Cohen’s ) and significance at . These findings suggest that fractional graph autoencoding offers a mathematically grounded inductive bias for capturing the complex, multi-scale dynamics of real-world networked systems.
Complex-valued knowledge graph embedding (KGE) models like ComplEx effectively capture asymmetric relations but are fundamentally constrained by integer-order transformations. This restriction limits their ability to model multi-scale interactions, hierarchical correlations, and non-local semantic dependencies inherent in heterogeneous graphs. To address these limitations, this paper introduces FracComplEx, a novel fractional-order extension that embeds fractional calculus into the complex latent space. By leveraging fractional operators, the framework introduces non-local dynamics and memory-aware mechanisms to continuously generalize standard linear transformations. The core architecture employs a fractional-order parameter as a controllable scaling mechanism that balances local relational details with global topology, optimizing representation smoothness and flexibility. We provide rigorous theoretical findings demonstrating that fractional transformations enhance the embedding’s expressive capacity, spectral characteristics, and perturbation robustness beyond conventional integer-order benchmarks. Extensive experiments on FB15k-237, WN18RR, and CoDEx-M establish the empirical superiority of FracComplEx, yielding significant improvements in Mean Reciprocal Rank (MRR) and Hits@K metrics over classical baselines, particularly under severe structural data sparsity.