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

arXiv 2025年

作者： Li, Haoyang Wu, Shang Zhang, Xiaokang Huang, Xinmei Zhang, Jing Jiang, Fuxin Wang, Shuai Zhang, Tieying Chen, Jianjun Shi, Rui Chen, Hong Li, Cuiping Engineering Research Center of Database and Business Intelligence MOE China School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE China ByteDance Inc China

Text-to-SQL, the task of translating natural language questions into SQL queries, plays a crucial role in enabling non-experts to interact with databases. While recent advancements in large language models (LLMs) have significantly enhanced text-to-SQL performance, existing approaches face notable limitations in real-world text-to-SQL applications. Prompting-based methods often depend on closed-source LLMs, which are expensive, raise privacy concerns, and lack customization. Fine-tuning-based methods, on the other hand, suffer from poor generalizability due to the limited coverage of publicly available training data. To overcome these challenges, we propose a novel and scalable text-to-SQL data synthesis framework for automatically synthesizing large-scale, high-quality, and diverse datasets without extensive human intervention. Using this framework, we introduce SynSQL-2.5M, the first million-scale text-to-SQL dataset, containing 2.5 million samples spanning over 16,000 synthetic databases. Each sample includes a database, SQL query, natural language question, and chain-of-thought (CoT) solution. Leveraging SynSQL-2.5M, we develop OmniSQL, a powerful open-source text-to-SQL model available in three sizes: 7B, 14B, and 32B. Extensive evaluations across nine datasets demonstrate that OmniSQL achieves state-of-the-art performance, matching or surpassing leading closed-source and open-source LLMs, including GPT-4o and DeepSeek-V3, despite its smaller size. We release all code, datasets, and models to support further research. Copyright © 2025, The Authors. All rights reserved.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic Constrained Optimization

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic C...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Bu, Chenyang Liu, Yuxin Zhang, Lizhong Zhu, Tao Luo, Wenjian School of Computer Science and Information Engineering Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Anhui Hefei230027 China School of Computer Science and Information Engineering University of South China Hunan Hengyang421200 China School of Computer Science and Technology Harbin Institute of Technology Guangdong Shenzhen518000 China

ISBN: (纸本)9798350337020

Nature-inspired population-based stochastic search algorithms (SSA) have demonstrated effectiveness in solving many real-world dynamic optimization problems (DOPs), such as dynamic optimal power flow (DOPF) problems. The basic idea of solving DOPs using SSAs is to 'track the moving optima', rather than solving the changed problems from scratch. Its hidden assumption is that the problems are slightly changed in general, and it is expected that the search process can be accelerated by learning from past search experiences. However, the hidden assumption that the current search process can always benefit from previous search experiences might not be true for certain cases. For example, if the current problem is not similar to any of its previous problems, the historical solutions might not be helpful for the current search. To reduce such negative transfer, the following issues are worthy of study: how to choose which historical problems to learn from, and how to determine the degree of learning from historical problems. To solve the above problems, we propose a dynamic processing framework based on fuzzy rules from the perspective of incorporating human knowledge for optima tracking. The experimental results on the DOPF problems show that the SSA with the proposed optima tracking strategy outperforms other comparative algorithms. We open up the code and data of our algorithm44https://***/DMiC-Lab-HFUT/SMDE-Transfer. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Classifier Belief Optimization for Visual Categorization 27th

Classifier Belief Optimization for Visual Categorization

引用

27th International Conference on MultiMedia Modeling, MMM 2021

作者： Yang, Gang Li, Xirong Key Lab of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9783030678319

Classifier belief represents the confidence of a classifier making judgment about a special instance. Based on classifier belief, we propose an approach to realize classifier belief optimization. Through enriching prior knowledge and thus reducing the scope of candidate classes, our approach improves classification accuracy. A feature perturbation strategy containing an objective optimization is developed to automatically generate labeled instances. Moreover, we propose a classifier consensus strategy (CCS) for classifier optimization. CCS enables a given classifier to take full advantage of the test data to enrich prior knowledge. Experiments on three benchmark datasets and three classical classifiers justify the validity of the proposed approach. We improve the classification accuracy of a linear SVM by 6%. © 2021, Springer Nature Switzerland AG.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Generation for Zero-Shot Learning 27th

Fine-Grained Generation for Zero-Shot Learning

引用

27th International Conference on MultiMedia Modeling, MMM 2021

作者： Sun, Weimin Xu, Jieping Yang, Gang Key Lab of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9783030678319

Although zero-shot learning (ZSL) has achieved success in recognizing unseen classes images, most previous studies focus on feature projection from one domain to another, neglecting the domain shift problem caused by differences in classes. In this paper, we propose two novel methods in terms of attributes and features for ZSL problem. The first is Sample-Level Attribute Generation via GAN (SLA-GAN) that generates sample-level attributes. Considering the influence of lighting, environment, weather and other factors, the description based on class-level attributes will be biased. SLA-GAN generates sample-level attributes to describe each sample. Specially, we train a conditional Wasserstein GAN in which the generator synthesizes sample-level attributes from features and the discriminator distinguishes the sample-level from class-level attributes. Apart from that, we propose a novel method Fine-Grained Sample Generation via GAN (FGS-GAN) which can generate the unseen samples from the most similar samples of seen classes. Finally, we replace the class-level attributes with sample-level attributes in FGS-GAN and analyze the effects of sample-level attributes on synthesized features. Experiments on five benchmark data set show that our models outperform state-of-the-art methods in ZSL. © 2021, Springer Nature Switzerland AG.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Personalized Clustering via Targeted Representation Learning 39

Personalized Clustering via Targeted Representation Learning

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Geng, Xiwen Zhao, Suyun Yu, Yixin Peng, Borui Du, Pan Chen, Hong Li, Cuiping Wang, Mengdie Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China China School of Information Renmin University of China China School of Statistics Remin University of China China

ISBN: (纸本)157735897X

Clustering traditionally aims to reveal a natural grouping structure within unlabeled data. However, this structure may not always align with users’ preferences. In this paper, we propose a personalized clustering method that explicitly performs targeted representation learning by interacting with users via modicum task information (e.g., must-link or cannot-link pairs) to guide the clustering direction. We query users with the most informative pairs, i.e., those pairs most hard to cluster and those most easy to miscluster, to facilitate the representation learning in terms of the clustering preference. Moreover, by exploiting attention mechanism, the targeted representation is learned and augmented. By leveraging the targeted representation and constrained contrastive loss as well, personalized clustering is obtained. Theoretically, we verify that the risk of personalized clustering is tightly bounded, guaranteeing that active queries to users do mitigate the clustering risk. Experimentally, extensive results show that our method performs well across different clustering tasks and datasets, even when only a limited number of queries are available. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

基于数据挖掘技术的税务风险检测方法评述

引用

engineering 2024年第3期34卷 43-59页

作者： Qinghua Zheng Yiming Xu Huixiang Liu Bin Shi Jiaxiang Wang Bo Dong School of Computer Science and Technology Xi’an Jiaotong UniversityXi’an 710049China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong UniversityXi’an 710049China School of Distance Education Xi’an Jiaotong UniversityXi’an 710049China

Tax risk behavior causes serious loss of fiscal revenue,damages the country’s public infrastructure,and disturbs the market economic order of fair *** recent years,tax risk detection,driven by information technology such as data mining and artificial intelligence,has received extensive *** promote the high-quality development of tax risk detection methods,this paper provides the first comprehensive overview and summary of existing tax risk detection methods *** specifi-cally,it first discusses the causes and negative impacts of tax risk behaviors,along with the development of tax risk *** then focuses on data-mining-based tax risk detection methods utilized around the *** on the different principles employed by the algorithms,existing risk detection methods can be divided into two categories:relationship-based and non-relationship-based.A total of 14 risk detection methods are identified,and each method is thoroughly explored and ***,four major technical bottlenecks of current data-driven tax risk detection methods are analyzed and discussed,including the difficulty of integrating and using fiscal and tax fragmented knowledge,unexplainable risk detection results,the high cost of risk detection algorithms,and the reliance of existing algorithms on labeled *** investigating these issues,it is concluded that knowledge-guided and datadriven big data knowledge engineering will be the development trend in the field of tax risk in the future;that is,the gradual transition of tax risk detection from informatization to intelligence is the future development direction.

关键词： Tax risk detection data mining knowledge guide Informatization Intellectualization

来源：评论

学校读者我要写书评

暂无评论

Superclass Learning with Representation Enhancement

Superclass Learning with Representation Enhancement

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Zeyu Gan Suyun Zhao Jinlong Kang Liyuan Shang Hong Chen Cuiping Li Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing China Renmin University of China Beijing China

In many real scenarios, data are often divided into a handful of artificial super categories in terms of expert knowledge rather than the representations of images. Concretely, a superclass may contain massive and various raw categories, such as refuse sorting. Due to the lack of common semantic features, the existing classification techniques are intractable to recognize superclass without raw class labels, thus they suffer severe performance damage or require huge annotation costs. To narrow this gap, this paper proposes a superclass learning framework, called SuperClass Learning with Representation Enhancement(SCLRE), to recognize super categories by leveraging enhanced representation. Specifically, by exploiting the self-attention technique across the batch, SCLRE collapses the boundaries of those raw categories and enhances the representation of each superclass. On the enhanced representation space, a superclassaware decision boundary is then reconstructed. Theoretically, we prove that by leveraging attention techniques the generalization error of SCLRE can be bounded under superclass scenarios. Experimentally, extensive results demonstrate that SCLRE outperforms the baseline and other contrastive-based methods on CIFAR-100 datasets and four high-resolution datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：