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

arXiv 2022年

作者： Liu, Kang Xue, Feng He, Xiangnan Guo, Dan Hong, Richang The School of Computer Science and Information Engineering Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Anhui Hefei China The School of Software Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Anhui Hefei China The University of Science and Technology of China Anhui Hefei China

Graph Convolution Networks (GCNs), with their efficient ability to capture high-order connectivity in graphs, have been widely applied in recommender systems. Stacking multiple neighbor aggregation is the major operation in GCNs. It implicitly captures popularity features because the number of neighbor nodes reflects the popularity of a node. However, existing GCN-based methods ignore a universal problem: users’ sensitivity to item popularity is differentiated, but the neighbor aggregations in GCNs actually fix this sensitivity through Graph Laplacian Normalization, leading to suboptimal personalization. In this work, we propose to model multi-grained popularity features and jointly learn them together with high-order connectivity, to match the differentiation of user preferences exhibited in popularity features. Specifically, we develop a Joint Multi-grained Popularity-aware Graph Convolution Collaborative Filtering model, short for JMP-GCF, which uses a popularity-aware embedding generation to construct multi-grained popularity features, and uses the idea of joint learning to capture the signals within and between different granularities of popularity features that are relevant for modeling user preferences. Additionally, we propose a multistage stacked training strategy to speed up model convergence. We conduct extensive experiments on three public datasets to show the state-of-the-art performance of JMP-GCF. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Charge Prediction with Multi-grained Features and Mutual Information 20

Few-Shot Charge Prediction with Multi-grained Features and M...

引用

20th China National Conference on Computational Linguistics, CCL 2021

作者： Zhang, Han Dou, Zhicheng Zhu, Yutao Wen, Jirong School of Information Renmin University of China Beijing China Gaoling School of Artificial Intelligence Renmin University of China Beijing China Université de Montréal Montreal Canada Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China

ISBN: (纸本)9783030841850

Charge prediction aims to predict the final charge for a case according to its fact description and plays an important role in legal assistance systems. With deep learning based methods, prediction on high-frequency charges has achieved promising results but that on few-shot charges is still challenging. In this work, we propose a framework with multi-grained features and mutual information for few-shot charge prediction. Specifically, we extract coarse- and fine-grained features to enhance the model’s capability on representation, based on which the few-shot charges can be better distinguished. Furthermore, we propose a loss function based on mutual information. This loss function leverages the prior distribution of the charges to tune their weights, so the few-shot charges can contribute more on model optimization. Experimental results on several datasets demonstrate the effectiveness and robustness of our method. Besides, our method can work well on tiny datasets and has better efficiency in the training, which provides better applicability in real scenarios. © 2021, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

KAN v.s. MLP for Offline Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Guo, Haihong Li, Fengxin Li, Jiao Liu, Hongyan School of Information Renmin University of China China Institute of Medical Information Medical Library Chinese Academy of Medical Sciences Peking Union Medical College China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

Kolmogorov-Arnold Networks (KAN) is an emerging neural network architecture in machine learning. It has greatly interested the research community about whether KAN can be a promising alternative of the commonly used Multi-Layer Perceptions (MLP). Experiments in various fields demonstrated that KAN-based machine learning can achieve comparable if not better performance than MLP-based methods, but with much smaller parameter scales and are more explainable. In this paper, we explore the incorporation of KAN into the actor and critic networks for offline reinforcement learning (RL). We evaluated the performance, parameter scales, and training efficiency of various KAN and MLP based conservative Q-learning (CQL) on the the classical D4RL benchmark for offline RL. Our study demonstrates that KAN can achieve performance close to the commonly used MLP with significantly fewer parameters. This provides us an option to choose the base networks according to the requirements of the offline RL tasks. © 2024, CC BY.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

SLMP: A Scientific Literature Management Platform Based on Large Language Models

SLMP: A Scientific Literature Management Platform Based on L...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Menghao Guo Jinling Jiang Fan Wu Shanxin Sun Chen Zhang Wenhui Li Zeyi Sun Guangyong Chen Xindong Wu Research Center for Life Sciences Computing Zhejiang Lab Hangzhou China Research Center for Data Hub and Security Zhejiang Lab Hangzhou China Research Center for High Efficiency Computing System Zhejiang Lab Hangzhou China Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Hefei China

ISBN: (数字)9798331508821

ISBN: (纸本)9798331508838

This paper presents a Scientific Literature Management Platform (SLMP, demo link 1 ) based on large language models (LLMs). The platform consists of four modules: literature management, literature extraction, literature retrieval, and question answering. The core techniques used to support the four modules across the platform include a fine-tuned model PaperExtractGPT and a continual pre-training model ChatPaperGPT based on ChatGLM 2 using the data from scientific research literature, responsible for information extraction and communication, respectively. Due to their powerful capabilities in natural language understanding and generation, LLMs can understand complex scientific concepts based on the provided contexts, and thus generate high-quality texts and conduct in-depth information retrieval and question answering. Our platform can help researchers manage and utilize literature more effectively and efficiently for finding relevant literature, obtaining required information, and generating new knowledge.

关键词： Training Large language models knowledge graphs Information retrieval data models Question answering (information retrieval)

来源：评论

学校读者我要写书评

暂无评论

Dynamic Graph Pattern Matching in Medical knowledge Graphs 4

Dynamic Graph Pattern Matching in Medical Knowledge Graphs

引用

4th International Conference on data Intelligence and Security, ICDIS 2022

作者： Du, Xun Tao, Zhenchao Li, Lei School of Computer Science and Information Engineering Hefei University of Technology Hefei China The First Affiliated Hospital University of Science and Technology of China Hefei China Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Hefei China

ISBN: (数字)9781665459686

ISBN: (纸本)9781665459693

As the study of graph pattern matching (GPM) attracts more and more scholars, the research of GPM in the medical field begins to emerge, from protein structure analysis to breast cancer classification diagnosis, and GPM is more and more widely adopted. However, in medical knowledge graphs (MKG), when the pattern graph dynamically changes, to obtain the matching results of the changed pattern graph, the traditional method has to carry out global matching instead of local matching, which causes a waste of resources and takes a lot of time. To quickly return the matching results of the dynamic pattern graph in MKGs, in this paper, we introduce a caching mechanism to cache the previous matching results and propose a new longest common path matching (M-LCPM) algorithm based on multithreading. The algorithm only performs partial matching on the changed pattern graph and can quickly obtain the matching result. Considering that the M-LCPM algorithm cannot get matching results when the pattern graph changes completely and there may be missing matching subgraphs when the M-LCPM algorithm performs matching, we optimize the M-LCPM algorithm and propose the M-LCPM-Enhance algorithm. Experimental results on two data sets show that our dynamic algorithm is more efficient than existing algorithms. © 2022 IEEE.

关键词： graph pattern matching longest common path medical knowledge graphs

来源：评论

学校读者我要写书评

暂无评论

Out-of-Distribution Generalization on Graphs via Progressive Inference

arXiv

引用

arXiv 2025年

作者： Xu, Yiming Shi, Bin Peng, Zhen Liu, Huixiang Dong, Bo Chen, Chen School of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China School of Distance Education Xi’an Jiaotong University China University of Virginia CharlottesvilleVA United States

The development and evaluation of graph neural networks (GNNs) generally follow the independent and identically distributed (i.i.d.) assumption. Yet this assumption is often untenable in practice due to the uncontrollable data generation mechanism. In particular, when the data distribution shows a significant shift, most GNNs would fail to produce reliable predictions and may even make decisions randomly. One of the most promising solutions to improve the model generalization is to pick out causal invariant parts in the input graph. Nonetheless, we observe a significant distribution gap between the causal parts learned by existing methods and the ground-truth, leading to undesirable performance. In response to the above issues, this paper presents GPro, a model that learns graph causal invariance with progressive inference. Specifically, the complicated graph causal invariant learning is decomposed into multiple intermediate inference steps from easy to hard, and the perception of GPro is continuously strengthened through a progressive inference process to extract causal features that are stable to distribution shifts. We also enlarge the training distribution by creating counterfactual samples to enhance the capability of the GPro in capturing the causal invariant parts. Extensive experiments demonstrate that our proposed GPro outperforms the state-of-the-art methods by 4.91% on average. For datasets with more severe distribution shifts, the performance improvement can be up to 6.86%. 1 © 2025, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Global and Adaptive Local Label Correlation for Multi-label Learning with Missing Labels

Global and Adaptive Local Label Correlation for Multi-label ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Qingxia Jiang Peipei Li Yuhong Zhang Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data (the ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui Province China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei Anhui Province China

Label missing is a major challenge in multi-label learning. Many existing methods try to use label correlation to recover ground-truth labels, but they only focus on the label correlation within the original label space, however, the label correlation learned in this way is incomplete. Thus, inspired $b$ y the matrix adaptive column correlation, we propose a method to continuously adjust the label correlation matrix while the labels are filled in by adaptive column correlation learning method. Specifically, to reduce the impact of the missing label s on label correlation, the label space is firstly completed through manifold regularization while learning the local label information by adaptive column correlation learning in the complemented label space. Secondly, the global label correlation is utilized by adding a low-rank constraint to the entire label space. Finally, by jointly taking advantage of the global and adaptive local label correlation, our proposed approach achieves superior performance on both synthetic and real-world data sets from diverse domains compared to state-of-the art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

NEW BOOLEAN SATISFIABILITY PROBLEM HEURISTIC STRATEGY: MINIMAL POSITIVE NEGATIVE PRODUCT STRATEGY

arXiv

引用

arXiv 2023年

作者： Qun, Zhao Xintao, Wang Menghui, Yang School of Information Resource Management Renmin University of China Beijing100872 China Institute of Economics Chinese Academy of Social Sciences Beijing100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing100872 China

This study presents a novel heuristic algorithm called the "Minimal Positive Negative Product Strategy" to guide the CDCL algorithm in solving the Boolean satisfiability problem. It provides a mathematical explanation for the superiority of this algorithm over widely used heuristics such as the Dynamic Largest Individual Sum (DLIS) and the Variable State Independent Decaying Sum (VSIDS). Experimental results further confirm the effectiveness of this heuristic strategy in *** Codes 03 Copyright © 2023, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable Digital Twin from the Perspective of Smart Manufacturing Systems in Industry 4.0/5.0

Reconfigurable Digital Twin from the Perspective of Smart Ma...

引用

2024 International Conference on Intelligent Systems and Robotics, CISR 2024

作者： Mo, Guangyu Sun, Yuan Huang, Sihan Gao, Feng Huang, Jintang Lai, Lijuan Wang, Guoxin Yan, Yan School of Mechanical Engineering Beijing Institute of Technology Beijing100081 China Beijing Aerospace Times Optical-Electronic Technology Co. Ltd. Beijing100094 China Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology Beijing Institute of Technology Beijing100081 China China Academy of Aerospace Electronic Technology Beijing100094 China School of Industrial Automation Beijing Institute of Technology Zhuhai519088 China

In industry 4.0/5.0, Smart manufacturing systems are typically complex systems that can be adjusted to deal with demand fluctuation through reconfigurable software/hardware. The emergence of digital twin as enabler technology can promote the operation efficiency of smart manufacturing systems. However, the modelling processes of digital twin of smart manufacturing systems is inefficient due to their complicated structures in general. Besides, the frequent reconfiguration of smart manufacturing systems and the differentiation among smart manufacturing systems will increase the burden of digital twin modelling. Therefore, a reconfigurable modelling method for digital twin of smart manufacturing systems is proposed in this paper. First, a reconfigurable modelling framework based on open architecture is proposed to provide basic model scenario for digital twin of smart manufacturing systems. Second, the reconfiguration of digital twin is elaborated from three dimensions, including reconfigurable virtual model, reconfigurable mapping, and reconfigurable scene. Finally, a case study is given to demonstrate the effectiveness of the proposed method. © Published under licence by IOP Publishing Ltd.

关键词： Smart manufacturing

来源：评论

学校读者我要写书评

暂无评论

Automatic Life Event Tree Generation for Older Adults 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： Gui, Fang Wu, Xi Hu, Min Yang, Jiaoyun School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Studies have shown that learning personal stories could help provide individualized eldercare services. However, personal stories are often disordered because of the scattered collection, including informal interviews or daily interactions, which brings difficulties in acquiring valuable information quickly. One solution to this problem is to extract events from personal stories and automatically organize them in chronological order. Events extracted by current methods from social media or news corpus are mainly organized in a linear structure. These works usually focus on the event time and ignore the consistency of event contents when organizing events. This paper aims to organize events into a tree structure based on an event network, with stem nodes representing key event topics and branch nodes representing detailed events. Social workers or caregivers can clarify the life experience of the older adults quickly through the event tree and have a preliminary understanding of them. The experiments show that the event tree generated by our method has a better performance in consistency than current event organization methods. A survey study shows that our method achieves the highest logical coherence for the event tree branches compared with other algorithms. © 2022, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：