Algorithmic graph theory and optimisation represents a critical nexus between discrete mathematics and computer science, underpinning the development of efficient methodologies for analysing complex ...

The algorithm based on the UBQP model (Aref et al. 2018) for computing the exact value of frustration index (also called line index of balance) ...

The default number of initial edges for each node in a default graph (ANNG) is a fixed value 10. To optimize the number, first, the objects should be inserted without building indexes as follows.

Abstract: High-adaptability learning path optimization aims to generate personalized learning trajectories that align with learners' cognitive characteristics based on their current knowledge states ...

Abstract: In this study, we proposed a new method combining graph sampling aggregation network (GraphSAGE), Contrastive Learning (CL) and Bayesian Optimization. First, GraphSAGE was used to model the ...