期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到2,286篇文章
< 1 2 … 115 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Optimization of fault tolerance for iterative graph algorithm in spark GraphX based on high performance computing cluster 认领 引用
1
作者 Mengsi He Zhongming Fu Wenlong Tian 《CCF Transactions on High Performance Computing》 EI CSCD 2025年第5期465-477,共13页
GraphX is a graph computing library based on Spark systems,where fault tolerance is a necessary guarantee for the high availability.However,the existing fault tolerance methods are mostly implemented in a pessimistic ... GraphX is a graph computing library based on Spark systems,where fault tolerance is a necessary guarantee for the high availability.However,the existing fault tolerance methods are mostly implemented in a pessimistic way and are aimed at general computing tasks.Considering the characteristics of iterative computation,this paper presents a combination method of the optimistic fault tolerance and checkpoint for recovering the data under different failure conditions.Firstly,for single node failure,we propose the optimistic fault tolerance mechanism based on compensation function.It does not add fault tolerance measures in advance and will not incur additional costs when there are no failures.Secondly,for multiple node failures,we propose the automatic checkpoint management strategy based on RDD importance.It comprehensively considers the factors of lineage length of RDD,dependency relationship,and computation time of RDD,which can set the RDD as the checkpoint properly.Finally,we implement our proposals in GraphX of Spark−3.5.1,and evaluate the performance by using representative iterative graph algorithms on the high performance computing cluster.The results verify the correctness of iteration results of the mechanism,and illustrate that when recovering the RDD partition,the job execution time can be reduced by the mechanism and strategy substantially. 展开更多
关键词 Fault tolerance Iterative graph algorithm Spark GraphX High performance computing
基于图计算框架Spark GraphFrames的路网分区算法 认领 引用
2
作者 任刚 郜广兰 +1 位作者 刘小杰 王朝云 《河南工学院学报》 CAS 2026年第4期14-17,共4页
提出一种基于图计算框架Spark GraphFrames的路网分区算法SG-RNPA。该算法利用路网拓扑结构创建图模型,以交通流量为依据,利用标签传播算法实现交通子区识别。依托Spark GraphFrames的分布式图计算能力,SG-RNPA能够处理城市级大规模路... 提出一种基于图计算框架Spark GraphFrames的路网分区算法SG-RNPA。该算法利用路网拓扑结构创建图模型,以交通流量为依据,利用标签传播算法实现交通子区识别。依托Spark GraphFrames的分布式图计算能力,SG-RNPA能够处理城市级大规模路网数据。实验结果表明,所提算法能够有效识别交通子区,分区结果在均衡性及结构合理性方面表现良好。 展开更多
关键词 交通分区 Spark GraphFrames 图计算 标签传播算法
暂未订购 下载PDF
Hashgraph共识算法研究与优化 认领 引用
3
作者 王迪 曹广平 雷航 《计算机工程与设计》 北大核心 2026年第1期113-119,共7页
针对Hashgraph共识过程中事件接受延迟高、共识率低的问题,提出一种基于贪心Gossip策略的Hashgraph共识算法,使哈希图中新创建的事件尽可能多的可见和强可见祖先事件,加快轮次的提升与事件的接受。实验结果表明,该算法在相同轮次下所需... 针对Hashgraph共识过程中事件接受延迟高、共识率低的问题,提出一种基于贪心Gossip策略的Hashgraph共识算法,使哈希图中新创建的事件尽可能多的可见和强可见祖先事件,加快轮次的提升与事件的接受。实验结果表明,该算法在相同轮次下所需事件数与事件被接受所需轮次数均少于Hashgraph,共识率与吞吐量均优于Hashgraph,且共识率波动更小,同时保持了与原有算法几乎一致的安全性和计算开销。 展开更多
关键词 哈希图 共识算法 虚拟投票 强可见 有向无环图 见证者 汉明距离
暂未订购 下载PDF
Formal Derivation of Graph AlgorithmicPrograms Using Partition-and-Recur 认领 引用 被引量：27
4
作者 薛锦云 《Journal of Computer Science & Technology》 SCIE EI 1998年第6期553-561,共9页
In this paper, we derive, by presenting some suitable notations, three typical graph aLgorithms and corresponding programs using a unified approach, partition-and-recur. We putemphasis on the derivation rather than th... In this paper, we derive, by presenting some suitable notations, three typical graph aLgorithms and corresponding programs using a unified approach, partition-and-recur. We putemphasis on the derivation rather than the algorithms themselves. The main ideas and lugesnutty of these algorithms are revealed by formula deduction. Success in these examples givesus more evidence that partition-and-recur is a simple and practical approach and developingenough suitable notations is the key in designing and deriving efficient and correct algorithmicprograms. 展开更多
关键词 Graph Algorithms method of algorithm design program derivation formalmethod.
暂未订购 下载PDF
Task Graph Reduction Algorithm for Hardware/Software Partitioning 认领 引用 被引量：2
5
作者 LI Hui LIU Wenjui +2 位作者 WU Jigang JIANG Guiyuan HAN Honglei 《Wuhan University Journal of Natural Sciences》 CAS 2012年第2期126-130,共5页
Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with p... Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy. 展开更多
关键词 HW/SW partitioning task graph algorithm embedded system
暂未订购 下载PDF
User-Oriented Graph Based Frequency Allocation Algorithm for Densely Deployed Femtocell Network 认领 引用 被引量：9
6
作者 栾智荣 曲桦 +1 位作者 赵季红 徐西光 《China Communications》 SCIE CSCD 2013年第12期57-65,共9页
Femtocell is a promising technology for improving indoor coverage and offloading the macrocell.Femtocells tend to be densely deployed in populated areas such as the dormitories.However,the inter-tier interference seri... Femtocell is a promising technology for improving indoor coverage and offloading the macrocell.Femtocells tend to be densely deployed in populated areas such as the dormitories.However,the inter-tier interference seriously exists in the co-channel Densely Deployed Femtocell Network(DDFN).Since the Femtocell Access Points(FAPs) are randomly deployed by their customers,the interference cannot be predicted in advance.Meanwhile,new characteristics such as the short radius of femtocell and the small number of users lead to the inefficiency of the traditional frequency reuse algorithms such as Fractional Frequency Reuse(FFR).Aiming for the downlink interference coordination in the DDFN,in this paper,we propose a User-oriented Graph based Frequency Allocation(UGFA)algorithm.Firstly,we construct the interference graph for users in the network.Secondly,we study the conventional graph based resources allocation algorithm.Then an improved two steps graph based frequency allocation mechanism is proposed.Simulation results show that UGFA has a high frequency reuse ratio mean while guarantees a better throughput. 展开更多
关键词 densely deployed femtocell net-work interference coordination frequency res-ource management graph based algorithms
暂未订购 下载PDF
A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain 认领 引用 被引量：1
7
作者 Shujiang Xu Ziye Wang +4 位作者 Lianhai Wang Miodrag J.Mihaljevi′c Shuhui Zhang Wei Shao Qizheng Wang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第6期3311-3327,共17页
Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,tra... Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,transaction performance and scalability has become the main challenges hindering the widespread adoption of blockchain.Due to its inability to meet the demands of high-frequency trading,blockchain cannot be adopted in many scenarios.To improve the transaction capacity,researchers have proposed some on-chain scaling technologies,including lightning networks,directed acyclic graph technology,state channels,and shardingmechanisms,inwhich sharding emerges as a potential scaling technology.Nevertheless,excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected aim.This paper proposes a graphbased sharding scheme for public blockchain to efficiently balance the transaction distribution.Bymitigating crossshard transactions and evening-out workloads among shards,the scheme reduces transaction confirmation latency and enhances the transaction capacity of the blockchain.Therefore,the scheme can achieve a high-frequency transaction as well as a better blockchain scalability.Experiments results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%-56%and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards. 展开更多
关键词 Blockchain sharding graph partitioning algorithm
暂未订购 下载PDF
A Graph Drawing Algorithm for Visualizing Multivariate Categorical Data 认领 引用
8
作者 HUANG Jingwei HUANG Jie 《Wuhan University Journal of Natural Sciences》 CAS 2007年第2期239-242,共4页
In this paper, a new approach for visualizing multivariate categorical data is presented. The approach uses a graph to represent multivariate categorical data and draws the graph in such a way that we can identify pat... In this paper, a new approach for visualizing multivariate categorical data is presented. The approach uses a graph to represent multivariate categorical data and draws the graph in such a way that we can identify patterns, trends and relationship within the data. A mathematical model for the graph layout problem is deduced and a spectral graph drawing algorithm for visualizing multivariate categorical data is proposed. The experiments show that the drawings by the algorithm well capture the structures of multivariate categorical data and the computing speed is fast. 展开更多
关键词 multivariate categorical data graph graph drawing algorithms
暂未订购 下载PDF
The Refinement Algorithm Consideration in Text Clustering Scheme Based on Multilevel Graph 认领 引用
9
作者 CHENJian-bin DONGXiang-jun SONGHan-tao 《Wuhan University Journal of Natural Sciences》 EI CAS 2004年第5期671-675,共5页
To construct a high efficient text clustering algorithm the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of ... To construct a high efficient text clustering algorithm the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of clustering algorithm has to be improved with the refinement algorithm application. The experiment result demonstrated that the multilevel graph text clustering algorithm is available. Key words text clustering - multilevel coarsen graph model - refinement algorithm - high-dimensional clustering CLC number TP301 Foundation item: Supported by the National Natural Science Foundation of China (60173051)Biography: CHEN Jian-bin(1970-), male, Associate professor, Ph. D., research direction: data mining. 展开更多
关键词 text clustering multilevel coarsen graph model refinement algorithm high-dimensional clustering
暂未订购 下载PDF
Betweenness-based algorithm for a partition scale-free graph 认领 引用
10
作者 张百达 吴俊杰 +1 位作者 唐玉华 周静 《Chinese Physics B》 SCIE EI CAS CSCD 2011年第11期556-564,共9页
Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that... Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom-up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top-down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches. 展开更多
关键词 graph partitioning betweenness-based partitioning algorithm scale free network
暂未订购 下载PDF
基于GraphSAGE算法的电力物联设备故障预测 认领 引用 被引量：1
11
作者 李世豪 曾锃 +3 位作者 缪巍巍 夏元轶 刘鹏飞 赵海涛 《计算机技术与发展》 2025年第5期145-151,共7页
电力系统的安全稳定运行是保障国家能源安全和经济发展的关键,而这在很大程度上依赖于对电力物联设备故障的准确预测。当前,随着电力物联网技术的发展,大量的数据被采集,但这些数据的潜在价值尚未得到充分挖掘,这在一定程度上限制了故... 电力系统的安全稳定运行是保障国家能源安全和经济发展的关键,而这在很大程度上依赖于对电力物联设备故障的准确预测。当前,随着电力物联网技术的发展,大量的数据被采集,但这些数据的潜在价值尚未得到充分挖掘,这在一定程度上限制了故障预测的准确性,影响了电力系统的可靠运行。针对这一问题,该文提出了一种创新的基于GraphSAGE(Graph Sample and Aggregate)算法的电力物联设备故障预测。该方法通过PowerGraph数据集,将电力物联设备故障场景细分为四类,利用GraphSAGE模型的特性,深入学习和分析节点特征与边特征,从而实现对物联设备故障的有效预测。实验结果表明,该方法准确率达到97.5%,相较于其它传统方法,准确率提高了0.39%~6.21%,同时GraphSAGE模型实现了快速训练。该方法为电力物联设备安全稳定运行提供重要决策支持,能够对动态和相互联系的复杂系统进行更精细的分析,并增强电力系统运营部门对潜在干扰的预见和应对能力。 展开更多
关键词 电力系统 电力物联网 GraphSAGE算法 电力物联设备故障 有效预测
暂未订购 下载PDF
A Linear-Time Algorithm for 2-Step Domination in Block Graphs 认领 引用
12
作者 Yancai ZHAO Lianying MIAO Zuhua LIAO 《Journal of Mathematical Research with Applications》 CSCD 2015年第3期285-290,共6页
The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method,... The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method, we provide an O（m） time algorithm to solve the 2-step domination problem on block graphs, a superclass of trees. 展开更多
关键词 2-step domination block graph algorithm labeling method
暂未订购 下载PDF
Dual-stage constructed random graph algorithm to generate random graphs featuring the same topological characteristics with power grids 认领 引用
13
作者 Shiqian MA Yixin YU Lei ZHAO 《Journal of Modern Power Systems and Clean Energy》 SCIE EI 2017年第5期683-695,共13页
It is a common practice to simulate some historical or test systems to validate the efficiency of new methods or concepts. However, there are only a small number of existing power system test cases, and validation and... It is a common practice to simulate some historical or test systems to validate the efficiency of new methods or concepts. However, there are only a small number of existing power system test cases, and validation and evaluation results, obtained using such a limited number of test cases, may not be deemed sufficient or convincing. In order to provide more available test cases, a new random graph generation algorithm, named ‘‘dualstage constructed random graph’’ algorithm, is proposed to effectively model the power grid topology. The algorithm generates a spanning tree to guarantee the connectivity of random graphs and is capable of controlling the number of lines precisely. No matter how much the average degree is,whether sparse or not, random graphs can be quickly formed to satisfy the requirements. An approach is developed to generate random graphs with prescribed numbers of connected components, in order to simulate the power grid topology under fault conditions. Our experimental study on several realistic power grid topologies proves that the proposed algorithm can quickly generate a large number of random graphs with the topology characteristics of real-world power grid. 展开更多
关键词 Power gird topology Dual-stage constructed random graph(DSCRG)algorithm Random graph generation Connectivity Average degree Connected component
Modelling of a WDM Network Using Graph Theory and Dijkstra Algorithm for Traffic Redirection 认领 引用
14
作者 Eric Michel Deussom Djomadji Ebude Carine Awasume Eloundou Boris Donald 《Journal of Computer and Communications》 2024年第7期78-93,共16页
Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investme... Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investments required to deploy these networks, particularly related to the cost of equipment (optical fibers, transponders and multiplexers), the optimization of bandwidth and dynamic allocation of resources is essential to control operating costs and ensure continuity of service. Automatic switching technology for optical networks brings intelligence to the control plane to fully facilitate bandwidth utilization, traffic redirection, and automatic configuration of end-to-end services. This paper considers a local network operator’s WDM network without the implementation of the automatic switching technology, develops a network modeling software platform called Graphic Networks and using graph theory integrates a particularity of the automatic switching technology, which is the automatic rerouting of traffic in case of incident in the network. The incidents considered here are those links or route failures and node failures. 展开更多
关键词 Graph Theory Backbone Network WDM Djikstra Algorithm
暂未订购 下载PDF
An O(n) Time Algorithm for Scheduling UET-UCT of Bipartite Digraphs of Depth One on Two Processors 认领 引用
15
作者 Ruzayn Quaddoura 《American Journal of Operations Research》 2016年第1期75-80,共6页
Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identi... Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identical processors in order to minimize the makespan. Several polynomial algorithms in the literature are proposed for special classes of digraphs, but the complexity of solving this problem in general case is still a challenging open question. We present in this paper an O(n) time algorithm to compute an optimal schedule for the class of bipartite digraphs of depth one. 展开更多
关键词 Scheduling Makespan Precedence Constraints Bipartite Graph Optimal Algorithm
暂未订购 下载PDF
基于图论算法与蚁群优化支持向量机的数控机床故障智能诊断 认领 引用 被引量：6
16
作者 迟玉伦 戴顺达 朱文博 《计算机集成制造系统》 EI CSCD 北大核心 2026年第2期706-719,共14页
针对传统数控机床故障诊断方法耗时且精度不足、无法满足快速诊断需求的问题,提出一种基于图论算法和蚁群优化支持向量机(ACO-SVM)的方法实现机床故障的快速精确诊断。首先,通过故障历史数据建立数控机床故障传播模型,利用图论算法进行... 针对传统数控机床故障诊断方法耗时且精度不足、无法满足快速诊断需求的问题,提出一种基于图论算法和蚁群优化支持向量机(ACO-SVM)的方法实现机床故障的快速精确诊断。首先,通过故障历史数据建立数控机床故障传播模型,利用图论算法进行分析,得到故障的风险影响度排序确定故障的优先级;然后,针对优先级较高的故障,利用传感器采集加工信号提取特征值构建特征向量;进一步,利用蚁群算法优化支持向量机参数,构建ACO-SVM故障诊断模型实现机床故障精确诊断;最后,通过实验对某公司轴承磨床磨削烧伤故障进行验证,结果表明:基于图论算法可对故障进行定位排序,利用ACO-SVM模型的诊断平均准确率达到99.378%,对提升数控机床故障快速维修及机床可靠性具有重要意义。 展开更多
关键词 支持向量机 图论算法 蚁群算法 故障诊断
暂未订购 下载PDF
融合知识图谱和Apriori算法的高风险作业致因分析与管控 认领 引用 被引量：1
17
作者 国汉君 崔华莹 +2 位作者 胡振启 康荣学 赵金龙 《中国安全科学学报》 EI CAS CSCD 北大核心 2026年第4期75-84,共10页
为提高高风险作业安全管理水平,提出一种基于知识图谱和Apriori算法的高风险作业智能精准管控方法。首先,搜集高风险作业相关事故案例,利用基于变换器的双向编码器表征-双向长短期记忆网络-条件随机场(BERT-BiLSTM-CRF)模型实现事故原... 为提高高风险作业安全管理水平,提出一种基于知识图谱和Apriori算法的高风险作业智能精准管控方法。首先,搜集高风险作业相关事故案例,利用基于变换器的双向编码器表征-双向长短期记忆网络-条件随机场(BERT-BiLSTM-CRF)模型实现事故原因自动分类抽取,并构建高风险作业知识图谱,存储相关事故数据;然后,结合作业标准规范构建高风险作业致因要素指标体系,并利用Apriori算法明确高风险作业致因要素之间的关联关系;最后,提出针对性管控措施,以有限空间作业为例开展具体阐述。结果表明:作业人员未佩戴安全防护装备、盲目施救、未配备气体检测等设备、安全警示标志缺失、安全教育培训不到位和安全管理不到位是导致有限空间作业事故发生的主要原因。安全教育不到位与未佩戴安全防护装备的关联度较大,支持度为80.7%,置信度为60.41%;安全教育培训不到位与盲目施救的关联性也较强,支持度为80.7%,置信度为55.88%。 展开更多
关键词 知识图谱 Apriori算法 高风险作业 智能化管控 致因要素
暂未订购 下载PDF
Algorithm for Visualization of Zero Divisor Graphs of the Ring ℤn Using MAPLE Coding 认领 引用
18
作者 Nasir Ali 《Open Journal of Discrete Mathematics》 2024年第1期1-8,共8页
This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤn modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict ... This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤn modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations. 展开更多
关键词 Zero Divisor Graph Ring Theory Maple Algorithm ℤn Modulo n Graph Theory Mathematical Computing
暂未订购 下载PDF
基于轻量级教育大模型的个性化实践学习资料动态推荐 认领 引用 被引量：3
19
作者 翟洁 李艳豪 +1 位作者 陈乐旋 郭卫斌 《计算机科学》 CSCD 北大核心 2026年第2期48-56,共9页
人工智能技术在教育领域的深度应用,已成为国家教育数字化转型的核心战略。在计算机实践教学领域,实践学习资料的精准推荐是提升学生学习效能与质量的重要途径。针对高校教育规模化与学生需求多元化之间的矛盾,提出一种基于轻量级教育... 人工智能技术在教育领域的深度应用,已成为国家教育数字化转型的核心战略。在计算机实践教学领域,实践学习资料的精准推荐是提升学生学习效能与质量的重要途径。针对高校教育规模化与学生需求多元化之间的矛盾,提出一种基于轻量级教育大模型的个性化实践学习资料推荐模型LightPLRec(Lightweight Personalized Learning Recommender for Dynamic Practice Materials),旨在依据学生个体特征的动态变化智能推荐个性化的实践学习资料。基于低算力需求的轻量级大模型,通过指令微调和强化学习方法构建了面向个性化实践学习资料推荐的教育大模型SPIR(Student Profile&Interest-based Re-commender)。通过整合多源异构数据,深度融入课程知识体系、学科前沿动态、产业发展趋势、国家战略导向,构建了跨学科、多模态的实践学习资料库,并设计了图转主题文本方法gragh2topic。依托于SPIR大模型的强大赋能和多源资料库的坚实支撑,提出了基于智能工作流的资料推荐方法。设计主题分析方法从学生能力评估结果中提取学生的能力特征,应用图卷积网络算法GCN从学生学习行为数据中挖掘学生的兴趣特征,创建了“能力-推荐智能体”和“兴趣-推荐智能体”,构建了双智能体协同驱动的智能化流程体系,实现了从学生个性化画像智能生成到实践学习资料动态推荐的系列工作流任务;并且构建了个性化资料推荐数据集,在该数据集上验证了所提模型的性能显著优于基线模型。其中,以Qwen2.5-3.0B为基模型训练的LightPLRec模型,在能力推荐与兴趣推荐这两项任务中展现出卓越性能,准确率分别高达0.947和0.939,其表现均优于DeepSeek-V3在同一数据集上的测评结果。该研究为教育大模型的垂直场景应用提供了技术范式,同时通过创建个性化实践学习资料动态推荐模型,为践行“因材施教”理念和培育高素质计算机实践人才提供了创新路径。 展开更多
关键词 轻量级教育大模型 个性化推荐 GCN算法 智能工作流 智能体 强化学习
暂未订购 下载PDF
基于PageRank采样和注意力卷积聚合改进GraphSAGE网络的Facebook页面分类算法 认领 引用
20
作者 王世行 马儇龙 《伊犁师范大学学报（自然科学版）》 2025年第3期69-78,共10页
GraphSAGE网络在节点分类、图分类、链接预测和图生成等任务上具有良好的表现,然而在节点采样过程中的随机性会导致丢失重要节点信息,在特征聚合过程中简单加权聚合对邻居特征差异表现不敏感导致分类精度低.为了解决这一问题,提出了一... GraphSAGE网络在节点分类、图分类、链接预测和图生成等任务上具有良好的表现,然而在节点采样过程中的随机性会导致丢失重要节点信息,在特征聚合过程中简单加权聚合对邻居特征差异表现不敏感导致分类精度低.为了解决这一问题,提出了一种基于节点采样和特征聚合改进GraphSAGE网络的分类算法.首先,按照PageRank算法所得节点权重进行节点采样;其次,采用基于图注意力系数的图卷积网络进行特征聚合;最后,将特征送入分类器转化成为类别概率,进行分类.在数据集FacebookPagePage上进行对比实验,结果表明,改进的方法在多个采样参数条件下比原始方法准确率都有所提高,并且与GNN、GCN和GAT的分类准确率、精确率、召回率和F1分数进行对比,均有所提升. 展开更多
关键词 GraphSAGE PageRank算法 注意力机制 图卷积网络
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 115 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈