Knowledge Tracing (KT) aims to model students' evolving knowledge states and predict their future performance. Traditional sequential models often struggle with long-range dependencies due to inefficient memory retention and high computational costs, limiting their effectiveness in capturing students' continuous learning trajectories. Meanwhile, graph-based KT models effectively represent knowledge concept relationships but are not designed for sequential modeling. To address these challenges, we propose DualFlowKT, a novel model that employs a dual-path architecture, integrating Graph Neural Networks (GNNs) for structured knowledge modeling and the Mamba state space model for efficient long-sequence learning. Specifically, the graph-based path extracts relational dependencies among knowledge concepts, while the sequential path leverages Mamba's selective state-space modeling to effectively capture long-range learning patterns with enhanced memory efficiency and reduced computational overhead. To further enhance input representations, we introduce a Feature Enhancement Module (FEM) that extracts critical learning features such as concept continuity, learning rate, and adaptive difficulty. Additionally, a gated fusion mechanism dynamically integrates knowledge structure representations from GNNs with sequential dependencies captured by Mamba, allowing the model to adaptively balance structural and temporal learning information. Extensive experiments on multiple KT benchmark datasets demonstrate that DualFlowKT outperforms existing methods, particularly in handling long-sequence interactions and complex knowledge structures. Furthermore, the model provides deeper insights into students' evolving knowledge states, supporting personalized education systems.

Knowledge tracing (KT) is an essential technique for predicting students' future performance based on the analysis of their previous learning activities. The exploration of question relevance has been shown to have a significant impact on predicting student performance. However, existing studies rely on basic attention mechanisms when investigating relevance, without fully utilizing the relationships between questions, concepts, and interactions. Additionally, current methods often neglect the number of repetitions on specific concepts when modeling forgetting behavior. This paper introduces a new knowledge tracing model that integrates multiple features into the attention mechanism to track and predict students' mastery of questions more accurately. Specifically, we explore question correlation from two perspectives: co-occurrence and answer consistency. Then, a forgetting feature is introduced to simulate the natural process of students gradually forgetting previously learned knowledge over time, considering the effects of repeated learning of the same concepts and the intervals between learning sessions. Experimental results demonstrate that our model surpasses existing popular and state-of-the-art knowledge tracing models on multiple metrics and robustness, effectively enhancing the quality of educational instruction and aids in the realization of personalized learning.

Dimensionality Reduction (DR) methods have become essential tools for the data analysis toolbox. Typically, DR methods combine features of a multivariate dataset to produce dimensions in a reduced space, preserving some data properties, usually pairwise distances or local neighborhoods. Preserving such properties makes DR methods attractive, but it is also one of their weaknesses. When calculating the embedded dimensions, usually through non-linear strategies, the original feature values are lost and not explicitly represented in the spatialization of the produced layouts, making it challenging to interpret the results and understand the features’ contributions to the attained representations. Some strategies have been proposed to tackle this issue, such as coloring the DR layouts or generating explanations. Still, they are post-processes, so specific features (values) are not guaranteed to be preserved or represented. This paper proposes DimenFix , a novel meta-DR strategy that explicitly preserves the values of a particular user-defined feature or external data (not used to generate a layout) in one of the embedded axes. DimenFix can be used to preserve ordinal (e.g., numerical measures) and nominal (e.g., labels) values and works with virtually any gradient-descent DR method. It requires minimum changes to the underlying DR technique, running in linear time considering the number of data instances. In our results, involving Force Scheme and t-SNE adaptations, DimenFix was capable of representing features without heavily impacting distance or neighborhood preservation, allowing for creating hybrid layouts that join characteristics of scatter plots and DR methods.

Community detection reveals the unique characteristics and relationships of in-network members, differentiated from out-of-community members and plays a pivotal role in network analysis. In recent years, deep learning techniques have made great strides in the application of community detection, especially on label sampling models, which train graph convolutional networks by constructing a balanced training set through structural centre localization and neighbourhood node expansion. However, such algorithms are limited on centre selection in community structure. To address this, this paper introduces a novel community detection algorithm based on peak density adaptive iterative segmentation, or LDACN in short. First, labels are assigned by adaptively selecting the centre node of the community structure, which results in a more even distribution of labels in the network. Subsequently, more accurate community segmentation is achieved by taking advantage of GCN's combined ability in capturing the connectivity relationships between the nodes and their intrinsic characteristics. Experimental results on synthetic and real-world network datasets show that our algorithm improves the effectiveness of community segmentation compared to the state-of-the-art algorithms.

Influence maximization plays a pivotal role in areas such as cybersecurity, public opinion management, and viral marketing. However, conventional methods for influence maximization grapple with challenges such as seed node clustering, information loss during influence propagation, and biases in overlapping influence consideration. In response to these issues, we introduce Fast Unfold Diffusion (FUD)- an influence maximization algorithm capitalizing on the uniform distribution characteristics in node space and the non-overlapping local features of nodes. This approach aims to facilitate swift and extensive global diffusion of node influence. The performance of our algorithm was validated through the execution of two hundred diffusion simulations, employing the Independent Cascade (IC) diffusion model across six real-world datasets. Compared to the latest algorithms, our algorithm offers substantial benefits in expanding the range of influence diffusion, the speed of influence diffusion and the stability of the algorithm. This not only effectively mitigates the problems found in traditional methodologies but also ensures a significant enhancement in the efficiency of influence maximization.

In recent years, the rapid development and widespread applications of non-overlapping community discovery have led to a growing issue of privacy leakage. The core of this problem lies in the community discovery algorithms themselves. Researchers have shifted their focus toward developing community hiding algorithms. However, existing non-overlapping community hiding algorithms have mainly been studied in static networks, overlooking the prevalence of dynamic networks in real life. In this paper, we introduce a community hiding algorithm called LALH, which employs the link prediction likelihood analysis method. The algorithm consists of two parts: first, the OLPL algorithm calculates a list of link probabilities in the subsequent time scale of the network, allowing observation of important link distribution. Second, the LALH algorithm selects these crucial links for the community hiding operation. We validate the effectiveness of the LALH algorithm through experiments on three public datasets and a real Twitter dataset.