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

data Driven Control and Learning Systems (DDCLS)

作者： Xuguo Jiao Daoyuan Zhang Xin Wang Zhaoxing Ma Zhenyong Zhang Wenfeng Liu School of Information and Control Engineering Qingdao University of Technology Qingdao China State Key Laboratory of Industrial Control Technology College of Control Science and Engineering Zhejiang University Hangzhou China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China School of Civil Engineering Qingdao University of Technology Qingdao China

ISBN: (数字)9798350361674

ISBN: (纸本)9798350361681

Active power dispatch of wind farms plays an important role in power grid scheduling. In this paper, a data-driven active power dispatch strategy for wind farms is proposed, which uses the key point of minimizing the standard deviation of wind turbines' output power series to reduce their fluctuations. First, to build the optimization problem, the historical active power output data of each wind turbine is collected from the Supervisory Control And data Acquisition (SCADA) system. Then, the objective function is developed based on the idea of minimizing the standard deviation of the output power time series. Meanwhile, considering the constraints of wind turbines' output power and active power balance of the grid, the feasible domain of the cost function is constructed. Further, to solve the proposed nonlinear optimization problem with equality and inequality constraints, the trust region interior point method (TRIPM) is employed to explore optimal solution within the feasible domain. Finally, actual data collected from wind farms is used to test effectiveness of the designed approach and experimental results show that our method can achieve better output power smoothing performance than conventional Proportional Dispatch (PD) method.

关键词： Fluctuations Time series analysis SCADA systems Power smoothing Wind farms Linear programming Power grids

来源：评论

学校读者我要写书评

暂无评论

CSLP: Collaborative Solution to Long-Tail Problem and Popularity Bias in Sequential Recommendation

CSLP: Collaborative Solution to Long-Tail Problem and Popula...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yan Huang Zhenyu Yang Wenyue Hu Baojie Xu Zhibo Zhang The Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Sequential Recommender Systems (SRS), leveraging the temporal information from users' behaviors, have noticeably improved user experience against traditional systems. However, these behaviors often follow long-tail distribution, making the systems biased towards popular items (i.e., popularity bias). Moreover, popularity bias would amplify the neglect of long-tail recommendations, thereby sharpening the long-tail problem. Previous researches usually address these challenges independently, focusing on reducing the over-recommendation of popular items or enhancing the representation quality of tail items. Indeed, it is possible to incorporate their merits to achieve the best of both worlds. Thus, we propose a novel and unified framework, named Collaborative Solution to Long tailed problem and Popularity bias (CSLP), to tackle both the long-tail problem and popularity bias simultaneously. To achieve this, we first introduce a representation enhancement module featuring dual generators to enhance user and item representations, particularly for those in the tail. On the other hand, a debiasing module incorporating an Inverse Propensity Score (IPS) with a clipping strategy is introduced to further alleviate the popularity bias. Specifically, this clipping strategy demonstrates a clear decrease in the original IPS method's variance, effectively improving the recommendation for stability and accuracy. Experiments on three widely-used datasets show CSLP's effectiveness in solving both issues. CSLP surpasses all baselines (traditional, popularity bias, and long-tail problem) in overall performance, significantly enhancing recommendation accuracy for both tail users and items, and achieving a more balanced ratio of recommendations between popular and tail items. Code is available at https://***/Echohuangyan/CSLP.

关键词： Hands Heavily-tailed distribution Accuracy Collaboration Tail Linear programming Generators User experience IP networks Recommender systems

来源：评论

学校读者我要写书评

暂无评论

LoRA-C: Parameter-Efficient Fine-Tuning of Robust CNN for IoT Devices

arXiv

引用

arXiv 2024年

作者： Ding, Chuntao Cao, Xu Xie, Jianhang Fan, Linlin Wang, Shangguang Lu, Zhichao School of Artificial Intelligence Beijing Normal University Beijing China Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education with School of Computer Science and Technology Beijing Jiaotong University Beijing100044 China School of Computer and Information Engineering Henan Normal University Henan453007 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Computer Science City University of Hong Kong HKSAR Hong Kong

Efficient fine-tuning of pre-trained convolutional neural network (CNN) models using local data is essential for providing high-quality services to users using ubiquitous and resource-limited Internet of Things (IoT) devices. Low-Rank Adaptation (LoRA) fine-tuning has attracted widespread attention from industry and academia because it is simple, efficient, and does not incur any additional reasoning burden. However, most of the existing advanced methods use LoRA to fine-tune Transformer, and there are few studies on using LoRA to fine-tune CNN. The CNN model is widely deployed on IoT devices for application due to its advantages in comprehensive resource occupancy and performance. Moreover, IoT devices are widely deployed outdoors and usually process data affected by the environment (such as fog, snow, rain, etc.). The goal of this paper is to use LoRA technology to efficiently improve the robustness of the CNN model. To this end, this paper first proposes a strong, robust CNN fine-tuning method for IoT devices, LoRA-C, which performs low-rank decomposition in convolutional layers rather than kernel units to reduce the number of fine-tuning parameters. Then, this paper analyzes two different rank settings in detail and observes that the best performance is usually achieved when α/r is a constant in either standard data or corrupted data. This discovery provides experience for the widespread application of LoRA-C. Finally, this paper conducts many experiments based on pre-trained models. Experimental results on CIFAR-10, CIFAR-100, CIFAR-10-C, and Icons50 datasets show that the proposed LoRA-Cs outperforms standard ResNets. Specifically, on the CIFAR-10-C dataset, the accuracy of LoRA-C-ResNet-101 achieves 83.44% accuracy, surpassing the standard ResNet-101 result by +9.5%. On the Icons-50 dataset, the accuracy of LoRA-C-ResNet-34 achieves 96.9% accuracy, surpassing the standard ResNet-34 result by +8.48%. In addition, compared with full parameter fine-tuning, LoRA-

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Text Classification for Judicial Texts via Dual Graph and Label Feature Fusion

Multi-Label Text Classification for Judicial Texts via Dual ...

引用

Smart World Congress (SWC), IEEE

作者： Qiliang Gu Qin Lu Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331520861

ISBN: (纸本)9798331520878

The legal judgement prediction (LJP) of judicial texts represents a multi-label text classification (MLTC) problem, which in turn involves three distinct tasks: the prediction of charges, legal articles, and terms of penalty. Nevertheless, extant multi-label text classification models tend to eschew the consideration of multiple correlations and semantic information between labels when predicting judicial texts, which may result in the loss of pertinent information. Furthermore, these models do not take full advantage of the local and overall information of the labels in the process of selecting appropriate labels for the text using the multi-head attention mechanism. To address these issues, we propose a new model, BGFLFF, which explores label correlation and semantics among the three tasks by employing Graph Convolutional Network (GCN) and multi-head attention mechanisms. In particular, we propose a Bi-Graph Fusion GCN (BGF-GCN), which fuses the co-occurrence matrix of labels with the cosine similarity matrix, thereby fully exploiting the multiple correlations between labels. Furthermore, prior to embedding the tags, the interpretations of the labels are obtained via Google in order to enhance the semantic information between the labels. To further reinforce the interconnections between labels and text and more effectively comprehend the interrelationships between the three tasks, we propose a Multi-Head Label Feature Fusion Attentional Mechanism (MH-LFFAtt), which assigns distinct weights to the pertinent label information in the text by fusing the local and overall features of the labels. The experimental results demonstrate that the F1 score exhibits an improvement of up to ${2. 2 8 \%}$ and a minimum of ${1. 2 9 \%}$ across the various tasks of the two datasets. This evidence substantiates the assertion that BGFLFF outperforms the existing baseline model.

关键词： Attention mechanisms Correlation Law Graph convolutional networks Fuses Text categorization Semantics Predictive models Multitasking Internet

来源：评论

学校读者我要写书评

暂无评论

Disentangling Interest and Conformity Representation to Mitigate Popularity Bias for Sequential Recommendation

Disentangling Interest and Conformity Representation to Miti...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Wenyue Hu Zhenyu Yang Yan Huang Zhibo Zhang Baojie Xu Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

The objective of sequential recommendation is to predict user preferences for items based on historical interaction sequences. This process often leads to a phenomenon known as popularity bias, where popular items are excessively recommended. Conformity, the tendency of users to follow popular items, is a significant factor contributing to this issue. Previous methods have not adequately disentangled conformity and interest, failing to accurately model users’ true intent. To address this, we propose a novel Disentangled Interest and Conformity Sequential Recommendation method (DICSRec) to mitigate the popularity bias. Specifically, we first design an Intent Encoding Module (IEM), which includes two independent encoders for conformity and interest to model their representations. To better disentangle these two factors, we design a disentangling task with proxy-based self-supervised learning and orthogonal regularization. Furthermore, to provide the Intent Encoding Module with more global information, we design a Global Conformity-aware Module (GCM), which supplies item popularity information and aids in enhancing user conformity representation. Lastly, recognizing the varying significance of user conformity and interest, we propose an adaptive Fusion Prediction Module (FPM) that adaptively aggregates user conformity and interest representations for final prediction. Experiments on four real-world datasets consistently demonstrate the superiority of our method over advanced sequential recommendation models. Code implementation is available at: https://***/lyra0611/DICSRec.

关键词： Adaptation models Codes Fuses Aggregates Neural networks Self-supervised learning Multitasking

来源：评论

学校读者我要写书评

暂无评论

A Cross-Modal Interactive Memory Network Based on Fine-Grained Medical Feature Extraction for Radiology Report Generation

A Cross-Modal Interactive Memory Network Based on Fine-Grain...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Xitong Ma Yuansen Kuang Lin Yuan Cheng Tian Yijie Zeng Song Liu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Radiology report generation is an essential task in the medical field, which aims to automate the generation of medical terminology descriptions of radiology images. However, this task currently suffers from several problems: 1) existing methods need to manually build knowledge graphs or templates (consuming time and effort) to introduce medical or prior knowledge to assist in report generation; 2) previous models cannot handle the problem of data bias well (anomaly reports and anomaly descriptions make up only a tiny portion of the dataset), causing the models to ignore the learning of anomaly descriptions easily; 3) existing approaches cannot robustly supervise the model, resulting in incomplete and inconsistent reports being generated. To address these issues, we propose a cross-modal interactive memory network based on fine-grained medical feature extraction. In our model, we design a cross-modal interactive memory network to automatically store and remember the required medical text knowledge and use this medical knowledge to help generate reports. Furthermore, we design an abnormal medical knowledge enhancement module to enhance the learning of abnormal fine-grained knowledge through the interaction of disease topics and their states to interact with text features. In addition, we design a cross-modal joint semantic loss unit to reduce semantic differences between different features and improve the visual representation ability of the model. We experimented and evaluated our model on MIMIC-CXR and IU-Xray datasets to compare with other baseline models.

关键词： knowledge engineering Visualization Terminology Semantics MIMICs Memory management Radiology Feature extraction data models Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

FineFormer: Fine-Grained Adaptive Object Transformer for Image Captioning

FineFormer: Fine-Grained Adaptive Object Transformer for Ima...

引用

IEEE International Conference on data Mining (ICDM)

作者： Bo Wang Zhao Zhang Jicong Fan Mingbo Zhao Choujun Zhan Mingliang Xu School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China School of Information Science and Technology Donghua University Shanghai China School of Electrical and Computer Engineering Nanfang College Guangzhou Guangzhou China School of Information Engineering Zhengzhou University Zhengzhou China

Image captioning is still a challenging task aiming at describing the contents of image by words. Current image caption methods usually assume the object relation to be important if the semantic and spatial geometric relationships between objects are close and large, but the relations meeting this assumption are not necessarily important to describe the contents of image in a fine-grained way. That is, the importance of fine-grained object relations is not properly taken into account. Besides, current Transformer based image caption models also fail to consider the importance of fine-grained objects, since they generate all the words of a sentence at one time, which cannot Figure out which objects are more important and vice versa. In this paper, we propose a novel Fine-grained Adaptive Object Transformer (FineFormer) network, which can jointly discover the importance of fine-grained objects and object relations for image captioning. Specifically, a new concept of adaptive soft-foreground attention is proposed to highlight the fine-grained objects dominating the descriptive contents. To characterize and calculate the important relations between fine-grained objects, we also propose an adaptive object relation attention to refine the object relation from the generation process of relation. As such, FineFormer can describe the contents of image more accurately, by reducing the interference of unimportant objects in the background. Extensive experiments on the highly-competitive MS-COCO dataset demonstrated the superiority of our FineFormer.

关键词： Adaptation models Adaptive systems Current transformers Semantics Interference data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

An Entity Relation Extraction Framework Based on Large Language Model and Multi-Tasks Iterative Prompt engineering

An Entity Relation Extraction Framework Based on Large Langu...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Haibin Geng Chenglong Shi Xuesong Jiang Zan Kong Song Liu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Document-level entity relation extraction is an important task in the field of natural language processing, which plays an important role in semantic understanding and knowledge graph construction. However, existing deep neural networks and graph neural networks models are limited by their performance and parameters number, which can not capture global semantics and have poor generalization ability. Furthermore, existing methods employing large language model for entity relation extraction do not establish good relationships among multi-tasks of entity relation extraction task, resulting in more information can not be effectively shared and transmitted between tasks. In addition, previous approaches can not effectively eliminate false entities and relationships. To solve these problems, we propose an entity relation extraction framework based on large language model and multi-tasks iterative prompt engineering. In our model, we design an iterative prompt engineering, which can better establish the relationship among multi-tasks, and ensure every task to obtain the optimal results. Moreover, we design semantic merging, group disambiguation and self-verification modules to eliminate the false entity relations and noise nodes. Additionally, we design summary prompts to provide sufficient global semantics for better text segmentation. Finally, we evaluated our model on wikiann, wikineural, ACE2005, CoNLL2003, CoNLL2004, and SciERC datasets and compared it with other baseline models.

关键词： Large language models Semantics Noise Merging knowledge graphs Multitasking Natural language processing Iterative methods Prompt engineering data mining

来源：评论

学校读者我要写书评

暂无评论

Order-preserving pattern mining with forgetting mechanism

arXiv

引用

arXiv 2024年

作者： Li, Yan Ma, Chenyu Gao, Rong Wu, Youxi Li, Jinyan Wang, Wenjian Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300400 China School of Artificial Intelligence Hebei University of Technology Tianjin300400 China School of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China School of Computer and Information Technology Shanxi University Taiyuan237016 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Order-preserving pattern (OPP) mining is a type of sequential pattern mining method in which a group of ranks of time series is used to represent an OPP. This approach can discover frequent trends in time series. Existing OPP mining algorithms consider data points at different time to be equally important;however, newer data usually have a more significant impact, while older data have a weaker impact. We therefore introduce the forgetting mechanism into OPP mining to reduce the importance of older data. This paper explores the mining of OPPs with forgetting mechanism (OPF) and proposes an algorithm called OPF-Miner that can discover frequent OPFs. OPF-Miner performs two tasks, candidate pattern generation and support calculation. In candidate pattern generation, OPF-Miner employs a maximal support priority strategy and a group pattern fusion strategy to avoid redundant pattern fusions. For support calculation, we propose an algorithm called support calculation with forgetting mechanism, which uses prefix and suffix pattern pruning strategies to avoid redundant support calculations. The experiments are conducted on nine datasets and 12 alternative algorithms. The results verify that OPF-Miner is superior to other competitive algorithms. More importantly, OPF-Miner yields good clustering performance for time series, since the forgetting mechanism is employed. Copyright © 2024, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

MedX-Net: Hierarchical Transformer with Large Kernel Convolutions for 3D Medical Image Segmentation

MedX-Net: Hierarchical Transformer with Large Kernel Convolu...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Lin Lu Qingzhi Zou Key Laboratory of Computing Power Network and Information Se-curity Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Due to the exceptional performance of Transform-ers in 2 $D$ medical image segmentation, recent work has also introduced them into 3D medical segmentation tasks. For instance, Swin UNETR and other hierarchical Transformers have reintroduced prior knowledge from several convolutional networks, further enhancing the volume segmentation capabilities of models. The efficacy of these hybrid methodologies is primarily attributed to the substantial quantity of parameters and the nonlocal self-attention mechanism with a large receptive field. We argue that the behavior of these methods' large receptive fields can be simulated by employing fewer parameters through the utilization of depth-wise convolutions with large kernel. Within this manuscript, we introduce a lightweight volume segmentation model called MedX-Net, which uses convolutional network modules to simulate hierarchical Transformers for robust volume segmentation. Firstly, inspired by the hierarchical Transformer module of Swin UNETR, we investigate large-kernel depth-wise convolutions with different sizes to achieve a reduced model parameter count while maintaining a large global receptive field. Secondly, we replace the multilayer perceptron (MLP) in the hierarchical Transformer module with Inverted Bottleneck with Depthwise Convolution Enhancement(DWCE) to improve model performance with fewer activation and normalization layers, further reducing the parameter count. We validate the effectiveness and efficiency of our model for volume segmentation on three public datasets: Synapse, BTCV and ACDC. On the Synapse dataset, compared to Swin UNETR, our model achieves an improvement from 83.48% to 87.21% in Dice score. Compared to the result of 86.57% achieved by nnFormer, our model achieves superior performance while reducing the model parameter count by 64%.

关键词： Image segmentation Solid modeling Visualization Three-dimensional displays Current transformers Multilayer perceptrons Convolutional neural networks Kernel Synapses Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：