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

Algorithms, Computing and Machine Learning (CACML), Asia Conference on

作者： Zhengtao Tan Jimin Bao Zhuangzhuang He Dacao Zhang Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Hefei China

ISBN: (数字)9798331543143

ISBN: (纸本)9798331543150

Cognitive diagnosis is a critical task in intelligent education, aimed at inferring students’ mastery of knowledge concepts based on their response logs. Although existing cognitive diagnosis models achieve excellent performance, they underestimate the difficulty of easy exercises and overestimate the difficulty of hard exercises. We attribute this to the class imbalance in the response logs of easy and hard exercises. Moreover, the convergence speed varies from exercise to exercise during model training, which further challenges generalization. To address these problems, we propose an exercise’s correct rate-based logit adjustment approach for a wide range of cognitive diagnosis models. Specifically, we enforce logit adjustment in the loss during training to overcome the class imbalance in response logs. Then, we apply group distributionally robust optimization for generalization. Finally, extensive experiments demonstrate the effectiveness of our model, especially on easy and hard exercises.

关键词： Training Machine learning algorithms Accuracy Computational modeling Asia Machine learning Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

Multi-Perspective data Fusion Framework Based on Hierarchical BERT: Provide Visual Predictions of Business Processes

引用

Computers, Materials & Continua 2024年第1期78卷 1227-1252页

作者： Yongwang Yuan Xiangwei Liu Ke Lu School of Mathematics and Big Data Anhui University of Science and TechnologyHuainan232001China School of Economics and Management Anhui University of Science and TechnologyHuainan232001China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji UniversityShanghai201804China

Predictive Business Process Monitoring(PBPM)is a significant research area in Business Process management(BPM)aimed at accurately forecasting future behavioral *** present,deep learning methods are widely cited in PBPM research,but no method has been effective in fusing data information into the control flow for multi-perspective process ***,this paper proposes a process prediction method based on the hierarchical BERT and multi-perspective data ***,the first layer BERT network learns the correlations between different category attribute ***,the attribute data is integrated into a weighted event-level feature vector and input into the second layer BERT network to learn the impact and priority relationship of each event on future predicted ***,the multi-head attention mechanism within the framework is visualized for analysis,helping to understand the decision-making logic of the framework and providing visual ***,experimental results show that the predictive accuracy of the framework surpasses the current state-of-the-art research methods and significantly enhances the predictive performance of BPM.

关键词： Business process prediction monitoring deep learning attention mechanism BERT multi-perspective

来源：评论

学校读者我要写书评

暂无评论

SGSH: Stimulate Large Language Models with Skeleton Heuristics for knowledge Base Question Generation

SGSH: Stimulate Large Language Models with Skeleton Heuristi...

引用

2024 Findings of the Association for Computational Linguistics: NAACL 2024

作者： Guo, Shasha Liao, Lizi Zhang, Jing Wang, Yanling Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education China Singapore Management University Singapore Zhongguancun Laboratory China

ISBN: (纸本)9798891761193

knowledge base question generation (KBQG) aims to generate natural language questions from a set of triplet facts extracted from KB. Existing methods have significantly boosted the performance of KBQG via pre-trained language models (PLMs) thanks to the richly endowed semantic knowledge. With the advance of pre-training techniques, large language models (LLMs) (e.g., GPT-3.5) undoubtedly possess much more semantic knowledge. Therefore, how to effectively organize and exploit the abundant knowledge for KBQG becomes the focus of our study. In this work, we propose SGSH - a simple and effective framework to Stimulate GPT-3.5 with Skeleton Heuristics to enhance KBQG. The framework incorporates "skeleton heuristics", which provides more fine-grained guidance associated with each input to stimulate LLMs to generate optimal questions, encompassing essential elements like the question phrase and the auxiliary verb. More specifically, we devise an automatic data construction strategy leveraging ChatGPT to construct a skeleton training dataset, based on which we employ a soft prompting approach to train a BART model dedicated to generating the skeleton associated with each input. Subsequently, skeleton heuristics are encoded into the prompt to incentivize GPT-3.5 to generate desired questions. Extensive experiments demonstrate that SGSH derives the new state-of-the-art performance on the KBQG tasks. The code is now available on Github. © 2024 Association for Computational Linguistics.

关键词： knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Multicomponent Similarity Graphs for Cross-Network Node Classification

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第3期5卷 1411-1424页

作者： Zhang, Yuhong Shi, Congmei Li, Xinzheng Zhang, Zan Hu, Xuegang School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230088 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei230009 China

Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution, i.e., most nodes in the network are tail nodes with sparse neighborhoods. The established methods focus on either the discrepancy cross network or the long tail in a single network. As for the cross-network node classification under long tail, the coexistence of sparsity of tail nodes and the discrepancy cross-network challenges existing methods for long tail or methods for the cross-network node classification. To this end, a multicomponent similarity graphs for cross-network node classification (MS-CNC) is proposed in this article. Specifically, in order to address the sparsity of the tail nodes, multiple component similarity graphs, including attribute and structure similarity graphs, are constructed for each network to enrich the neighborhoods of the tail nodes and alleviate the long-tail phenomenon. Then, multiple representations are learned from the multiple similarity graphs separately. Based on the multicomponent representations, a two-level adversarial model is designed to address the distribution difference across networks. One level is used to learn the invariant representations cross network in view of structure and attribute components separately, and the other level is used to learn the invariant representations in view of the fused structure and attribute graphs. Extensive experimental results show that the MS-CNC outperforms the state-of-the-art methods. Impact Statement-Node classification is an important task in graph mining. With the unavailability of labels, some researchers propose cross-network node classification, using one labeled network to assist the node classification of another unlabeled network. However, the long-tail of nodes leads to unsatisfactory performance and challenges the recent cross-network node classification m

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Solving uncapacitated P-Median problem with reinforcement learning assisted by graph attention networks

引用

APPLIED INTELLIGENCE 2023年第2期53卷 2010-2025页

作者： Wang, Chenguang Han, Congying Guo, Tiande Ding, Man Univ Chinese Acad Sci Sch Math Sci 19A Yuquan Rd Beijing 100049 Peoples R China Chinese Acad Sci Key Lab Big Data Min & Knowledge Management 80 Zhonguancun East Rd Beijing 100190 Peoples R China

The P-Median Problem is one of the basic cases of facility location problems and has been studied for many years. Most methods of solving it are based on classical heuristics or meta-heuristic and they don't perform well on large-scale problems according to time cost. In this paper, we propose the first reinforcement learning-based method which uses Multi-Talking-Heads Graph Attention Networks to learn representations and design a learnable attention mechanism to solve the uncapacitated P-Median Problem. We train the model using REINFORCE algorithm and show that it has good performance on uncapacitated P-Median Problem according to solution quality and time consumption. We also apply our model to the realistic dataset and empirically figure out that the difference between data distributions is one of the most important factors to influence the final performances.

关键词： P-median problem Graph neural networks Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem

引用

Neural Computing and Applications 2024年第22期36卷 13833-13852页

作者： Li, Ruizhi He, Jintao Lin, Cuisong Liu, Ying Hu, Shuli Yin, Minghao Jilin University of Finance and Economics Changchun130117 China Northeast Normal University Changchun130117 China Business Big Data Research Center of Jilin Province Changchun130117 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

The minimum weakly connected dominating set problem is a typical NP-hard problem with a wide range of applications. To solve this problem, we propose a frequency property and two-hop configuration checking strategy-driven local search algorithm (FCC2LS). In this algorithm, we first propose a lock-vertex-based initial solution construction procedure. This procedure guarantees that certain vertices, which must be included in the optimal solution, are added to the solution. Second, we propose a two-hop configuration checking strategy and a frequency property. The two-hop configuration checking strategy is a new variant of the original configuration checking strategy, which prohibits vertices with unchanged configuration from being added to the candidate solution. The frequency property is used to record the number of times for each vertex is added to the solution, which can increase the diversity of selected vertices. Third, we combine two scoring functions, Dscore and Nscore, with the above strategies and propose effective vertex selection methods to help the algorithm select suitable vertices to add into or remove from the candidate solutions. Finally, we evaluate the proposed algorithm FCC2LS with four state-of-the-art algorithms on four groups of benchmark instances. Experimental results show that our algorithm performs better on four classical benchmark instances. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Empirical Likelihood Test for Regression Coefficients in High Dimensional Partially Linear Models

引用

Journal of Systems Science & Complexity 2021年第3期34卷 1135-1155页

作者： LIU Yan REN Mingyang ZHANG Sanguo School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of SciencesBeijing 100190China

This paper considers tests for regression coefficients in high dimensional partially linear *** authors first use the B-spline method to estimate the unknown smooth function so that it could be linearly ***,the authors propose an empirical likelihood method to test regression *** authors derive the asymptotic chi-squared distribution with two degrees of freedom of the proposed test statistics under the null *** addition,the method is extended to test with nuisance *** show that the proposed method have a good performance in control of type-I error rate and *** proposed method is also employed to analyze a data of Skin Cutaneous Melanoma(SKCM).

关键词： Empirical likelihood test high dimensional analysis partially linear models regression coefficients

来源：评论

学校读者我要写书评

暂无评论

On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error

引用

OPTIMIZATION METHODS & SOFTWARE 2023年第1期38卷 1-33页

作者： Hu, Jia Han, Congying Guo, Tiande Zhao, Tong Univ Chinese Acad Sci Sch Math Sci 19A Yuquan Rd Beijing 100049 Peoples R China Chinese Acad Sci Key Lab Big Data Min & Knowledge Management 80 Zhongguancun East Rd Beijing 100190 Peoples R China

We consider minimizing a class of nonconvex composite stochastic optimization problems, and deterministic optimization problems whose objective function consists of an expectation function (or an average of finitely many smooth functions) and a weakly convex but potentially nonsmooth function. And in this paper, we focus on the theoretical properties of two types of stochastic splitting methods for solving these nonconvex optimization problems: stochastic alternating direction method of multipliers and stochastic proximal gradient descent. In particular, several inexact versions of these two types of splitting methods are studied. At each iteration, the proposed schemes inexactly solve their subproblems by using relative error criteria instead of exogenous and diminishing error rules, which allows our approaches to handle some complex regularized problems in statistics and machine learning. Under mild conditions, we obtain the convergence of the schemes and their computational complexity related to the evaluations on the component gradient of the smooth function, and find that some conclusions of their exact counterparts can be recovered.

关键词： Nonsmooth nonconvex optimization stochastic approximation relative error alternating direction method of multipliers proximal gradient descent variance reduction

来源：评论

学校读者我要写书评

暂无评论

Improving operational efficiency through blockchain: evidence from a field experiment in cross-border trade

引用

PRODUCTION PLANNING & CONTROL 2024年第9期35卷 1009-1024页

作者： Tian, Xin Zhu, Jiayi Zhao, Xuan Wu, Junfeng Univ Chinese Acad Sci Sch Econ & Management Beijing Peoples R China Chinese Acad Sci Res Ctr Fictitious Econ & Data Sci Beijing Peoples R China Chinese Acad Sci Key Lab Big Data Min & Knowledge Management Beijing Peoples R China Wilfrid Laurier Univ Lazaridis Sch Business & Econ Waterloo ON Canada Shanghai WinJoin Informat Technol Co Ltd Shanghai Peoples R China

Based on the practical needs of cross-border trade between Yunnan Province, China, and Southeast Asian countries, this paper studies the impact of blockchain technology usage on operational performance. Owing to immutability and traceability, the implementation of a blockchain-based platform solves several existing problems of cross-border trade. We conducted a field experiment to verify the effect of blockchain technology on the operational efficiency of cross-border trade companies. The results show that operational, agency, and time costs significantly decrease. Blockchain usage reduces the intermediary agencies of cross-border trade and settlement payment for traders, also improves the timeliness of business processing and the efficiency of cross-departmental business collaboration. This study provides new insights on the interface of blockchain technology and supply-chain operation management.

关键词： Blockchain technology operational efficiency cross-border trade field experiment

来源：评论

学校读者我要写书评

暂无评论

Homomorphic Encryption based stem cell assay data sharing study 4

Homomorphic Encryption based stem cell assay data sharing st...

引用

4th IEEE International Conference on Information Technology, big data and Artificial Intelligence, ICIBA 2024

作者： Xiao, Hengjiang Liang, Zhihong Huang, Yuxiang Qin, Mingming Xiong, Fei Liu, Mengxin Southwest Forestry University School of Big Data and Intelligent Engineering Kunming China Southwest Forestry University Key Laboratory of National Forestry and Grassland Administration on Forestry and Ecological Big Data China Southwest Forestry University School of Economics and Management Kunming China

ISBN: (纸本)9798350363586

With the rapid development of the biomedical field, stem cell therapy has received widespread attention as an innovative therapy with great potential. However, privacy protection and secure sharing of stem cell testing data are still major challenges. In this paper, we propose a homomorphic encryption-based data sharing scheme for stem cell testing, which achieves efficient and secure data sharing with data privacy by designing a system architecture covering data acquisition, encryption, transmission, decryption and analysis. Experimental results show that the scheme can not only effectively protect data privacy, but also support efficient data processing with less impact on system performance. The main contributions of this paper include designing and implementing a stem cell detection data sharing system based on homomorphic encryption, proposing a homomorphic encryption algorithm optimised for the high-dimensional characteristics of stem cell data, and experimentally verifying the security and effectiveness of the system. Future research directions include optimising homomorphic encryption algorithms, expanding application scenarios, integrating multiple privacy protection techniques, and optimising system performance. © 2024 IEEE.

关键词： data assimilation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：