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

arXiv 2025年

作者： Yao, Zhiming Li, Haoyang Zhang, Jing Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Engineering Research Center of Database and Business Intelligence MOE China

Query optimization is a critical task in database systems, focused on determining the most efficient way to execute a query from an enormous set of possible strategies. Traditional approaches rely on heuristic search methods and cost predictions, but these often struggle with the complexity of the search space and inaccuracies in performance estimation, leading to suboptimal plan choices. This paper presents LLMOpt, a novel framework that leverages Large Language Models (LLMs) to address these challenges through two innovative components: (1) LLM for Plan Candidate Generation (LLMOpt(G)), which eliminates heuristic search by utilizing the reasoning abilities of LLMs to directly generate high-quality query plans, and (2) LLM for Plan Candidate Selection (LLMOpt(S)), a list-wise cost model that compares candidates globally to enhance selection accuracy. To adapt LLMs for query optimization, we propose fine-tuning pre-trained models using optimization data collected offline. Experimental results on the JOB, JOB-EXT, and Stack benchmarks show that LLMOpt(G) and LLMOpt(S) outperform state-of-the-art methods, including PostgreSQL, BAO, and HybridQO. Notably, LLMOpt(S) achieves the best practical performance, striking a balance between plan quality and inference efficiency. Copyright © 2025, The Authors. All rights reserved.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-guided Mutual Consistency Training for Semi-supervised Biomedical Relation Extraction

Uncertainty-guided Mutual Consistency Training for Semi-supe...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Mao, Bing Jia, Chang Huang, Yucheng He, Kai Wu, Jialun Gong, Tieliang Li, Chen Xi'an Jiaotong University School of Computer Science and Technology Xi'an China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an China

ISBN: (纸本)9781665468190

Biomedical relation extraction seeks to automatically extract biomedical relations from biomedical text, which plays an important role in biomedical studies. However, constructing high-quality biomedical annotation data is not only time-consuming but also requires a high level of knowledge in the biomedical field. To alleviate this problem, Semi-supervised Biomedical Relation Extraction aims to extract relation facts from the limited labeled data and the more readily available unlabeled samples. Existing works can be roughly categorized as self-training methods and self-ensembling methods. The former aims to generate pseudo labels, which may lead to the gradual drift problem. The latter aims to encourage the output of one model to be consistent with the other model, where the acquisition of the model is tedious. To alleviate these issues, we propose a novel Uncertainty-Guided Mutual Consistency Training framework(UG-MCT) for semi-supervised Biomedical relation extraction. Specifically, our framework consists of two models with the same structure, which differ only when updating their weights, and then an intersecting pseudo-label mechanism is designed to convert the prediction discrepancies of the two models into mutual consistency training loss, thus promoting the consistency of model predictions. In addition, we utilize uncertainty as guided information to assist the model in focusing on the confident pseudo labels and mitigate the noise of inaccurate pseudo labeling during training. Thus, our model is very simple and efficient while mitigating the noise introduced by pseudo-labels. UG-MCT is evaluated on multiple datasets in different settings and the experimental results demonstrate that our method is highly effective in semi-supervised biomedical relation extraction compared to the state-of-the-art. © 2022 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

PCQPR: Proactive Conversational Question Planning with Reflection

arXiv

引用

arXiv 2024年

作者： Guo, Shasha Liao, Lizi Zhang, Jing 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

Conversational Question Generation (CQG) enhances the interactivity of conversational question-answering systems in fields such as education, customer service, and entertainment. However, traditional CQG, focusing primarily on the immediate context, lacks the conversational foresight necessary to guide conversations toward specified conclusions. This limitation significantly restricts their ability to achieve conclusion-oriented conversational outcomes. In this work, we redefine the CQG task as Conclusion-driven Conversational Question Generation (CCQG) by focusing on proactivity, not merely reacting to the unfolding conversation but actively steering it towards a conclusion-oriented question-answer pair. To address this, we propose a novel approach, called Proactive Conversational Question Planning with self- Refining (PCQPR). Concretely, by integrating a planning algorithm inspired by Monte Carlo Tree Search (MCTS) with the analytical capabilities of large language models (LLMs), PCQPR predicts future conversation turns and continuously refines its questioning strategies. This iterative self-refining mechanism ensures the generation of contextually relevant questions strategically devised to reach a specified outcome. Our extensive evaluations demonstrate that PCQPR significantly surpasses existing CQG methods, marking a paradigm shift towards conclusion-oriented conversational question-answering systems. © 2024, CC BY-NC-SA.

关键词： Direct process refining

来源：评论

学校读者我要写书评

暂无评论

knowledge Enhanced Coreference Resolution via Gated Attention

Knowledge Enhanced Coreference Resolution via Gated Attentio...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： He, Kai Mao, Bing Zhou, Xiangyu Li, Yufei Gong, Tieliang Li, Chen Wu, Jialun Xi'an Jiaotong University School of Computer Science and Technology Xi'an China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an China

ISBN: (纸本)9781665468190

Coreference resolution aims at linking all mentions that refer to the same entity, which are widely adopted in many biomedical and bioinformatics tasks, such as biomedical knowledge graph construction and metabolic pathway integration. Many recent studies focus on improving neural model structures. However, we argue that a practical method that integrates commonsense knowledge can further improve coreference resolution performance, because commonsense delivers extra prior knowledge for reasoning and can enhance related representations, rather than naive mention-context occurrence modeling. In this work, we propose an effective method to integrate external commonsense knowledge into a neural coreference resolution model. Specially, a gated attention mechanism is employed in our method to leverage commonsense according to different contexts. By using ConceptNet as the knowledge base in three span-ranking backbone models, the models can yield significant performance gains on used datasets. We also achieve improvements in tasks of long-term mention detection and cross-sentence coreferences after incorporating knowledge. © 2022 IEEE.

关键词： Model structures

来源：评论

学校读者我要写书评

暂无评论

Collusion Resistant Identity-based Proxy Re-encryption Scheme on Lattice 6

Collusion Resistant Identity-based Proxy Re-encryption Schem...

引用

6th International Conference on Computer Information Science and Application Technology, CISAT 2023

作者： Deng, Xiaohong Xie, Hua Xiong, Weizhi School of Electronics and Information Engineering Gannan University of Science and Technology Ganzhou341000 China College of Information Science Jiangxi University of Science and Technology Ganzhou341000 China Key Laboratory of Cloud Computing and Big Data Ganzhou341000 China

ISBN: (纸本)9781510668546

Proxy re-encryption plays an important role for data security in cloud computing and big data, but the traditional reencryption scheme based on the classical number theory problem cannot resist quantum attack, and the lattice based cryptosystem has been proved to have the ability to resist quantum attack, so the lattice based re-encryption scheme has always been a research hotspot. In view of the problem that collusion-resistance and multi-hop can not be satisfied at the same time in existing schemes, this paper proposes a new identity-based proxy re-encryption scheme on lattice. Firstly, the scheme uses trapdoors as private keys to achieve one-way anti-collusion. In addition, we constructs a variant of learning with errors (LWE), which uses a convert algorithm to transform the user matrix and replace the vector with a uniform matrix, so that the scheme can meet the requirements of multi-hop and encrypt multiple bits of messages at one time. Theoretical analysis and experimental simulation prove that the security of the new scheme can be reduced to a decision LWE problem, which can reach the IND-sID-CPA security in the standard model, and can improve the encryption efficiency while ensuring the security. © 2023 SPIE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

QGEval: Benchmarking Multi-dimensional Evaluation for Question Generation

QGEval: Benchmarking Multi-dimensional Evaluation for Questi...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Fu, Weiping Wei, Bifan Hu, Jianxiang Cai, Zhongmin Liu, Jun School of Computer Science and Technology Xi'an Jiaotong University Xi'an China School of Continuing Education Xi'an Jiaotong University Xi'an China MOE KLINNS Lab School of Automation Science and Engineering Xi'an Jiaotong University Xi'an China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an China

ISBN: (纸本)9798891761643

Automatically generated questions often suffer from problems such as unclear expression or factual inaccuracies, requiring a reliable and comprehensive evaluation of their quality. Human evaluation is widely used in the field of question generation (QG) and serves as the gold standard for automatic metrics. However, there is a lack of unified human evaluation criteria, which hampers consistent and reliable evaluations of both QG models and automatic metrics. To address this, we propose QGEval, a multi-dimensional Evaluation benchmark for Question Generation, which evaluates both generated questions and existing automatic metrics across 7 dimensions: fluency, clarity, conciseness, relevance, consistency, answerability, and answer consistency. We demonstrate the appropriateness of these dimensions by examining their correlations and distinctions. Through consistent evaluations of QG models and automatic metrics with QGEval, we find that 1) most QG models perform unsatisfactorily in terms of answerability and answer consistency, and 2) existing metrics fail to align well with human judgments when evaluating generated questions across the 7 dimensions. We expect this work to foster the development of both QG technologies and their evaluation. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

MS²-GNN: Exploring GNN-Based Multimodal Fusion Network for Depression Detection

引用

IEEE transactions on cybernetics 2023年第12期53卷 7749-7759页

作者： Tao Chen Richang Hong Yanrong Guo Shijie Hao Bin Hu Key Laboratory of Knowledge Engineering with Big Data Ministry of Education and the School of Computer Science and Information Engineering Hefei University of Technology Hefei China Gansu Provincial Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou University Lanzhou China

Major depressive disorder (MDD) is one of the most common and severe mental illnesses, posing a huge burden on society and families. Recently, some multimodal methods have been proposed to learn a multimodal embedding for MDD detection and achieved promising performance. However, these methods ignore the heterogeneity/homogeneity among various modalities. Besides, earlier attempts ignore interclass separability and intraclass compactness. Inspired by the above observations, we propose a graph neural network (GNN)-based multimodal fusion strategy named modal-shared modal-specific GNN, which investigates the heterogeneity/homogeneity among various psychophysiological modalities as well as explores the potential relationship between subjects. Specifically, we develop a modal-shared and modal-specific GNN architecture to extract the inter/intramodal characteristics. Furthermore, a reconstruction network is employed to ensure fidelity within the individual modality. Moreover, we impose an attention mechanism on various embeddings to obtain a multimodal compact representation for the subsequent MDD detection task. We conduct extensive experiments on two public depression datasets and the favorable results demonstrate the effectiveness of the proposed algorithm.

关键词： Task analysis Feature extraction Semantics Depression Graph neural networks Electroencephalography data mining Mental disorders Multisensory integration

来源：评论

学校读者我要写书评

暂无评论

Face micro-expression recognition algorithm based on ResNet depth model

Face micro-expression recognition algorithm based on ResNet ...

引用

6th International Conference on Intelligent Computing and Signal Processing (ICSP)

作者： Liquan Wang Shu Zhan School of Computer and Information Engineering Hefei University of Technology Key Laboratory of Big Data Knowledge Engineering Ministry of Education Hefei China

Micro Expression (ME) is the subtle facial expressions that people show when they express their inner feelings. To address the problem that micro-expression recognition is difficult and less accurate due to the small number of samples and uneven distribution of different categories, we propose a model framework to improve the accuracy of micro-expression recognition. The peak frames containing more key expression information in the micro-expression video sequences are extracted; SE-ResNeXt-50, an improved residual network with SE module, is used to extract features from the peak frames of micro-expressions, where the SE module can better learn the key information in the features, and ResNeXt simplifies the structure by replacing the dense structure with the sparse structure through group convolution, which improves the recognition efficiency. The recognition efficiency is improved by replacing the dense structure with the sparse structure by group convolution. At the same time, the Focal Loss loss function can better solve the model performance problem caused by the imbalance of micro-expression data. Simulation experiments are conducted on the micro-expression dataset CASMEⅡ, and it is found that the improved residual network and peak frame improve the accuracy and F1 value of micro-expression recognition. The improved residual network and peak frame can reduce the effect of small data set, make the model have good fitting effect, and improve the performance of different categories, improve the recognition accuracy of micro-expressions, and have better recognition performance for micro-expression recognition.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Rethinking data-Free Quantization as a Zero-Sum Game

arXiv

引用

arXiv 2023年

作者： Qian, Biao Wang, Yang Hong, Richang Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology China

data-free quantization (DFQ) recovers the performance of quantized network (Q) without accessing the real data, but generates the fake sample via a generator (G) by learning from full-precision network (P) instead. However, such sample generation process is totally independent of Q, specialized as failing to consider the adaptability of the generated samples, i.e., beneficial or adversarial, over the learning process of Q, resulting into non-ignorable performance loss. Building on this, several crucial questions — how to measure and exploit the sample adaptability to Q under varied bit-width scenarios? how to generate the samples with desirable adaptability to benefit the quantized network? — impel us to revisit DFQ. In this paper, we answer the above questions from a game-theory perspective to specialize DFQ as a zero-sum game between two players — a generator and a quantized network, and further propose an Adaptability-aware Sample Generation (AdaSG) method. Technically, AdaSG reformulates DFQ as a dynamic maximization-vs-minimization game process anchored on the sample adaptability. The maximization process aims to generate the sample with desirable adaptability, such sample adaptability is further reduced by the minimization process after calibrating Q for performance recovery. The Balance Gap is defined to guide the stationarity of the game process to maximally benefit Q. The theoretical analysis and empirical studies verify the superiority of AdaSG over the state-of-the-arts. Our code is available at https://***/hfutqian/AdaSG. Copyright © 2023, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Adaptive data-Free Quantization

arXiv

引用

arXiv 2023年

data-free quantization (DFQ) recovers the performance of quantized network (Q) without accessing the original data, but generates the fake sample via a generator (G) by learning from full-precision network (P), which, however, is totally independent of Q, overlooking the adaptability of the knowledge from generated samples, i.e., informative or not to the learning process of Q, resulting into the overflow of generalization error. Building on this, several critical questions - how to measure the sample adaptability to Q under varied bit-width scenarios? how to generate the samples with large adaptability to improve Q's generalization? whether the largest adaptability is the best? To answer the above questions, in this paper, we propose an Adaptive data-Free Quantization (AdaDFQ) method, which revisits DFQ from a zero-sum game perspective upon the sample adaptability between two players - a generator and a quantized network. Following this viewpoint, we further define the disagreement and agreement samples to form two boundaries, where the margin is optimized to address the over-and-under fitting issues, so as to generate the samples with adaptive adaptability to Q. Our AdaDFQ reveals: 1) the largest adaptability is NOT the best for sample generation to benefit Q's generalization;2) the knowledge of the generated sample should not be informative to Q only, but also related to the category and distribution information of the training data for P. The theoretical and empirical analysis validate the advantages of AdaDFQ over the state-of-the-arts. Our code is available at https://***/hfutqian/AdaDFQ. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：