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

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

作者： Guo, Shasha Zhang, Jing Wang, Yanling Zhang, Qianyi 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

Existing methods on knowledge base question generation (KBQG) learn a one-size-fits-all model by training together all subgraphs without distinguishing the diverse semantics of subgraphs. In this work, we show that making use of the past experience on semantically similar subgraphs can reduce the learning difficulty and promote the performance of KBQG models. To achieve this, we propose a novel approach to model diverse subgraphs with meta-learner (DSM). Specifically, we devise a graph contrastive learning-based retriever to identify semantically similar subgraphs, so that we can construct the semantics-aware learning tasks for the meta-learner to learn semantics-specific and semantics-agnostic knowledge on and across these tasks. Extensive experiments on two widely-adopted benchmarks for KBQG show that DSM derives new state-of-the-art performance and benefits the question answering tasks as a means of data augmentation. Codes and datasets are available online. © 2022 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Image Denoising Method Based on Channel Compression and Split-Attention Mechanism 5

Image Denoising Method Based on Channel Compression and Spli...

引用

5th International Conference on computer engineering and Intelligent Control, ICCEIC 2024

作者： Sun, Hao Qiao, Xiaoyan School of Computer Science and Technology Shandong Technology and Business University Technology and Evaluation Shandong Engineering Research Center Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Shandong Yantai China

ISBN: (纸本)9798331507992

In the image restoration task, how to make full use of spatial and channel feature information to improve the reconstruction quality of the model without significantly increasing the computational complexity is an important research issue. To address this challenge, this paper proposes a CS module (Channel Compression and Split-Attention) specifically for optimizing image denoising tasks. The module first compresses the features through a preliminary convolution operation, then introduces the split attention convolution mechanism to split the features by channel and dynamically weight them, thereby enhancing the model's adaptive attention to different feature channels and improving feature expression capabilities. Through experiments on multiple image denoising datasets, the results show that the CS module significantly improves the image reconstruction quality, especially in terms of peak signal-to-noise ratio (PSNR). At the same time, the introduction of the CS module does not lead to a significant increase in computational complexity, maintaining a high computational efficiency, which verifies the practicality and superiority of the module in image denoising tasks. © 2024 IEEE.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Multi-Trip Routing for Municipal Solid Waste Collection by Contribution-Based Adaptive Particle Swarm Optimization

引用

Complex System Modeling and Simulation 2023年第3期3卷 202-219页

作者： Xiaoning Shen Hongli Pan Zhongpei Ge Wenyan Chen Liyan Song Shuo Wang Collaborative Innovation Center of Atmospheric Environment and Equipment Technology and also with the Jiangsu Key Laboratory of Big Data Analysis TechnologySchool of AutomationNanjing University of Information Science and TechnologyNanjing 210044China School of Automation Nanjing University of Information Science and TechnologyNanjing 210044China Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation the Department of Computer Science and EngineeringSouthern University of Science and TechnologyShenzhen 518055China School of Computer Science University of BirminghamBirminghamB152TTUK

Waste collection is an important part of waste management *** costs and carbon emissions can be greatly reduced by proper vehicle ***,each vehicle can work again after achieving its capacity limit and unloading the *** this,an energy-efficient multi-trip vehicle routing model is established for municipal solid waste collection,which incorporates practical factors like the limited capacity,maximum working hours,and multiple trips of each *** both economy and environment,fixed costs,fuel costs,and carbon emission costs are minimized *** solve the formulated model effectively,contribution-based adaptive particle swarm optimization is *** strategies named greedy learning,multi-operator learning,exploring learning,and exploiting learning are specifically designed with their own searching *** assessing the contribution of each learning strategy during the process of evolution,an appropriate one is selected and assigned to each individual adaptively to improve the searching efficiency of the ***,an improved local search operator is performed on the trips with the largest number of waste sites so that both the exploiting ability and the convergence accuracy of the algorithm are *** of the proposed algorithm is tested on ten waste collection instances,which include one real-world case derived from the Green Ring Company of Jiangbei New District,Nanjing,China,and nine synthetic instances with increasing scales generated from the commonly-used capacitated vehicle routing problem benchmark *** with five state-of-the-art algorithms show that the proposed algorithm can obtain a solution with a higher accuracy for the constructed model.

关键词： municipal solid waste collection energy conservation multi-trip contribution particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-scale fusion clustering algorithm for urban travel features 3

Multi-scale fusion clustering algorithm for urban travel fea...

引用

2023 3rd International Conference on Intelligent Traffic Systems and Smart City, ITSSC 2023

作者： Zhang, Zixiang Zhao, Zhilong Deng, Jiaming Zhao, Yingying Xu, Tao Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China Key Laboratory of Geographical Information Science Ministry of Education East China Normal University Shanghai200241 China School of Computer and Information Engineering Henan University Kaifeng475004 China International Education College Henan University Zhengzhou450046 China Henan Technology Innovation Center of Spatio-Temporal Big Data Henan University Zhengzhou450046 China Henan Industrial Technology Academy of Spatio-Temporal Big Data Henan University Zhengzhou450046 China

ISBN: (纸本)9781510672963

Urban travel data typically encompass various temporal and spatial scales and features. Nonetheless, existing traffic travel feature analysis often focuses on a single spatial scale, which may overlook crucial information and hinder features at different scales. Consequently, this could reduce the accuracy of travel pattern recognition. To solve this problem, we introduce a multi-scale fusion transformation algorithm. In our approach, we first establish a multi-level taxi travel data grid system. Then, we apply the I-Clique clustering algorithm to perform grid clustering at each level of the system to identify taxi travel feature regions of different scales. Subsequently, a multi-scale fusion pyramid model is constructed utilizing the acquired travel feature regions at various scales. Finally, we determine the transformation relationships between scales in the pyramid model, enabling the identification of travel feature areas across both known and unknown scales. This approach facilitates the recognition of travel features within cities at any scale. Experimental results demonstrate that the multi-scale fusion transformation algorithm enhances our understanding of spatial aggregation patterns and the hierarchical structure of geographical entities, offering a novel approach for multi-scale urban traffic analysis. © 2024 SPIE. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Based Framework for Privacy-Preserving Machine Learning 24th

An Encoder-Based Framework for Privacy-Preserving Machine L...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wu, Jiayun Ren, Wei Zhang, Xianchao Zheng, Xianghan School of Computer Science China University of Geosciences Wuhan430074 China State Key Laboratory of Geo-Information Engineering and Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology of MNR CASM Beijing China Ministry of Education Chengdu China Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province Jiaxing University Jiaxing China Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing University Jiaxing China College of Computer and Big Data Fuzhou University Fujian Fuzhou China School of Information and Intelligent Engineering Sanya College Hainan China

ISBN: (纸本)9789819615506

As a data-driven science, machine learning requires vast amounts of training data and computational resources. However, for highly privacy-sensitive data, it is crucial to protect the privacy of the data during both the training and utilization of machine learning models. In this paper, we propose a privacy-preserving machine learning approach using autoencoders and differential privacy mechanisms to safeguard data privacy while minimizing the impact on data availability. Specifically, we augment logistic regression and ResNet18 models with different architectures of autoencoders to perform data encryption? without compromising the machine learning tasks. Additionally, we employ differential privacy mechanisms to introduce gradient perturbations in the encoding part of the autoencoder, enhancing the algorithm’s security and further protecting data privacy. We also design the cosine similarity between the encoded and original data as a metric for evaluating data privacy, considering model performance, privacy budget, and data privacy collectively to balance data availability and privacy. Extensive experiments conducted on MNIST, CIFAR-10, PathMNIST, and BloodMNIST datasets demonstrate that for simple logistic regression models handling easily classifiable datasets, employing simple autoencoder structures can enhance classification accuracy, with significant performance impact after adding differential privacy. For ResNet18, utilizing convolutional autoencoders for data encryption generally has minimal impact on model classification performance and can even improve accuracy in most cases. Adding differential privacy has minor effects on model classification performance. Selecting appropriate model structures and privacy budgets for different usage scenarios can ensure both data availability and privacy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

A Framework for Multiclass Contour Visualization

引用

IEEE Transactions on Visualization and computer Graphics 2023年第1期29卷 353-362页

作者： Li, Sihang Yu, Jiacheng Li, Mingxuan Liu, Le Zhang, Xiaolong Luke Yuan, Xiaoru Laboratory of Machine Perception Ministry of Education School of AI Peking University China Center for Data Science Academy for Advanced Interdisciplinary Studies Peking University China National Engineering Laboratory for Big Data Analysis and Application Peking University China School of Computer Science Northwestern Polytechnical University China College of Information Sciences and Technology Pennsylvania State University United States

Multiclass contour visualization is often used to interpret complex data attributes in such fields as weather forecasting, computational fluid dynamics, and artificial intelligence. However, effective and accurate representations of underlying data patterns and correlations can be challenging in multiclass contour visualization, primarily due to the inevitable visual cluttering and occlusions when the number of classes is significant. To address this issue, visualization design must carefully choose design parameters to make visualization more comprehensible. With this goal in mind, we proposed a framework for multiclass contour visualization. The framework has two components: a set of four visualization design parameters, which are developed based on an extensive review of literature on contour visualization, and a declarative domain-specific language (DSL) for creating multiclass contour rendering, which enables a fast exploration of those design parameters. A task-oriented user study was conducted to assess how those design parameters affect users' interpretations of real-world data. The study results offered some suggestions on the value choices of design parameters in multiclass contour visualization. © 2022 IEEE.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

Research on an intelligent encryption method for remote sensing images with variable dimension employing dual-chaotic system

引用

Optoelectronics Letters 2024年

作者： YU Jia-hui MAN Zhen-long ZHANG Fan MENG Xiang-fu School of Electronic and Information Engineering， Liaoning Technical University Liaoning Key Laboratory of Radio Frequency and Big Data for Intelligent Applications

The rapid advancement of remote sensing technology has heightened concerns over the security of sensitive information. This paper presents an intelligent encryption scheme for remote sensing images using dimensionality variation. The scheme employs two high-dimensional chaotic systems to generate keys for simultaneous row-column scrambling and diffusion. By mapping a 2D plain-image to a 3D space， pixels are rearranged within a 3D cube using a chaotic key， followed by auto-correlation cyclic diffusion. Experimental results demonstrate that this approach significantly enhances encryption security， making it suitable for secure remote sensing image communication.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic community detection algorithm based on hyperbolic graph convolution

引用

International Journal of Intelligent Computing and Cybernetics 2024年第3期17卷 632-653页

作者： Weijiang Wu Heping Tan Yifeng Zheng College of Information Science and Engineering/College of Artificial Intelligence China University of Petroleum BeijingBeijingChina Beijing Key Laboratory of Petroleum Data Mining China University of Petroleum BeijingBeijingChina School of Computer Science Minnan Normal UniversityZhangzhouChina

Purpose:Community detection is a key factor in analyzing the structural features of complex ***,traditional dynamic community detection methods often fail to effectively solve the problems of deep network information loss and computational complexity in hyperbolic *** address this challenge,a hyperbolic space-based dynamic graph neural network community detection model(HSDCDM)is ***/methodology/approach:HSDCDM first projects the node features into the hyperbolic space and then utilizes the hyperbolic graph convolution module on the Poincare and Lorentz models to realize feature fusion and information *** addition,the parallel optimized temporal memory module ensures fast and accurate capture of time domain information over extended ***,the community clustering module divides the community structure by combining the node characteristics of the space domain and the time *** evaluate the performance of HSDCDM,experiments are conducted on both artificial and real ***:Experimental results on complex networks demonstrate that HSDCDM significantly enhances the quality of community detection in hierarchical *** shows an average improvement of 7.29%in NMI and a 9.07%increase in ARI across datasets compared to traditional *** complex networks with nonEuclidean geometric structures,the HSDCDM model incorporating hyperbolic geometry can better handle the discontinuity of the metric space,provides a more compact embedding that preserves the data structure,and offers advantages over methods based on Euclidean geometry ***/value:This model aggregates the potential information of nodes in space through manifoldpreserving distribution mapping and hyperbolic graph topology ***,it optimizes the Simple Recurrent Unit(SRU)on the hyperbolic space Lorentz model to effectively extract time series data in hyperbolic space,thereby enhancing computing efficiency by eliminating t

关键词： Complex networks Dynamic community detection Hyperbolic graph neural network

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

10th IEEE Smart World Congress, SWC 2024

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

ISBN: (纸本)9798331520861

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. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：