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

arXiv 2024年

作者： Wang, Yuwen Liu, Shunyu Zheng, Tongya Chen, Kaixuan Song, Mingli Institute of Blockchain and Data Security Hangzhou China Institute of Blockchain and Data Security Hangzhou China Big Graph Center School of Computer and Computing Science Hangzhou City University College of Computer Science and Technology Zhejiang University Hangzhou China

Graph Neural Networks (GNNs) have emerged as a prominent framework for graph mining, leading to significant advances across various domains. Stemmed from the node-wise representations of GNNs, existing explanation studies have embraced the subgraph-specific viewpoint that attributes the decision results to the salient features and local structures of nodes. However, graph-level tasks necessitate long-range dependencies and global interactions for advanced GNNs, deviating significantly from subgraph-specific explanations. To bridge this gap, this paper proposes a novel intrinsically interpretable scheme for graph classification, termed as Global Interactive Pattern (GIP) learning, which introduces learnable global interactive patterns to explicitly interpret decisions. GIP first tackles the complexity of interpretation by clustering numerous nodes using a constrained graph clustering module. Then, it matches the coarsened global interactive instance with a batch of self-interpretable graph prototypes, thereby facilitating a transparent graph-level reasoning process. Extensive experiments conducted on both synthetic and real-world benchmarks demonstrate that the proposed GIP yields significantly superior interpretability and competitive performance to the state-of-the-art counterparts. Our code will be made publicly available1 Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

computer Engineering and Intelligent Control (ICCEIC) International Conference on

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

ISBN: (数字)9798331507992

ISBN: (纸本)9798331508005

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.

关键词： Image coding PSNR Convolution Computational modeling Refining Image restoration Computational efficiency Computational complexity Image reconstruction Image denoising

来源：评论

学校读者我要写书评

暂无评论

PathAsst: A Generative Foundation AI Assistant Towards Artificial General Intelligence of Pathology

arXiv

引用

arXiv 2023年

作者： Sun, Yuxuan Zhu, Chenglu Zheng, Sunyi Zhang, Kai Sun, Lin Shui, Zhongyi Zhang, Yunlong Li, Honglin Yang, Lin College of Computer Science and Technology Zhejiang University China Research Center for Industries of the Future School of Engineering Westlake University China Department of Computer Science and Engineering The Ohio State University United States School of Computer and Computing Science Hangzhou City University China

As advances in large language models (LLMs) and multimodal techniques continue to mature, the development of general-purpose multimodal large language models (MLLMs) has surged, offering significant applications in interpreting natural images. However, the field of pathology has largely remained untapped, particularly in gathering high-quality data and designing comprehensive model frameworks. To bridge the gap in pathology MLLMs, we present PathAsst, a multimodal generative foundation AI assistant to revolutionize diagnostic and predictive analytics in pathology. The development of PathAsst involves three pivotal steps: data acquisition, CLIP model adaptation, and the training of PathAsst’s multimodal generative capabilities. Firstly, we collect over 207K high-quality pathology image-text pairs from authoritative sources. Leveraging the advanced power of ChatGPT, we generate over 180K instruction-following samples. Furthermore, we devise additional instruction-following data specifically tailored for invoking eight pathology-specific sub-models we prepared, allowing the PathAsst to effectively collaborate with these models, enhancing its diagnostic ability. Secondly, by leveraging the collected data, we construct PathCLIP, a pathology-dedicated CLIP, to enhance PathAsst’s capabilities in interpreting pathology images. Finally, we integrate PathCLIP with the Vicuna-13b and utilize pathology-specific instruction-tuning data to enhance the multimodal generation capacity of PathAsst and bolster its synergistic interactions with sub-models. The experimental results of PathAsst show the potential of harnessing AI-powered generative foundation model to improve pathology diagnosis and treatment processes. We open-source our dataset, as well as a comprehensive toolkit for extensive pathology data collection and preprocessing at https://***/superjamessyx/Generative-Foundation-AI-Assistant-for-Pathology. Copyright © 2023, The Authors. All rights reserved.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph Enhanced Large Language Model Editing

arXiv

引用

arXiv 2024年

作者： Zhang, Mengqi Ye, Xiaotian Liu, Qiang Ren, Pengjie Wu, Shu Chen, Zhumin School of Computer Science and Technology Shandong University China School of Computer Science Beijing University of Posts and Telecommunications China Center for Research on Intelligent Perception and Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China

Large language models (LLMs) are pivotal in advancing natural language processing (NLP) tasks, yet their efficacy is hampered by inaccuracies and outdated knowledge. Model editing emerges as a promising solution to address these challenges. However, existing editing methods struggle to track and incorporate changes in knowledge associated with edits, which limits the generalization ability of post-edit LLMs in processing edited knowledge. To tackle these problems, we propose a novel model editing method that leverages knowledge graphs for enhancing LLM editing, namely GLAME. Specifically, we first utilize a knowledge graph augmentation module to uncover associated knowledge that has changed due to editing, obtaining its internal representations within LLMs. This approach allows knowledge alterations within LLMs to be reflected through an external graph structure. Subsequently, we design a graph-based knowledge edit module to integrate structured knowledge into the model editing. This ensures that the updated parameters reflect not only the modifications of the edited knowledge but also the changes in other associated knowledge resulting from the editing process. Comprehensive experiments conducted on GPT-J and GPT-2 XL demonstrate that GLAME significantly improves the generalization capabilities of post-edit LLMs in employing edited knowledge. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Question Answering via Answer Diversifying 29

Unsupervised Question Answering via Answer Diversifying

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Nie, Yuxiang Huang, Heyan Chi, Zewen Mao, Xian-Ling School of Computer Science and Technology Beijing Institute of Technology Beijing China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing China Beijing Institute of Technology Southeast Academy of Information Technology Fujian China

Unsupervised question answering is an attractive task due to its independence on labeled data. Previous works usually make use of heuristic rules as well as pre-trained models to construct data and train QA models. However, most of these works regard named entity (NE) as the only answer type, which ignores the high diversity of answers in the real world. To tackle this problem, we propose a novel unsupervised method by diversifying answers, named DiverseQA. Specifically, the proposed method is composed of three modules: data construction, data augmentation and denoising filter. Firstly, the data construction module extends the extracted named entity into a longer sentence constituent as the new answer span to construct a QA dataset with diverse answers. Secondly, the data augmentation module adopts an answer-type dependent data augmentation process via adversarial training in the embedding level. Thirdly, the denoising filter module is designed to alleviate the noise in the constructed data. Extensive experiments show that the proposed method outperforms previous unsupervised models on five benchmark datasets, including SQuADv1.1, NewsQA, TriviaQA, BioASQ, and DuoRC. Besides, the proposed method shows strong performance in the few-shot learning setting. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers

Robin: A Novel Method to Produce Robust Interpreters for Dee...

引用

IEEE International Conference on Automated Software Engineering (ASE)

作者： Zhen Li Ruqian Zhang Deqing Zou Ning Wang Yating Li Shouhuai Xu Chen Chen Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Hubei Engineering Research Center on Big Data Security Department of Computer Science University of Colorado Colorado Springs USA Center for Research in Computer Vision University of Central Florida USA School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier; the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

VDN: Variant-depth network for motion deblurring

VDN: Variant-depth network for motion deblurring

引用

作者： Guo, Cai Wang, Qian Dai, Hong-Ning Li, Ping School of Computer Science and Engineering Macau University of Science and Technology Taipa China Network and Educational Technology Center Hanshan Normal University Chaozhou China Department of Computing The Hong Kong Polytechnic University Kowloon Hong Kong Department of Computing and Decision Sciences Lingnan University Tuen Mun Hong Kong School of Design The Hong Kong Polytechnic University Kowloon Hong Kong

Motion deblurring is a challenging task in vision and graphics. Recent researches aim to deblur by using multiple sub-networks with multi-scale or multi-patch inputs. However, scaling or splitting operations on input images inevitably loses the spatial details of the images. Meanwhile, their models are usually complex and computationally expensive. To address these problems, we propose a novel variant-depth scheme. In particular, we utilize the multiple variant-depth sub-networks with scale-invariant inputs to combine into a variant-depth network (VDN). In our design, different levels of sub-networks accomplish progressive deblurring effects without transforming the inputs, thereby effectively reducing the computational complexity of the model. Extensive experiments have shown that our VDN outperforms the state-of-the-art motion deblurring methods while maintaining a lower computational cost. The source code is publicly available at: https://***/CaiGuoHS/VDN. © 2022 John Wiley & Sons, Ltd.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Time-Aware Missing Traffic Flow Prediction for Sensors with Privacy-Preservation 11th

Time-Aware Missing Traffic Flow Prediction for Sensors with ...

引用

11th International Conference on computer Engineering and Networks, CENet2021

作者： Qi, Lianyong Wang, Fan Xu, Xiaolong Dou, Wanchun Zhang, Xuyun Khosravi, Mohammad R. Zhou, Xiaokang School of Computer Science Qufu Normal University Qufu China School of Computer and Software Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Nanjing University of Information Science and Technology Nanjing China State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China Department of Computing Macquarie University SydneyNSW2109 Australia Department of Computer Engineering Persian Gulf University Bushehr Iran Department of Electrical and Electronic Engineering Shiraz University of Technology Shiraz Iran Faculty of Data Science Shiga University Hikone Japan

ISBN: (纸本)9789811665530

With the continuous development of IoT, a number of sensors establish on the roadside to monitor traffic conditions in real time. The continuously traffic data generated by these sensors makes traffic management feasible. However, loss of data may occur due to inevitable sensor failure, impeding traffic managers to understand traffic dynamics clearly. In this situation, it is becoming a necessity to predict missing traffic flow accurately for effective traffic management. Furthermore, the traffic sensor data are often distributed and stored by different agencies, which inhibits the multi-party sensor data sharing significantly due to privacy concerns. Therefore, it has become a major obstacle to balance the tradeoff between data sharing and vehicle privacy. In light of these challenges, we propose a privacy-aware and accurate missing traffic flow prediction approach based on time-aware Locality-Sensitive Hashing technique. At last, we deploy a set of experiments based on a real traffic dataset. Experimental reports demonstrate the feasibility of our proposal in terms of traffic flow prediction accuracy and efficiency while guaranteeing sensor data privacy. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Active Visual SLAM Based on Hierarchical Reinforcement Learning

Active Visual SLAM Based on Hierarchical Reinforcement Learn...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Wensong Chen Wei Li Andong Yang Yu Hu Research Center for Intelligent Computing Systems Chinese Academy of Sciencns Institute of Computing Technology Beijinz China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

We present AVS-HRL, a modular Active visual SLAM system based on hierarchical reinforcement learning. The reward function explicitly considers the efficiency of exploration and the accuracy of mapping by utilizing the internal variables of SLAM, such as feature points distribution and loop-closure signal. Compared to end-to-end active SLAM methods, we designed a map reconstruction module that can correct the cumulative error in the incremental mapping process. Furthermore, the inputs of all neural network modules use more abstract and general information, such as grid maps, rather than raw sensor observations. We conducted experiments in two different simulators and real-world environments. In the noisy setting of Habitat environments, our method improves the accuracy of the mapped areas by 68.48% as an average of Gibson and MP3D datasets. Moreover, our method's generalization performance was demonstrated through direct transfer across different simulators and real-world environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint Extraction of Biomedical Entities and Relations based on Decomposition and Recombination Strategy

Joint Extraction of Biomedical Entities and Relations based ...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Zhu, Qiang Hong, Cheng Wang, Bangchao Hu, Xinrong Yang, Jie Liu, Junping Engineering Research Center of Hubei Province for Clothing Information Hubei Provincial Engineering Research Center for Intelligent Textile and Fashion China School of Computer Science and Artificial Intelligence Wuhan Textile University China School of Computing and Information Technology University of Wollongong Australia

ISBN: (纸本)9781665468190

Entities and relations extraction is one of the key task to build medical knowledge graph, which is of great significance to the development of medical artificial intelligence. However, overlapping triples are great challenge for biomedical entities and relations extraction. In order to improve the performance of biomedical entities and relations extraction, we propose a joint extraction of entities and relations method based on decomposition and recombination strategy to mine biomedical text. Our method decomposes entities and relations extraction task into three related sub-modules, which are entity tagging module, relation classification module and recombination matching module. Our main contributions are as follows: first, we introduce a decomposition and recombination end-to-end learning framework for joint entities and relations extraction. Second, we propose a bi-directional prediction method to deal with the overlapping triples problem. Finally, we propose the negative samples generation method to alleviate the error accumulation among these modules. The extensive experiments demonstrate that our method can improve the F1 score by 4.36%, 2.13% and 11.72% in ADE, DDI and BB biomedical corpus. © 2022 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：