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

12th CCF Conference on Bigdata, Bigdata 2024

作者： Wang, Jitian Chen, Yanping Zou, Anqi Qin, Yongbin Huang, Ruizhang Text Computing and Cognitive Intelligence Engineering Research Center of National Education Ministry Guizhou University Guiyang550025 China State Key Laboratory of Public Big Data Guizhou University Guiyang China College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9789819610235

In named entity recognition, the main methods for constructing deep neural networks are fine-tuning and prompt tuning. Fine-tuning is a commonly used paradigm to optimize neural networks by using task-specific objective functions to make them more adapted to solve downstream tasks. In which pre-trained language models are used as external resources to provide contextual representations. Prompt tuning is a recent paradigm in which the downstream tasks are reformulated to look more like those solved during the original PLM training with the help of a textual prompt. It is effective to utilize potential knowledge of PLMs. In this paper, we propose the fusion approach, which sufficiently fuses the semantics obtained by extracting fine-tuning and prompt-tuning. In our approach, the model makes decisions based on the information obtained from the reconstructive fusion of the fine-tuned semantics and the semantics of the pre-trained language model. The representation obtained by fine-tuning and the representation obtained by prompt tuning are reconstructed into a multidimensional semantics using a gate fusion module (GFM). In particularly, our model has two gate components, one gate to extract the semantics of fine-tuning and the other gate to extract the semantics of prompt tuning, and finally the reconstructed semantic representation is obtained. This takes full advantage of the potential knowledge of PLM. Our model is evaluated on the CONLL2003, ACE2005 and GENIA corpora. It achieves performance close to the state-of-the-art in F1 scores. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Emotional Knowledge Self-Distillation in Dialogue

Emotional Knowledge Self-Distillation in Dialogue

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhongquan Jian Yancheng Wang Weichao Wu Junfeng Yao Meihong Wang Qingqiang Wu School of Informatics Xiamen University Xiamen China School of Computing and Data Science Xiamen University Malaysia Selangor Malaysia School of Mechanics and Civil Engineering China University of Mining & Technology Beijing China School of Film Xiamen University Xiamen China Xiamen Key Laboratory of Intelligent Storage and Computing School of Informatics Xiamen University Xiamen China Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism Xiamen China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Recognizing emotions in dialogues is vital for effective human-computer interaction, yet remains a challenging task in Natural Language Processing (NLP). Previous studies in Emotion Recognition in Conversation (ERC) have primarily focused on contextual features, while overlooking the importance of emotional features in emotion recognition. To address this gap, we focus on the role of emotional features in ERC and propose a novel method, Emotional Knowledge Self-Distillation (EmoKSD 1 ), to enhance the model’s emotional sensitivity. In EmoKSD, utterances are enriched with implicit ⟨mask⟩ tokens to represent conveyed emotions, allowing the distillation of emotional knowledge from explicit emotional tokens to implicit ⟨mask⟩ tokens, thereby enhancing the model’s ability to perceive subtle emotions within the dialogue. Through thorough evaluations on two public ERC datasets (i.e., IEMOCAP and MELD) using proposed coarse-grained utterance distillation and fine-grained token distillation techniques, EmoKSD demonstrates superior performance compared to existing methods, highlighting the significance of emotional features in ERC.

关键词： Representation learning Human computer interaction Emotion recognition Sensitivity Speech recognition Signal processing Natural language processing Acoustics Speech processing

来源：评论

学校读者我要写书评

暂无评论

EagerLog: Active Learning Enhanced Retrieval Augmented Generation for Log-based Anomaly Detection

EagerLog: Active Learning Enhanced Retrieval Augmented Gener...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Chiming Duan Tong Jia Yong Yang Guiyang Liu Jinbu Liu Huxing Zhang Qi Zhou Ying Li Gang Huang School of Software and Microelectronics Peking University Beijing China Institute for Artificial Intelligence Peking University Beijing China National Key Laboratory of Data Space Technology and System Beijing China National Engineering Research Center for Software Engineering Peking University Beijing China Alibaba Cloud Computing Company Hangzhou China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Logs record essential information about system operations and serve as a critical source for anomaly detection, which has generated growing research interest. Utilizing large language models (LLMs) within a retrieval-augmented generation (RAG) framework for log-based anomaly detection is an effective approach due to its strong generalization capabilities and efficient few-shot performance. However, the effectiveness of this method hinges on the quality of the knowledge source, which can be impacted by noise and changes within the software systems. Facing these problems, in this paper, we propose a novel log-based anomaly detection method named EagerLog, employing active learning to choose the logs for humans to label, thereby adding them to the knowledge source, thus enhancing the knowledge source and maintaining its quality. Our experiments on three open datasets (BGL, Thunderbird, Zookeeper) and one industrial dataset demonstrate that EagerLog can achieve 93.65% F1 score with approximately 10 labeled log sequences, surpassing existing methods by 15.32%.

关键词： Training Industries Systems operation Large language models Retrieval augmented generation Active learning Noise Software systems Speech processing Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Rethinking attention mechanism for enhanced pedestrian attribute recognition

引用

Neurocomputing 2025年 639卷

作者： Wu, Junyi Huang, Yan Gao, Min Niu, Yuzhen Chen, Yuzhong Wu, Qiang Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fujian Fuzhou350108 China Engineering Research Center of BigData Intelligence Ministry of Education Fujian Fuzhou350108 China Australian Artificial Intelligence Institute University of Technology Sydney SydneyNSW2007 Australia Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou University Fujian Fuzhou350108 China School of Electrical and Data Engineering University of Technology Sydney SydneyNSW2007 Australia

Pedestrian Attribute Recognition (PAR) plays a crucial role in various computer vision applications, demanding precise and reliable identification of attributes from pedestrian images. Traditional PAR methods, though effective in leveraging attention mechanisms, often suffer from the lack of direct supervision on attention, leading to potential overfitting and misallocation. This paper introduces a novel and model-agnostic approach, Attention-Aware Regularization (AAR), which rethinks the attention mechanism by integrating causal reasoning to provide direct supervision of attention maps. AAR employs perturbation techniques and a unique optimization objective to assess and refine attention quality, encouraging the model to prioritize attribute-specific regions. Our method demonstrates significant improvement in PAR performance by mitigating the effects of incorrect attention and fostering a more effective attention mechanism. Experiments on standard datasets showcase the superiority of our approach over existing methods, setting a new benchmark for attention-driven PAR models. © 2025 The Authors

关键词： Perturbation techniques

来源：评论

学校读者我要写书评

暂无评论

Predicting the Risk of Incident Cardiovascular Disease Using Retinal Vessel Caliber Measured by Artificial Intelligence in a Chinese Community-Based Population

SSRN

引用

SSRN 2025年

作者： Luo, Xingyu Yang, Guangzhengao Fan, Fangfang Jiang, Yimeng Jia, Jia Zhao, Jie Chen, Zifan Yan, Shenshen She, Haicheng Zheng, Bo Zhang, Li Zhang, Yan Department of Cardiology Peking University First Hospital Beijing China Institute of Cardiovascular Disease Peking University First Hospital Beijing China Center for Data Science Peking University Beijing China National Engineering Laboratory for Big Data Analysis and Applications Peking University Beijing China Peking University Changsha Institute for Computing and Digital Economy Beijing China Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing Ophthalmology and Visual Science Key Lab Beijing China

Background: The predictive value of retinal vessel caliber, measured through artificial intelligence (AI), for incident cardiovascular disease (CVD) risk remains to be explored. Our study aimed to investigate the association between AI-measured retinal vessel caliber and the risk of incident CVD in a Chinese community-based population. Methods: We conducted a prospective cohort study on subjects from a Beijing community in China who were free of prevalent stroke or myocardial infarction and underwent retinal photography at baseline. By deep-learning algorithm, retinal vessel caliber measurements, including central retinal arteriolar equivalent (CRAE), central retinal venular equivalent (CRVE), and arteriolar-to-venular ratio (AVR), were obtained from 0.5 to 1 disc diameter from the optic disc margin. The primary endpoint was an incident major adverse cardiovascular event (MACE), defined as a composite of first non-fatal stroke, first non-fatal acute myocardial infarction (AMI), and cardiovascular death. The secondary endpoints included first stroke, first AMI, and cardiovascular death. Findings: A total of 3,585 participants were included. The mean age was 56.49 ± 8.94 years, and 2335 (65.1%) were female. Prevalence of prior hypertension and diabetes was 1594 (44.5%) and 676 (18.9%), respectively. The mean values for CRAE, CRVE, and AVR were 190.83 ± 29.92 μm, 278.26 ± 36.34 μm, and 0.69 ± 0.08, respectively. During the follow-up (median, 7.53 years), there were 293 cases of incident MACE (8.2%), 226 strokes (6.3%), 57 AMIs (1.6%), and 44 cardiovascular deaths (1.2%). The Kaplan–Meier curves showed significant differences in cumulative hazards of the primary endpoint among tertiles of CRAE, CRVE, and AVR. In Cox proportional-hazards models adjusting for covariates, CRAE was negatively associated with the risk of incident MACE (per 10 μm increase, hazard ratio [HR] = 0.95, 95% confidence interval [CI]: 0.92-0.99, P = 0.009) and the risk of incident stroke (per 10 μm

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Large Language Models Could Be Rote Learners

arXiv

引用

arXiv 2025年

作者： Xu, Yuyang Hu, Renjun Ying, Haochao Wu, Jian Shi, Xing Lin, Wei College of Computer Science and Technology Zhejiang University China School of Data Science and Engineering East China Normal University China State Key Laboratory of Transvascular Implantation Devices The Second Affiliated Hospital Zhejiang University School of Medicine China School of Public Health Zhejiang University China Zhejiang Key Laboratory of Medical Imaging Artificial Intelligence China Alibaba Cloud Computing

Multiple-choice question (MCQ) benchmarks are widely used for evaluating Large Language Models (LLMs), yet their reliability is undermined by benchmark contamination. In this study, we reframe contamination as an inherent aspect of learning and seek to disentangle genuine capability acquisition from superficial memorization in LLM evaluation. First, by analyzing model performance under different memorization conditions, we uncover a counterintuitive trend: LLMs perform worse on memorized MCQs than on non-memorized ones, indicating the coexistence of two distinct learning phenomena, i.e., rote memorization and genuine capability learning. To disentangle them, we propose TrinEval, a novel evaluation framework that reformulates MCQs into an alternative trinity format, reducing memorization while preserving knowledge assessment. Experiments validate TrinEval’s effectiveness in reformulation, and its evaluation reveals that common LLMs may memorize by rote 20.5% of knowledge points (in MMLU on average). Copyright © 2025, The Authors. All rights reserved.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Semantic Pre-Extraction for Energy-Efficient AoI Minimization in UAV-Assisted Wireless Networks

Semantic Pre-Extraction for Energy-Efficient AoI Minimizatio...

引用

IEEE Conference on Wireless Communications and Networking

作者： Yusi Long Gary C.F. Lee Lanhua Li Shimin Gong Sumei Sun Dusit Niyato School of Intelligent Systems Engineering Shenzhen Campus of Sun Yat-sen University China Guangdong Provincial Key Laboratory of Fire Science and Intelligent Emergency Technology China Institute for Infocomm Research (IR) A*STAR Singapore College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

This paper investigates an unmanned aerial vehicle (UAV)-assisted semantic communication network. The energy-limited ground users (GUs) provide semantic services to periodically generated raw data and a UAV relays the extracted semantic information to a base station (BS). Semantic extraction enhances data responsiveness and reduces the age-of-information (AoI) by transmitting only the most essential information. However, more complex semantic extraction increases energy consumption, making it easier for the GUs to deplete their energy. Therefore, we introduce a novel energy-efficient AoI (EAoI) metric to capture both information freshness and energy consumption of the GUs. We formulate a time-averaged EAoI minimization problem by jointly optimizing the GUs' scheduling, pre-extraction strategy, semantic control, computing resource allocation, and the UAV's trajectory. We further propose a semantic-aware joint pre-extraction and trajectory planning (Sem-JPT) algorithm to decompose the complex optimization problem into three subproblems, which are solved by a series of approximation methods. Simulation results demonstrate that semantic communication can reduce the overall EAoI by more than 18% compared with conventional bit-based communication. Moreover, the proposed Sem-JPT algorithm can maintain information freshness and prolong the GUs' lifetimes, outperforming existing baselines.

关键词： Energy consumption Trajectory planning Processor scheduling Wireless networks Semantic communication Minimization Information age Energy efficiency Trajectory data mining

来源：评论

学校读者我要写书评

暂无评论

ES-GP: An Ensemble Surrogate-Assisted Genetic Programming Approach to Image Classification

引用

IEEE Transactions on Evolutionary Computation 2025年

作者： Fan, Qinglan Zhang, Yunfeng Yao, Xunxiang Bi, Ying Xue, Bing Zhang, Mengjie Shandong University of Finance and Economics School of Computing and Artificial Intelligence Shandong Key Laboratory of Lightweight Intelligent Computing and Visualization for Digital Economy Jinan 250014 China Zhengzhou University School of Electrical and Information Engineering Zhengzhou 450001 China State Key Laboratory of Intelligent Agricultural Power Equipment Luoyang 471000 China Victoria University of Wellington Center for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington 6140 New Zealand

Genetic Programming (GP) is a promising evolutionary machine learning technique for image classification, known for its ability to evolve flexible, effective, and interpretable models. However, the high computational cost of fitness evaluations in evolutionary learning restricts its practical applications. While Surrogate models offer efficient approximations for costly fitness evaluations, their application in GP-based image classification remains in its early stages, facing challenges such as handing flexible tree-based representations with variable lengths, designing an effective surrogate, and the limited performance of a single surrogate across various image classification tasks. To address these issues, this paper proposes an ensemble surrogate-assisted GP approach to image classification. The new approach constructs one global surrogate model to explore broad areas and three local surrogate models within specific subspaces to exploit local regions, enabling more accurate predictions of GP individuals' fitness. Moreover, a dynamic weighting strategy is developed to assign different weights to the base surrogate models in the ensemble, improving prediction accuracy. Additionally, the proposed approach refines the surrogate training set1 construction method, previously limited to single-tree GP, enabling it to accelerate both single-tree and multi-tree GP 2 for image classification. Experimental results on five datasets of varying difficulty demonstrate that the new ensemble surrogate method significantly reduces the number of expensive fitness evaluations of both single-tree and multi-tree GP-based image classification methods while achieving competitive performance. The comparisons with other state-of-the-art methods also confirm its effectiveness. © 1997-2012 IEEE.

关键词： Ensemble Fitness Evaluations Genetic Programming Image Classification Surrogate Models

来源：评论

学校读者我要写书评

暂无评论

COph100: A comprehensive fundus image registration dataset from infants constituting the "RIDIRP" database

arXiv

引用

arXiv 2025年

作者： Hu, Yan Gong, Mingdao Qiu, Zhongxi Liu, Jiabao Shen, Hongli Yuan, Mingzhen Zhang, Xiaoqing Li, Heng Lu, Hai Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing Ophthalmology and Visual Sciences Key Laboratory Beijing China Center for High Performance Computing and Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

Retinal image registration is vital for diagnostic therapeutic applications within the field of ophthalmology. Existing public datasets, focusing on adult retinal pathologies with high-quality images, have limited number of image pairs and neglect clinical challenges. To address this gap, we introduce COph100, a novel and challenging dataset known as the Comprehensive Ophthalmology Retinal Image Registration dataset for infants with a wide range of image quality issues constituting the public "RIDIRP" database1. COph100 consists of 100 eyes, each with 2 to 9 examination sessions, amounting to a total of 491 image pairs carefully selected from the publicly available dataset. We manually labeled the corresponding ground truth image points and provided automatic vessel segmentation masks for each image. We have assessed COph100 in terms of image quality and registration outcomes using state-of-the-art algorithms. This resource enables a robust comparison of retinal registration methodologies and aids in the analysis of disease progression in infants, thereby deepening our understanding of pediatric ophthalmic conditions. Copyright © 2025, The Authors. All rights reserved.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：