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

arXiv 2021年

作者： Lin, Ailiang Chen, Bingzhi Xu, Jiayu Zhang, Zheng Lu, Guangming Shenzhen Medical Biometrics Perception and Analysis Engineering Laboratory Harbin Institute of Technology Shenzhen518055 China Bio-Computing Research Center Harbin Institute of Technology Shenzhen518055 China Shenzhen Key Laboratory of Visual Object Detection and Recognition Shenzhen518055 China

Automatic medical image segmentation has made great progress benefit from the development of deep learning. However, most existing methods are based on convolutional neural networks (CNNs), which fail to build long-range dependencies and global context connections due to the limitation of receptive field in convolution operation. Inspired by the success of Transformer whose self-attention mechanism has the powerful abilities of modeling the long-range contextual information, some researchers have expended considerable efforts in designing the robust variants of Transformer-based U-Net. Moreover, the patch division used in vision transformers usually ignores the pixel-level intrinsic structural features inside each patch. To alleviate these problems, in this paper, we propose a novel deep medical image segmentation framework called Dual Swin Transformer U-Net (DS-TransUNet), which might be the first attempt to concurrently incorporate the advantages of hierarchical Swin Transformer into both encoder and decoder of the standard U-shaped architecture to enhance the semantic segmentation quality of varying medical images. Unlike many prior Transformer-based solutions, the proposed DS-TransUNet first adopts dual-scale encoder subnetworks based on Swin Transformer to extract the coarse and fine-grained feature representations of different semantic scales. As the core component for our DS-TransUNet, a well-designed Transformer Interactive Fusion (TIF) module is proposed to effectively establish global dependencies between features of different scales through the self-attention mechanism, in order to make full use of these obtained multi-scale feature representations. Furthermore, we also introduce the Swin Transformer block into decoder to further explore the long-range contextual information during the up-sampling process. Extensive experiments across four typical tasks for medical image segmentation demonstrate the effectiveness of DS-TransUNet, and show that our approac

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A Two-phase Prototypical Network Model for Incremental Few-shot Relation Classification 28

A Two-phase Prototypical Network Model for Incremental Few-s...

引用

28th International Conference on Computational Linguistics, COLING 2020

作者： Ren, Haopeng Cai, Yi Chen, Xiaofeng Wang, Guohua Li, Qing School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China Department of Computing The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781952148279

Relation Classification (RC) plays an important role in natural language processing (NLP). Current conventional supervised and distantly supervised RC models always make a closed-world assumption which ignores the emergence of novel relations in an open environment. To incrementally recognize the novel relations, current two solutions (i.e, re-training and lifelong learning) are designed but suffer from the lack of large-scale labeled data for novel relations. Meanwhile, prototypical network enjoys better performance on both fields of deep supervised learning and few-shot learning. However, it still suffers from the incompatible feature embedding problem when the novel relations come in. Motivated by them, we propose a two-phase prototypical network with prototype attention alignment and triplet loss to dynamically recognize the novel relations with a few support instances meanwhile without catastrophic forgetting. Extensive experiments are conducted to evaluate the effectiveness of our proposed model. © 2020 COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Weakly Supervised Patch Label Inference Networks for Efficient Pavement Distress Detection and Recognition in the Wild

arXiv

引用

arXiv 2022年

作者： Huang, Sheng Tang, Wenhao Huang, Guixin Huangfu, Luwen Yang, Dan Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing400044 China The School of Big Data and Software Engineering Chongqing University Chonqqing 400044 China Fowler College of Business Center for Human Dynamics in the Mobile Age San Diego State University San DiegoCA92182 United States

Automatic image-based pavement distress detection and recognition are vital for pavement maintenance and management. However, existing deep learning-based methods largely omit the specific characteristics of pavement images, such as high image resolution and low distress area ratio, and are not end-to-end trainable. In this paper, we present a series of simple yet effective end-to-end deep learning approaches named Weakly Supervised Patch Label Inference Networks (WSPLIN) for efficiently addressing these tasks under various application settings. WSPLIN transforms the fully supervised pavement image classification problem into a weakly supervised pavement patch classification problem for solutions. Specifically, WSPLIN first divides the pavement image under different scales into patches with different collection strategies and then employs a Patch Label Inference Network (PLIN) to infer the labels of these patches to fully exploit the resolution and scale information. Notably, we design a patch label sparsity constraint based on the prior knowledge of distress distribution and leverage the Comprehensive Decision Network (CDN) to guide the training of PLIN in a weakly supervised way. Therefore, the patch labels produced by PLIN provide interpretable intermediate information, such as the rough location and the type of distress. We evaluate our method on a large-scale bituminous pavement distress dataset named CQU-BPDD and the augmented Crack500 (Crack500-PDD) dataset, which is a newly constructed pavement distress detection dataset augmented from the Crack500. Extensive results demonstrate the superiority of our method over baselines in both performance and efficiency. The source codes of WSPLIN are released on https://***/DearCaat/wsplin. © 2022, CC BY-NC-SA.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

A Three-party Repeated Game Model for data Privacy in Mobile Edge Crowdsensing of IoT 13

A Three-party Repeated Game Model for Data Privacy in Mobile...

引用

13th EAI International Conference on Mobile Multimedia Communications, Mobimedia 2020

作者： Zhao, Mingfeng Chen, Lei Xiong, Jinbo Tian, Youliang Fujian Provincial Key Laboratory of Network Security and Cryptology College of Mathematics and Informatics Fujian Normal University Fuzhou350117 China College of Engineering and Computing Georgia Southern University GA30458 United States State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9781631902710

The low request response delay of mobile edge crowdsensing (MECS) paradigm allows quick interactions among entities in practical scenarios. However, there often exist dishonest behaviors in such interactions, and the personal information leakage involved seriously threatens the privacy and security of sensing users. To tackle this problem, previously we had proposed a non-repeated three-party game model, without the consideration of multiple interactions in the actual scenario. Based on game theory, this research therefore proposes a three-party repeated game model. Specifically, we propose the corresponding social norms for different phases of sensing data. It analyzes all possible behaviors deviating from rationality, calculates the change of corresponding payoff function, and explores the influencing factors and constraints of players' honest behaviors based on the premise of maximizing interests. Finally, a significant number of simulations and numerical analyse indicate that the proposed model is feasible and effective in maximizing the benefits of game participants. Copyright © 2020 EAI.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Parallel generated method of transcriptional regulatory networks

Parallel generated method of transcriptional regulatory netw...

引用

作者： Liu, Shuai Ta, Na Lu, Mengye Liu, Gaocheng Bai, Weiling Li, Wenhui College of Computer Science Inner Mongolia University Hohhot010012 China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot010012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Generated method of transcriptional regulatory networks remains an important research in biology. Many approaches have been proposed to construct transcriptional regulatory networks. However, with the increase of ChIP-seq and RNA-seq data, the speed of constructing transcriptional regulation networks is still a challenge. Moreover, parallel computing lacks application in constructing gene regulatory networks through the analysis of the relationships between transcription factors (TFs) and target genes (TGs). Therefore, in this paper, a parallel generated method of transcriptional regulatory networks was proposed. First, two datasets, Michigan Cancer Foundation – 7 (MCF-7) and Cardiomyocytes (CM) were applied. Then, a parallel method was used to generate transcriptional regulatory network with their transcription factors (TFs) and target genes (TGs). Finally, experimental results showed that 61% regulatory relations in MCF-7 were validated in the Gene Expression Omnibus (GEO), while 29% results needed further experimental verification. Besides, 56% regulatory relations in CM were consistent with GEO, while 33% results were not yet verified. Furthermore, speed of parallel algorithm was faster than traditional serial algorithm in generating transcriptional regulatory networks. © 2018 John Wiley & Sons, Ltd.

关键词： Transcription factors

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Resource Scheduling Method with Edge Channel Deployment for BPM

An Intelligent Resource Scheduling Method with Edge Channel ...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted computing, UIC-ATC

作者： Bowen Liu Wanchun Dou Xiaokang Zhou Xuyun Zhang Lianyong Qi Fei Dai Chaochao Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Faculty of Data Science Shiga University Hikone Japan Department of Computing Macquarie University Sydney Australia College of Computer and Software China University of Petroleum (East China) Qingdao China College of Big Data and Intelligent Engineering Southwest Forestry University Kunming China College of Computer Science and Technology Zhejiang University Hangzhou China

Edge computing is a novel computing paradigm that offers kinds of resources at the network edge. In edge computing, terminal users are connected to edge servers via the wireless network and there are various channels in each wireless link. These wireless channels are limited resource while different channel has different cost and service ability. The dynamic changes of users’ status make it harder to find an appropriate method to satisfy the BPM requirements of channel deployment. With this observation, it is a tricky challenge to make a trade-off between the system cost(rental price) and the service ability(number of users). In view of this challenge, an intelligent resource scheduling method, named EdgeIRS, is proposed in this paper. In the technical sense, the EdgeIRS method can accommodate most users at the edge with a minimum cost of deploying channel resources in an online way. Its performance is analyzed theoretically and the experiments verify the superiority of the method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Star/Galaxy Classification Based on Stacking Ensemble Learning

引用

Chinese Astronomy and Astrophysics 2020年第3期44卷 345-355页

作者： Chao, L.I. Wen-hui, ZHANG Ran, L.I. Jun-yi, W.A.N.G. Ji-ming, L.I.N. College of Information and Communication Engineering Guilin University of Electronic Technology Guilin 541004 Key Laboratory of Education Ministry for Cognitive Radio and Information Processing Guilin University of Electronic Technology Guilin 541004 Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin 541004 Guangxi College and University Key Laboratory for Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin 541004 Guangxi Key Laboratory for Wireless Wideband Communication and Signal Processing Guilin University of Electronic Technology Guilin 541004 Guangxi College and University Key Laboratory for Satellite Navigation and Position Sensing Guilin 541004

Machine learning has achieved great success in many areas today, but the forecast effect of machine learning often depends on the specific problem. An ensemble learning forecasts results by combining multiple base classifiers. Therefore, its ability to adapt to various scenarios is strong, and the classification accuracy is high. In response to the low classification accuracy of the darkest source magnitude set of stars/galaxies in the Sloan Digital Sky Survey (SDSS), a star/galaxy classification algorithm based on the stacking ensemble learning is proposed in this paper. The complete photometric data set is obtained from the SDSS data Release (DR) 7, and divided into the bright source magnitude set, dark source magnitude set, and darkest source magnitude set according to the stellar magnitude. Firstly, the 10-fold nested cross-validation method is used for the darkest source magnitude set, then the Support Vector Machine (SVM), Random Forest (RF), and eXtreme Gradient Boosting (XGBoost) algorithms are used to establish the base-classifier model;the Gradient Boosting Decision Tree (GBDT) is used as the meta-classifier model. Finally, based on the classification accuracy of galaxies and other indicators, the classification results are analyzed and compared with the results obtained by the Function Tree (FT), SVM, RF, GBDT, Stacked Denoising Autoencoders (SDAE), Deep Belief Nets (DBN), and Deep Perception Decision Tree (DPDT) models. The experimental results show that the stacking ensemble learning model has improved the classification accuracy of galaxies in the darkest source magnitude set by nearly 10% compared to the function tree algorithm. Compared with other traditional machine learning algorithm, stronger lifting algorithm, and deep learning algorithm, the stacking ensemble learning model also has different degrees of improvement. © 2020

关键词： Galaxies: fundamental parameters methods: data analysis Stars: fundamental parameters techniques: photometric

来源：评论

学校读者我要写书评

暂无评论

Unified graph augmentations for generalized contrastive learning on graphs 24

Unified graph augmentations for generalized contrastive lear...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Jiaming Zhuo Yintong Lu Hui Ning Kun Fu Bingxin Niu Dongxiao He Chuan Wang Yuanfang Guo Zhen Wang Xiaochun Cao Liang Yang Hebei Province Key Laboratory of Big Data Calculation School of Artificial Intelligence Hebei University of Technology Tianjin China College of Intelligence and Computing Tianjin University Tianjin China School of Computer Science and Technology Beijing JiaoTong University Beijing China School of Computer Science and Engineering Beihang University Beijing China School of Artificial Intelligence OPtics and ElectroNics (iOPEN) School of Cybersecurity Northwestern Polytechnical University Xi'an China School of Cyber Science and Technology Shenzhen Campus of Sun Yat-sen University Shenzhen China

ISBN: (纸本)9798331314385

In real-world scenarios, networks (graphs) and their tasks possess unique characteristics, requiring the development of a versatile graph augmentation (GA) to meet the varied demands of network analysis. Unfortunately, most Graph Contrastive Learning (GCL) frameworks are hampered by the specificity, complexity, and incompleteness of their GA techniques. Firstly, GAs designed for specific scenarios may compromise the universality of models if mishandled. Secondly, the process of identifying and generating optimal augmentations generally involves substantial computational overhead. Thirdly, the effectiveness of the GCL, even the learnable ones, is constrained by the finite selection of GAs available. To overcome the above limitations, this paper introduces a novel unified GA module dubbed UGA after reinterpreting the mechanism of GAs in GCLs from a message-passing perspective. Theoretically, this module is capable of unifying any explicit GAs, including node, edge, attribute, and subgraph augmentations. Based on the proposed UGA, a novel generalized GCL framework dubbed Graph cOntrastive UnifieD Augmentations (GOUDA) is proposed. It seamlessly integrates widely adopted contrastive losses and an introduced independence loss to fulfill the common requirements of consistency and diversity of augmentation across diverse scenarios. Evaluations across various datasets and tasks demonstrate the generality and efficiency of the proposed GOUDA over existing state-of-the-art GCLs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

scMGCAE: A Masked Graph Cluster Autoencoder for Single-Cell RNA-Seq Clustering 2nd

scMGCAE: A Masked Graph Cluster Autoencoder for Single-Cell ...

引用

2nd International Conference on Applied Intelligence, ICAI 2024

作者： Wu, Zheyu Wang, Yueyue Zhang, Qinhu Ningbo Institute of Digital Twin Eastern Institute of Technology No. 568 Tongxin Road Zhuangshi Street Zhejiang Ningbo315201 China Big Data and Intelligent Computing Research Center Guangxi Academy of Science Nanning530007 China Institute for Regenerative Medicine Medical Innovation Center and State Key Laboratory of Cardiology School of Medicine Shanghai East Hospital Tongji University Shanghai200123 China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Minhang District Shanghai200240 China

ISBN: (纸本)9789819619061

Single-cell RNA sequencing provides high-throughput gene expression information and offers higher resolution of cell differences compared to bulk RNA sequencing, which helps identify cell types and explore cellular heterogeneity at the single-cell level. Although many single-cell clustering methods based on masked autoencoders have been developed recently, they rarely effectively utilize the correlations between cells, resulting in suboptimal clustering results. In this work, we propose a novel clustering method for scRNA-seq data based on a masked graph convolutional autoencoder, which incorporates a graph convolutional network onto the basis of a masked autoencoder to enhance the capture of the correlation between cells and genes by fusing the cell-cell interaction graph and the gene expression matrix. By increasing the relationships between cells, dimensionality reduction is guided, and a clustering-friendly representation is obtained. We conducted extensive comparative experiments using various clustering evaluation metrics on six scRNA-seq datasets from different sequencing platforms. The experimental results demonstrate that scMGCAE outperforms other methods on these datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Dimensionality reduction

来源：评论

学校读者我要写书评

暂无评论

Improving Incremental Learning: A Closer Look at the Softmax Function

SSRN

引用

SSRN 2024年

作者： Zhai, Zheng Zhang, Jiali Wang, Haiyu Wu, Mingxin Yang, Keshun Qiao, Xiaoyan Sun, Qiang Beijing Normal University No.18 Jinfeng Road Guangdong Zhuhai519087 China Shandong Technology and Business University Shandong Yantai China Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Shandong China Immersion Technology and Evaluation Shandong Engineering Research Center Shandong China School of Mathematics Sichuan University Chengdu China College of Liberal Arts and Sciences University of Illinois Urbana-Champaign IL United States Department of Statistical Sciences University of Toronto ON Canada Department of Computer Science University of Toronto ON Canada Department of Statistics and Data Science MBZUAI Abu Dhabi United Arab Emirates

This paper investigates the limitations of the widely adopted softmax cross-entropy loss in incremental learning problems. Specifically, we highlight how the shift-invariant property of this loss function can lead to multiple optimal solutions and imbalanced weights across different tasks, which exacerbates catastrophic forgetting. To address these issues, we propose two key modifications to the objective function: (1) regularizing or replacing the original joint distillation loss with a summation of task-specific distillation losses, and/or (2) utilizing a shift-sensitive prediction loss function, such as the binary cross-entropy loss. Numerical experiments validate the effectiveness of these proposals, demonstrating improved prediction accuracy and a significant reduction in forgetting. © 2024, The Authors. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：