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

Large language model for table processing: a survey

Frontiers of Computer Science 2025年第2期19卷 71-87页

作者： Weizheng LU Jing ZHANG Ju FAN Zihao FU Yueguo CHEN Xiaoyong DU School of Information Renmin University of ChinaBeijing 100872China Key Laboratory of Data Engineering and Knowledge Engineering Beijing 100872China WPS Office Kingsoft Co.Zhuhai 519080China

Tables,typically two-dimensional and structured to store large amounts of data,are essential in daily activities like database queries,spreadsheet manipulations,Web table question answering,and image table information *** these table-centric tasks with Large Language Models(LLMs)or Visual Language Models(VLMs)offers significant public benefits,garnering interest from academia and *** survey provides a comprehensive overview of table-related tasks,examining both user scenarios and technical *** covers traditional tasks like table question answering as well as emerging fields such as spreadsheet manipulation and table data *** summarize the training techniques for LLMs and VLMs tailored for table ***,we discuss prompt engineering,particularly the use of LLM-powered agents,for various tablerelated ***,we highlight several challenges,including diverse user input when serving and slow thinking using chainof-thought.

关键词： data mining and knowledge discovery table processing large language model

来源：评论

学校读者我要写书评

暂无评论

Weak Multi-Label data Stream Classification Under Distribution Changes in Labels

引用

IEEE Transactions on Big data 2025年第3期11卷 1369-1380页

作者： Zou, Yizhang Hu, Xuegang Li, Peipei Hu, Jun Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei230002 China National University of Singapore School of Computing 119077 Singapore

Multi-label stream classification aims to address the challenge of dynamically assigning multiple labels to sequentially arrived instances. In real situations, only partial labels of instances can be observed due to the expensive human annotations, and the problem of label distribution changes arises from multiple labels in a streaming mode, but few existing works jointly consider such challenges. Motivated by this, we propose the problem of weak multi-label stream classification (WMSC) and an online classification algorithm robust to weak labels. Specifically, we incrementally update the margin-based model using information from both the past model and the current incoming instance with partially observed labels. To increase the robustness to weak labels, we first adjust the classification margin of negative labels using the label causality matrix, which is constructed by the conditional probability of label pairs. Second, we introduce the label prototype matrix to regulate the margin by controlling the weighting parameter of the slack term. Additionally, to handle the potential distribution changes in labels, we utilize the instance-specific threshold via online thresholding to perform binary classification, which is formulated as a regression problem. Finally, theoretical analysis and empirical experimental results are presented to demonstrate the effectiveness of WMSC in classifying unobserved streaming instances. © 2015 IEEE.

关键词： Labeled data

来源：评论

学校读者我要写书评

暂无评论

Histological Image Diagnosis of Breast Cancer Based on Multi-Attention Convolution Neural Network

引用

Journal of Shanghai Jiaotong university(Science) 2025年第1期30卷 91-106页

作者： XU Wangwang XU Liangfeng LIU Ninghui LU Na Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei230601China School of Computer and Information Hefei University of TechnologyHefei230601China First Affiliated Hospital of Anhui Medical University Hefei230022China

Breast cancer is a serious and high morbidity disease in women,and it is the main cause of cancer death in ***,getting tested and diagnosed early can reduce the risk of *** present,there are clinical examinations,imaging screening and biopsies,among which histopathological examination is the gold ***,the process is complicated and time-consuming,and misdiagnosis may *** paper puts forward a classification framework based on deep learning,introducing multi-attention mechanism,selecting kernel convolution instead of ordinary convolution,and using different weights and combinations to pay attention to the accuracy index and growth rate of the *** addition,we also compared the learning rate *** function can fine-tune the learning rate to achieve good performance,using label softening to reduce the loss error caused by model error recognition in the label,and assigning different category weights in the loss function to balance the positive and negative *** used the BreakHis data set to automatically classify histological images into benign and malignant,four categories and eight *** results showed that the accuracy of binary classifications ranged from 98.23%to 98.83%,and that of multiple classifications ranged from 97.89%to 98.11%.

关键词： breast cancer deep learning attentional mechanism classification diagnosis

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Multitasking Algorithm for Efficient Multiobjective Recommendations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Gupacker: Generalized Unpacking Framework for Android Malware

引用

IEEE Transactions on information Forensics and Security 2025年 20卷 4338-4352页

作者： Zheng, Tao Hou, Qiyu Chen, Xingshu Ren, Hao Li, Meng Li, Hongwei Shen, Changxiang Sichuan University School of Cyber Science and Engineering Chengdu610065 China Sichuan University School of Cyber Science and Engineering Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province School of Computer Science and Information Engineering Hefei230002 China University of Padua Department of Mathematics HIT Center Padua35131 Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Sichuan University Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China

Android malware authors often use packers to evade analysis. Although many unpacking tools have been proposed, they face two significant challenges: 1) They are easily impeded by anti-analysis techniques employed by packers, preventing efficient collection of hidden Dex data. 2) They are typically designed to unpack a specific packer and cannot handle malware packed with mixed packers. Consequently, many packed malware samples evade detection. To bridge this gap, we propose Gupacker , a novel generalized unpacking framework. Gupacker offers a generic solution for first-generation holistic packer by customizing the Android system source code. It identifies the type of packer and selects an appropriate unpacking function, constructs a deeper active call chain to achieve generic unpacking of second-generation function extraction packers, and uses JNI function and instruction monitoring to handle third-generation virtual obfuscation packer. On this basis, we counteract a diverse array of anti-analysis techniques. We conduct extensive experiments on 5K packed Android malware samples, comparing Gupacker with 2 commercial and 4 state-of-the-art academic unpacking tools. The results demonstrate that Gupacker significantly improves the efficiency of Android malware unpacking with acceptable system overhead. We analyze real packed applications based on Gupacker and found several are second-packed by attackers, including WPS for Android, with tens of millions of users. We receive and responsibly report 13 0day vulnerabilities and also assist in the remediation of all vulnerabilities. © 2005-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Survey on Deep Learning in Abdominal Imaging: datasets, Techniques, and Performance Metrics

引用

IEEE Access 2025年 13卷 79894-79914页

作者： Bellal, Mariem El Fkihi, Sanaa Cengiz, Korhan Ivkovic, Nikola ENSIAS Mohammed V University in Rabat Information Retrieval and Data Analytics Laboratory Rabat10000 Morocco Prince Mohammad Bin Fahd University Department of Electrical Engineering Al Khobar31952 Saudi Arabia University of Zagreb Faculty of Organization and Informatics Varaždin42000 Croatia

Integrating Deep Learning (DL) into abdominal imaging represents a significant leap forward in diagnosing and managing abdominal conditions, offering the potential to transform conventional medical practices. This comprehensive survey explores the application of DL techniques, such as Convolutional Neural Networks (CNN), Recurrent Neural Networks (RNN), and Generative Adversarial Networks (GAN), across various domains of abdominal imaging, including liver, spleen, kidney, and other structures such as subcutaneous adipose tissue (SAT), muscle, viscera, and bone. It discusses the critical role of performance metrics in evaluating model efficacy and clinical applicability. Furthermore, the paper highlights emerging trends in DL, such as integrating multimodal data and exploring unsupervised and semi-supervised learning techniques, which promise to address current limitations and pave the way for future advancements. Ethical considerations, including algorithmic bias, transparency in model development, and equitable patient care, are thoroughly examined to underscore the importance of ethical practices in deploying Artificial Intelligence (AI) technologies in healthcare. © 2013 IEEE.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

KAN v.s. MLP for Offline Reinforcement Learning

KAN v.s. MLP for Offline Reinforcement Learning

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： 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

ISBN: (纸本)9798350368741

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 to 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 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 allows us to choose the base networks according to the offline RL task requirements. © 2025 IEEE.

关键词： KAN Kolmogorov-Arnold networks MLP multilayer perceptrons offline reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Federated Incremental Named Entity Recognition 31

Federated Incremental Named Entity Recognition

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Liu, Zesheng Zhu, Qiannan 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 School of Artificial Intelligence Beijing Normal University Beijing China Engineering Research Center of Intelligent Technology and Educational Application MOE China

ISBN: (纸本)9798891761964

Federated learning-based Named Entity Recognition (FNER) has attracted widespread attention through decentralized training on local clients. However, most FNER models assume that entity types are pre-fixed, so in practical applications, local clients constantly receive new entity types without enough storage to access old entity types, resulting in severe forgetting on previously learned knowledge. In addition, new clients collecting only new entity types may join the global training of FNER irregularly, further exacerbating catastrophic forgetting. To overcome the above challenges, we propose a Forgetting-Subdued Learning (FSL) model which solves the forgetting problem on old entity types from both intra-client and inter-client two aspects. Specifically, for intra-client aspect, we propose a prototype-guided adaptive pseudo labeling and a prototypical relation distillation loss to surmount catastrophic forgetting of old entity types with semantic shift. Furthermore, for inter-client aspect, we propose a task transfer detector. It can identify the arrival of new entity types that are protected by privacy and store the latest old global model for relation distillation. Qualitative experiments have shown that our model has made significant improvements compared to several baseline methods. © 2025 Association for Computational Linguistics.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

CoT-based Synthesizer: Enhancing LLM Performance through Answer Synthesis

arXiv

引用

arXiv 2025年

作者： Zhang, Bohan Zhang, Xiaokang Zhang, Jing Yu, Jifan Luo, Sijia Tang, Jie School of Information Renmin University of China China Tsinghua University China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

Current inference scaling methods, such as Self-consistency and Best-of-N, have proven effective in improving the accuracy of LLMs on complex reasoning tasks. However, these methods rely heavily on the quality of candidate responses and are unable to produce correct answers when all candidates are incorrect. In this paper, we propose a novel inference scaling strategy, CoT-based Synthesizer, which leverages CoT reasoning to synthesize superior answers by analyzing complementary information from multiple candidate responses, even when all candidate responses are flawed. To enable a lightweight and cost-effective implementation, we introduce an automated data generation pipeline that creates diverse training data. This allows smaller LLMs trained on this data to improve the inference accuracy of larger models, including API-based LLMs. Experimental results across four benchmark datasets with seven policy models demonstrate that our method significantly enhances performance, with gains of 11.8% for Llama3-8B and 10.3% for GPT-4o on the MATH dataset. The corresponding training data and code are publicly available on the repository. Copyright © 2025, The Authors. All rights reserved.

关键词： data accuracy

来源：评论

学校读者我要写书评

暂无评论

Dynamic Scaling of Unit Tests for Code Reward Modeling

arXiv

引用

arXiv 2025年

作者： Ma, Zeyao Zhang, Xiaokang Zhang, Jing Yu, Jifan Luo, Sijia Tang, Jie School of Information Renmin University of China China Tsinghua University China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

Current large language models (LLMs) often struggle to produce accurate solutions on the first attempt for code generation. Prior research tackles this challenge by generating multiple candidate solutions and validating them with LLM-generated unit tests. The execution results of unit tests serve as reward signals to identify correct solutions. As LLMs always confidently make mistakes, these unit tests are not reliable, thereby diminishing the quality of reward signals. Motivated by the observation that scaling the number of solutions improves LLM performance, we explore the impact of scaling unit tests to enhance reward signal quality. Our pioneer experiment reveals a positive correlation between the number of unit tests and reward signal quality, with greater benefits observed in more challenging problems. Based on these insights, we propose CodeRM-8B, a lightweight yet effective unit test generator that enables efficient and high-quality unit test scaling. Additionally, we implement a dynamic scaling mechanism that adapts the number of unit tests based on problem difficulty, further improving efficiency. Experimental results show that our approach significantly improves performance across various models on three benchmarks (e.g., with gains of 18.43% for Llama3-8B and 3.42% for GPT-4o-mini on HumanEval Plus). © 2025, CC BY-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：