ANAhmed Nuino
Ahmed Nuino
*This is an algorithmically generated author record based on publicly available information.
Ahmed Nuino has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Karim El Moutaouakil
Laboratory of Mathematics and Data Science, Polydisciplinary of Taza, Sidi Mohamed Ben Abdellah University, Taza 30000, Morocco
1 shared publication - Mustapha Ez-Zaiym
Laboratory of Mathematics and Data Science, Polydisciplinary of Taza, Sidi Mohamed Ben Abdellah University, Taza 30000, Morocco
1 shared publication - Omar Bahou
Laboratory of Mathematics and Data Science, Polydisciplinary of Taza, Sidi Mohamed Ben Abdellah University, Taza 30000, Morocco
1 shared publication - Savin Treanţă
Department of Applied Mathematics, National University of Science and Technology POLITEHNICA Bucharest, Bucharest, Romania
1 shared publication - Senhaji Yassine
Laboratory of Mathematics and Data Science, Polydisciplinary of Taza, Sidi Mohamed Ben Abdellah University, Taza 30000, Morocco
1 shared publication
Latest Publications
- Open Access
- 3 July 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (7) , 109
Fractional Complex Representation Learning with Memory Effects for Multi-Scale Knowledge Graph Modeling
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.- 3 July 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (7) , 109
Open AccessFractional Complex Representation Learning with Memory Effects for Multi-Scale Knowledge Graph Modeling
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.