Under the background of China Education Modernization 2035 and Education 4.0, promoting the integration and innovation of intelligent technology and basic education evaluation is the necessary path for education evalu...
详细信息
knowledge Graph (KG)-augmented Large Language Models (LLMs) have recently propelled significant advances in complex reasoning tasks, thanks to their broad domain knowledge and contextual awareness. Unfortunately, curr...
详细信息
With the ongoing advancement of deep learning, modern network intrusion detection systems increasingly favor utilizing deep learning networks to improve their ability to learn traffic characteristics. To address the c...
详细信息
The massive multiple-input and multiple-output (MIMO) system based on channel state information (CSI) is the core technology of next-generation communication. As the complexity of the CSI matrix gradually increases, C...
详细信息
Low-light images are usually affected by problems such as low illumination, noise, and color distortion, resulting in unsatisfactory image enhancement. Low-light image enhancement aims to improve the quality and visib...
详细信息
In the context of the publication of the "Thirteenth Five-Year Plan for Educational Informationization," and China’s entry into the era of education informatization, the integration of information technolog...
详细信息
Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of ***,most existing stud...
详细信息
Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of ***,most existing studies on the IM problem focus on static social network features,while neglecting the features of temporal social *** bridge this gap,we focus on node features reflected by their historical interaction behavior in temporal social networks,i.e.,interaction attributes and self-similarity,and incorporate them into the influence maximization algorithm and information propagation ***,we propose a node feature-aware voting algorithm,called ISVoteRank,for seed nodes ***,before voting,the algorithm sets the initial voting ability of nodes in a personalized manner by combining their *** the voting process,voting weights are set based on the interaction strength between nodes,allowing nodes to vote at different extents and subsequently weakening their voting ability *** process concludes by selecting the top k nodes with the highest voting scores as seeds,avoiding the inefficiency of iterative seed selection in traditional voting-based ***,we extend the Independent Cascade(IC)model and propose the Dynamic Independent Cascade(DIC)model,which aims to capture the dynamic features in the information propagation process by combining node ***,experiments demonstrate that the ISVoteRank algorithm has been improved in both effectiveness and efficiency compared to baseline methods,and the influence spread through the DIC model is improved compared to the IC model.
Both structured market data and unstructured financial news data can significantly affect stock price fluctuations. Therefore, relying only on a single data source for stock price trend prediction may produce informat...
详细信息
The influence maximization(IM)problem aims to find a set of seed nodes that maximizes the spread of their influence in a social *** positive influence maximization(PIM)problem is an extension of the IM problem,which c...
详细信息
The influence maximization(IM)problem aims to find a set of seed nodes that maximizes the spread of their influence in a social *** positive influence maximization(PIM)problem is an extension of the IM problem,which consider the polar relation of nodes in signed social networks so that the positive influence of seeds can be the most widely *** solve the PIM problem,this paper proposes the polar and decay related independent cascade(IC-PD)model to simulate the influence propagation of nodes and the decay of information during the influence propagation in signed social *** overcome the low efficiency of the greedy based algorithm,this paper defines the polar reverse reachable(PRR)set and devises a signed reverse influence sampling(SRIS)*** algorithm utilizes the ICPD model as well as the PRR set to select *** are two phases in *** is the sampling phase,which utilizes the IC-PD model to generate the PRR set and a binary search algorithm to calculate the number of needed PRR *** other is the node selection phase,which uses a greedy coverage algorithm to select optimal ***,Experiments on three real-world polar social network datasets demonstrate that SRIS outperforms the baseline algorithms in *** on the Slashdot dataset,SRIS achieves 24.7% higher performance than the best-performing compared algorithm under the weighted cascade model when the seed set size is 25.
In recent years, significant progress has been made in image dehazing, but most dehazing convolutional neural networks only learn from hazy images to the corresponding feature maps of clean images, ignoring the detail...
详细信息
暂无评论