检索结果-内蒙古大学图书馆

A general tail item representation enhancement framework for sequential recommendation

Frontiers of Computer Science 2024年第6期18卷 137-148页

作者： Mingyue CHENG Qi LIU Wenyu ZHANG Zhiding LIU Hongke ZHAO Enhong CHEN Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China&State Key Laboratory of Cognitive IntelligenceHefei 230026China College of Management and Economics Tianjin UniversityTianjin 300072China

Recently advancements in deep learning models have significantly facilitated the development of sequential recommender systems(SRS).However,the current deep model structures are limited in their ability to learn high-quality embeddings with insufficient ***,highly skewed long-tail distribution is very common in recommender ***,in this paper,we focus on enhancing the representation of tail items to improve sequential recommendation *** empirical studies on benchmarks,we surprisingly observe that both the ranking performance and training procedure are greatly hindered by the poorly optimized tail item *** address this issue,we propose a sequential recommendation framework named TailRec that enables contextual information of tail item well-leveraged and greatly improves its corresponding *** the characteristics of the sequential recommendation task,the surrounding interaction records of each tail item are regarded as contextual information without leveraging any additional side *** approach allows for the mining of contextual information from cross-sequence behaviors to boost the performance of sequential *** a light contextual filtering component is plug-and-play for a series of SRS *** verify the effectiveness of the proposed TailRec,we conduct extensive experiments over several popular benchmark *** experimental results demonstrate that TailRec can greatly improve the recommendation results and speed up the training *** codes of our methods have been available.

关键词： sequential recommendation long-tail distribution training accelerating

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous-attributes enhancement deep framework for network embedding

引用

Frontiers of Computer Science 2021年第6期15卷 121-131页

作者： Lisheng QIAO Fan ZHANG Xiaohui HUANG Kai LI Enhong CHEN Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of ChinaHefei 230022China National Key Laboratory of Blind Signal Processing Chengdu 610041China School of Computer Science and Technology University of Science and Technology of ChinaHefei 230022China

Network embedding,which targets at learning the vector representation of vertices,has become a crucial issue in network ***,considering the complex structures and heterogeneous attributes in real-world networks,existing methods may fail to handle the inconsistencies between the structure topology and attribute ***,more comprehensive techniques are urgently required to capture the highly non-linear network structure and solve the existing inconsistencies with retaining more *** that end,in this paper,we propose a heterogeneous-attributes enhancement deep framework(HEDF),which could better capture the non-linear structure and associated information in a deep learningway,and effectively combine the structure information of multi-views by the combining *** this line,the inconsistencies will be handled to some extent and more structure information will be preserved through a semi-supervised *** extensive validations on several real-world datasets show that our model could outperform the baselines,especially for the sparse and inconsistent situation with less training data.

关键词： network embedding heterogeneous-attributes deep framework inconsistent

来源：评论

学校读者我要写书评

暂无评论

GL-BKGNN: Graphlet-based Bi-Kernel Interpretable Graph Neural Networks

引用

Information fusion 2025年

作者： Lixiang Xu Kang Jiang Xin Niu Enhong Chen Bin Luo Philip S. Yu School of Artificial Intelligence Hefei Institute of Technology Hefei China School of Artificial Intelligence and Big Data Hefei University Hefei China Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China Hefei China Department of Computer Science University of Illinois at Chicago Chicago IL USA

While graph neural networks (GNNs) have successfully applied generalized convolution operations to the graph domain, providing a direct method to explain the dependency between the output and the presence of certain features and structural patterns in the input graph remains challenging. Inspired by image filters in standard convolutional neural networks (CNN), we propose a neural framework that connects bi-kernel with GNNs, incorporating predefined rules and focusing on the interpretability of graph filters during training. We address graph kernels based on their differentiability, using backpropagation of differentiable graph kernels for end-to-end training to generate gradient information for model optimization. Simultaneously, we leverage the stronger stability of non-differentiable graph kernels to capture local critical subgraphs, achieving deep fusion of structural features for node updates. Extensive experiments demonstrate that our model achieves competitive performance on graph classification datasets while providing additional benefits in interpretability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adam revisited:a weighted past gradients perspective

引用

Frontiers of Computer Science 2020年第5期14卷 61-76页

作者： Hui Zhong Zaiyi Chen Chuan Qin Zai Huang Vincent W.Zheng Tong Xu Enhong Chen Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of ChinaHefei230027China Zhejiang Cainiao Supply Chain Management Co.Ltd Hangzhou311122China Advanced Digital Sciences Center Singapore138602Singapore

Adaptive learning rate methods have been successfully applied in many fields,especially in training deep neural *** results have shown that adaptive methods with exponential increasing weights on squared past gradients(i.e.,ADAM,RMSPROP)may fail to converge to the optimal *** many algorithms,such as AMSGRAD and ADAMNC,have been proposed to fix the non-convergence issues,achieving a data-dependent regret bound similar to or better than ADAGRAD is still a challenge to these *** this paper,we propose a novel adaptive method weighted adaptive algorithm(WADA)to tackle the non-convergence *** AMSGRAD and ADAMNC,we consider using a milder growing weighting strategy on squared past gradient,in which weights grow *** on this idea,we propose weighted adaptive gradient method framework(WAGMF)and implement WADA algorithm on this ***,we prove that WADA can achieve a weighted data-dependent regret bound,which could be better than the original regret bound of ADAGRAD when the gradients decrease *** bound may partially explain the good performance of ADAM in ***,extensive experiments demonstrate the effectiveness of WADA and its variants in comparison with several variants of ADAM on training convex problems and deep neural networks.

关键词： adaptive learning rate methods stochastic gradient descent online learning

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Intelligent Model SFAHP-ANFIS-PSO for Technical Capability Evaluation of Manufacturing Enterprises 9th

A Hybrid Intelligent Model SFAHP-ANFIS-PSO for Technical Cap...

引用

19th International Conference on Advanced data Mining and applications, ADMA 2023

作者： Liu, Tingting Ding, Xuefeng Jiang, Yuming Hu, Dasha College of Computer Science Sichuan University Chengdu610065 China Big Data Analysis and Fusion Application Technology Engineering Laboratory of Sichuan Province Chengdu610065 China

ISBN: (纸本)9783031466731

In the collaborative production environment of manufacturing tasks, the evaluation of enterprise technical capability in advance has a direct impact on the high-performance collaboration between the supplier and the demander of production tasks. In order to solve the problem of efficiency and accuracy in the past evaluation methods, this paper applies the adaptive neuro fuzzy inference system (ANFIS) to the field of enterprise technical capability evaluation for the first time, and proposes an improved hybrid intelligent model SFAHP-ANFIS-PSO based on fuzzy theory. The model takes the four key indexes which have the deepest impact on enterprise technical capability evaluation as the input variables of the model, and the input data are evaluated by ANFIS with high accuracy. Spherical fuzzy analytic hierarchy process (SFAHP) calculated the weight of each evaluation index to preprocess the ANFIS model. Particle swarm optimization algorithm (PSO) continuously optimized the model parameters in the training process, shortened the model training time, improved the evaluation efficiency, and further improved the accuracy of the evaluation results. The experimental results show that the SFAHP-ANFIS-PSO model has high convergence speed and accuracy of results, and can be used to evaluate the technical capability of enterprises with high efficiency and high accuracy. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Analytic hierarchy process

来源：评论

学校读者我要写书评

暂无评论

A Method for Identifying the Timeliness of Manufacturing data Based on Weighted Timeliness Graph 9th

A Method for Identifying the Timeliness of Manufacturing Dat...

引用

19th International Conference on Advanced data Mining and applications, ADMA 2023

作者： Liu, Zehua Ding, Xuefeng Jiang, Yuming Hu, Dasha College of Computer Science Sichuan University Chengdu610065 China Big Data Analysis and Fusion Application Technology Engineering Laboratory of Sichuan Province Chengdu610065 China

ISBN: (纸本)9783031466601

Timeliness is one of the important indicators of data quality. In industrial production processes, a large amount of dependent data is generated, often resulting in unclear timestamps. Therefore, this article combines the conclusion dependency graph into a process dependency graph to determine the identification order of the timeliness of each process data;By constructing a weighted timeliness graph (WTG) and path single flux, a data timeliness identification method that does not completely rely on timestamps is proposed. Finally, a time-effectiveness identification method based on weighted time-effectiveness graph was discussed through an example and 9 dependency rules, and the effectiveness of the method was verified through a set of experiments. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： big data

来源：评论

学校读者我要写书评

暂无评论

Illuminating Recommendation by Understanding the Explicit Item Relations

引用

Journal of Computer Science & Technology 2018年第4期33卷 739-755页

作者： Qi Liu Hong-Ke Zhao Le Wu Zhi Li En-Hong Chen Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China Hefei 230027 China School of Computer and Information Hefei University of Technology Hefei 230009 China School of Software Engineering University of Science and Technology of China Hefei 230051 China

Recent years have witnessed the prevalence of recommender systems in various fields, which provide a personalized recommendation list for each user based on various kinds of information. For quite a long time, most researchers have been pursing recommendation performances with predefined metrics, e.g., accuracy. However, in real-world applications, users select items from a huge item list by considering their internal personalized demand and external constraints. Thus, we argue that explicitly modeling the complex relations among items under domain-specific applications is an indispensable part for enhancing the recommendations. Actually, in this area, researchers have done some work to understand the item relations gradually from ＂implicit＂ to ＂explicit＂ views when recommending. To this end, in this paper, we conduct a survey of these recent advances on recommender systems from the perspective of the explicit item relation understanding. We organize these relevant studies from three types of item relations, i.e., combination-effect relations, sequence-dependence relations, and external-constraint relations. Specifically, the combination-effect relation and the sequence-dependence relation based work models the intra-group intrinsic relations of items from the user demand perspective, and the external-constraint relation emphasizes the external requirements for items. After that, we also propose our opinions on the open issues along the line of understanding item relations and suggest some future research directions in recommendation area.

关键词： recommender system item relation recommendation interpretability

来源：评论

学校读者我要写书评

暂无评论

Adaptive offloading scheme of fine-grained tasks based on reinforcement learning in multi-access edge computing

引用

Simulation Modelling Practice and Theory 2025年

作者： Jie Li Ge Chen Kansong Chen School of Computer Science and Information Engineering Hubei University Wuhan 430062 China Hubei Key Laboratory of Big Data Intelligent Analysis and Application (Hubei University) Wuhan 430062 China Engineering Research Center of Hubei Province in Intelligent Government Affairs and Application of Artificial Intelligence Wuhan 430062 China Key Laboratory of Intelligent Sensing System and Security (Hubei University) Ministry of Education Wuhan 430062 China

In the context of multi-access edge computing, the constraints on device resources and energy pose a challenge in meeting the requirements of delay-sensitive and high-resource demand tasks. In order to address this issue, this paper puts forth an adaptive offloading decision based on fine-grained task sequencing (AOD-FTS). To enhance task execution efficiency and resource utilization, we design scheduling optimization for subtasks algorithm within the fine-grained task model to optimize the execution order of subtasks and improve subtask parallelism. Additionally, to reduce task delay and energy consumption, we propose an adaptive multi-objective reinforcement learning offloading algorithm based on ordered subtasks, formulated through multi-objective Markov decision processes. The scheme dynamically adjusts optimization preferences according to environmental changes and task completion states to make offloading decisions. Simulation results demonstrate that compared with two benchmark algorithms, the proposed AOD-FTS scheme achieves: (1) higher task completion rates, (2) improved resource utilization efficiency, (3) 81.66% and 51.53% reductions in delay respectively, and (4) 39.72% and 71.36% reductions in energy consumption respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Accelerating local SGD for non-IID data using variance reduction

引用

Frontiers of Computer Science 2023年第2期17卷 73-89页

作者： Xianfeng LIANG Shuheng SHEN Enhong CHEN Jinchang LIU Qi LIU Yifei CHENG Zhen PAN Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of ChinaHefei 230027China Ant Financial Services Group Hangzhou 310000China Department of Computer Science and Engineering Hong Kong University of Science and TechnologyHong Kong 999077China

Distributed stochastic gradient descent and its variants have been widely adopted in the training of machine learning models,which apply multiple workers in *** them,local-based algorithms,including Local SGD and FedAvg,have gained much attention due to their superior properties,such as low communication cost and ***,when the data distribution on workers is non-identical,local-based algorithms would encounter a significant degradation in the convergence *** this paper,we propose Variance Reduced Local SGD(VRL-SGD)to deal with the heterogeneous *** extra communication cost,VRL-SGD can reduce the gradient variance among workers caused by the heterogeneous data,and thus it prevents local-based algorithms from slow convergence ***,we present VRL-SGD-W with an effectivewarm-up mechanism for the scenarios,where the data among workers are quite *** from eliminating the impact of such heterogeneous data,we theoretically prove that VRL-SGD achieves a linear iteration speedup with lower communication complexity even if workers access non-identical *** conduct experiments on three machine learning *** experimental results demonstrate that VRL-SGD performs impressively better than Local SGD for the heterogeneous data and VRL-SGD-W is much robust under high data variance among workers.

关键词： distributed optimization variance reduction local SGD federated learning non-IID data

来源：评论

学校读者我要写书评

暂无评论

Legal Judgment Prediction with Multiple Perspectives on Civil Cases 1st

Legal Judgment Prediction with Multiple Perspectives on Civi...

引用

1st CAAI International Conference on Artificial Intelligence, CICAI 2021

作者： Zhao, Lili Yue, Linan An, Yanqing Liu, Ye Zhang, Kai He, Weidong Chen, Yanmin Yuan, Senchao Liu, Qi Anhui Province Key Laboratory of Big Data Analysis and Application School of Data Science and School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9783030930455

Legal Judgment Prediction, which aims at predicting the judgment result based on case materials, is an essential task in Legal Intelligence. Most existing studies have analyzed and modeled criminal cases as a whole, while a small part of the research focuses on civil cases which are also significant in the legal system. In these studies, most model on a certain type of civil causes and make the judgment prediction based on the ascertained fact from the perspective of the court. However, in real-world scenarios, there are different civil cases on various causes, and every case is judged from multiple perspectives (i.e., plaintiff, defendant, and the court). It is difficult to make judgment predictions on various civil causes. To address the above challenges, in this paper, we propose a novel Civil Case Judgment (CCJudge) prediction method by simulating the logic of judges. Following this logic, we construct an external knowledge base that contains the explanations and applications of every cause, it helps make the judgment on various causes. Furthermore, a special encoder layer and interaction layer are designed for learning linguistic semantics from multiple perspectives. We conduct extensive experiments on a real-world dataset. The experimental results demonstrate the effectiveness of our method. © 2021, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：