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

GraCEImpute: A novel graph clustering autoencoder approach for imputation of single-cell RNA-seq data

学校读者我要写书评

暂无评论

Computers in Biology and Medicine 2025年 184卷 109400-109400页

作者： Wang, Yueying Li, Kewei Zhang, Ruochi Fan, Yusi Huang, Lan Zhou, Fengfeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China School of Artificial Intelligence Jilin University Changchun130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang550025 China

Single-cell RNA sequencing (scRNA-seq) technology establishes a unique view for elucidating cellular heterogeneity in various biological systems. Yet the scRNA-seq data is compromised by a high dropout rate due to the technological limitation, and the substantial data loss poses computational challenges on subsequent analyses. This study introduces a novel graph clustering autoencoder (GCAE)-based imputation approach (GraCEImpute) to address the challenge of missing data in scRNA-seq data. Our comprehensive evaluation demonstrates that the GraCEImpute model outperforms existing approaches in accurately imputing dropout zeros within scRNA-seq data. The proposed GraCEImpute model also demonstrates the significantly enhanced quality of downstream scRNA-seq data analyses, including clustering, differential gene expression (DEG) analysis, and cell trajectory inference. These improvements underscore the GraCEImpute model's potential to facilitate a deeper understanding of cellular processes and heterogeneity through the scRNA-seq data analyses. The source code is released at https://***/supp/. © 2024 Elsevier Ltd

关键词： Gene expression

SMT(LIA) Sampling with High Diversity

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Lai, Yong Li, Junjie Luo, Chuan College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Software Beihang University Beijing100191 China

Satisfiability Modulo Linear Integer Arithmetic, SMT(LIA) for short, is pivotal across various critical domains. Previous research has primarily focused on SMT solving techniques. However, in practical applications such as software and hardware testing, there is a need to generate a diverse set of solutions for use as test inputs. We have developed the first sampling framework that integrates local search with CDCL(T) techniques, named HighDiv, capable of generating a highly diverse set of solutions for constraints under linear integer theory. Initially, in the local search phase, we introduced a novel operator called boundary-aware movement. This operator performs random moves by considering the current state’s constraints on variables, thereby enhancing the diversity of variables during the search process. Furthermore, we have conducted an in-depth study of the preprocessing and variable initialization mechanisms within the framework, which significantly enhances the efficiency of subsequent local searches. Lastly, we use the solutions obtained from local search sampling as additional constraints to further explore the solution space using the stochastic CDCL(T) method. Experimental results demonstrate that HighDiv generates solutions with greater diversity compared to the state-of-the-art SMT(LIA) sampling tool, MeGASampler. Copyright © 2025, The Authors. All rights reserved.

关键词： Software testing

Mask2Edge: Masking dependencies and dynamically capturing pixel differences in edge detection

学校读者我要写书评

暂无评论

Expert Systems with Applications 2025年 286卷

作者： Zhou, Jianhang Zhao, Hongwei Qu, Daikun Xing, Long College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China Army Artillery and Air Defense Academy Sergeant School Liaoning Shenyang110000 China

Edge detection plays an important role in computer vision tasks. Deep learning-based edge detectors commonly rely on encoding the long and short-term dependencies of pixel values to mine contextual information. They strongly focus on all positions in the image, ignoring the potential issue of over-encoding. Furthermore, most of these models have not attempted to leverage the inherent properties of edges. In this paper, we introduce a query-based edge detector named Mask2Edge, which is capable of masking dependencies and dynamically capturing pixel differences. Specifically, we first devise a masking strategy based on the sparsity of edges to alleviate the over-encoding issue. We propose a Region-guided Masked Attention, which adapts to edge detection and is capable of constraining cross-attention with appropriate masking intensity to extract relatively complete local features. Subsequently, we design a structure to capture the pixel differences that can help identify edges. We introduce dynamic convolutions into edge detection and refine the application scope and generation method of attention weights to effectively perceive changes in pixel gradients. Extensive experiments demonstrate the superiority of Mask2Edge compared with state-of-the-art methods. The source code is available at https://***/zhoujh2020/Mask2Edge. © 2025 Elsevier Ltd

关键词： Edge detection

NON-RADIATING ELASTIC SOURCES IN INHOMOGENEOUS ELASTIC MEDIA AT CORNERS WITH APPLICATIONS

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Diao, Huaian Geng, Yueran Tang, Ruixiang School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Mathematics Jilin University Changchun130012 China Department of Mathematics City University of Hong Kong Kowloon Hong Kong

This paper is concerned with non-radiating elastic sources in inhomogeneous elastic media. We demonstrate that the value of non-radiating elastic sources must vanish at convex corners of their support, provided the sources exhibit Hölder continuous regularity near the corner. Additionally, their gradient must satisfy intricate algebraic relationships with the angles defining the underlying corners, assuming the sources have C1,α regularity with α ∈ (0, 1) in the neighborhood of the corners. To perform microlocal analysis around the corners, we employ the so-called complex geometrical optics (CGO) solutions as test functions within a partial differential system. These characterizations of non-radiating elastic sources in inhomogeneous elastic media at corners enable us to establish the unique identifiability results for determining the position and shape of radiating elastic sources by a single far-field measurement, both locally and globally. The uniqueness result by a single far-field measurement is a challenging problem with a colorful history in inverse scattering. Indeed, when the support of a radiating elastic source is a convex polygon, we can simultaneously determine the shape of the elastic source and its values at the corners, provided the source is Hölder continuous at the corner. Furthermore, when the source function exhibits C1,α regularity in the neighborhood of a corner, the gradient of the source function at that corner can also be generically *** Codes 35Q74, 35R30, 74B05, 86A22 © 2025, CC BY.

关键词： Geometrical optics

Rethinking Polyp Segmentation from the Perspectives of Matching Views and Seeking Camouflage

学校读者我要写书评

暂无评论

Multimedia Systems 2025年第3期31卷 1-17页

作者： Jiang, Zhengfang Chen, Haipeng Yang, Yongping Liu, Xianzhu Lyu, Yingda College of Software Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Department of Colorectal Anal Surgery The Second Hospital of Jilin University Changchun130022 China National and Local Joint Engineering Research Center of Space Optoelectronics Technology Changchun University of Science and Technology Changchun130022 China College of Opto-Electronic Engineering Changchun University of Science and Technology Changchun130022 China Public Computer Education and Research Center Jilin University Changchun130012 China

Accurate segmentation of polyps from colonoscopy images is of great significance for the prevention of colorectal cancer. Despite notable progress, polyp segmentation remains a challenging task due to the diversity of polyp size and shape, as well as the camouflage property of polyps caused by their high similarity to surrounding tissues. To address these challenges, inspired by human perceptual experience in finding objects, we propose a multi-perspective collaborative network (MPCNet), innovatively identifying the potential polyps from the perspectives of matching views and seeking camouflage. Firstly, from the former perspective, a global–local aware module is proposed to provide various feature receptive fields to match suitable views for polyps of different sizes and shapes. Then, from the latter perspective, a texture enhancement module (TEM) and an interaction refinement module (IRM) are proposed to mine and complement clues essential for breaking the camouflage. Specifically, TEM mines texture-related clues and amplifies the subtle texture differences between polyps and their background, while IRM complements boundary clues and further optimizes feature representation through the interaction between boundaries and regions, thereby generating accurate segmentation results with complete regions and fine boundaries. Extensive experiments on five benchmark polyp datasets show that our MPCNet outperforms other state-of-the-art methods. In particular, we achieve a mean Dice of 81.7% and 82.4% on the most challenging datasets CVC-ColonDB and ETIS, respectively, which are significantly higher than competing methods. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Image segmentation

Incomplete Graph Learning: A Comprehensive Survey

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Xia, Riting Liu, Huibo Li, Anchen Liu, Xueyan Zhang, Yan Zhang, Chunxu Yang, Bo College of Computer Science Inner Mongolia University Hohhot010021 China School of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

Graph learning is a prevalent field that operates on ubiquitous graph data. Effective graph learning methods can extract valuable information from graphs. However, these methods are non-robust and affected by missing attributes in graphs, resulting in sub-optimal outcomes. This has led to the emergence of incomplete graph learning, which aims to process and learn from incomplete graphs to achieve more accurate and representative results. In this paper, we conducted a comprehensive review of the literature on incomplete graph learning. Initially, we categorize incomplete graphs and provide precise definitions of relevant concepts, terminologies, and techniques, thereby establishing a solid understanding for readers. Subsequently, we classify incomplete graph learning methods according to the types of incompleteness: (1) attribute-incomplete graph learning methods, (2) attribute-missing graph learning methods, and (3) hybrid-absent graph learning methods. By systematically classifying and summarizing incomplete graph learning methods, we highlight the commonalities and differences among existing approaches, aiding readers in selecting methods and laying the groundwork for further advancements. In addition, we summarize the datasets, incomplete processing modes, evaluation metrics, and application domains used by the current methods. Lastly, we discuss the current challenges and propose future directions for incomplete graph learning, with the aim of stimulating further innovations in this crucial field. To our knowledge, this is the first review dedicated to incomplete graph learning, aiming to offer valuable insights for researchers in related fields.1 Copyright © 2025, The Authors. All rights reserved.

关键词： knowledge graph

Learn to explain transformer via interpretation path by reinforcement learning

学校读者我要写书评

暂无评论

Neural Networks 2025年 188卷 107496页

作者： Niu, Runliang Wang, Qi Kong, He Xing, Qianli Chang, Yi Yu, Philip S. School of Artificial Intelligence Jilin University ChangChun130012 China Engineering Research Center of Knowledge-Driven Human–Machine Intelligence Ministry of Education China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University ChangChun China Department of Computer Science University of Illinois at Chicago United States

In recent years, the Transformer model has become a key part of many AI systems, making it important to understand how it works. The large parameter size and complex structure of the Transformer make interpretation more difficult and less efficient. Fortunately, there are many internal variables in Transformers that can aid in the explanation process, including attention matrices, gradients, hidden states, and activations between layers. Effectively utilizing these internal factors can help us better understand the decision-making process of Transformers. Also, most existing works focus on one type of these features and fail to investigate the interpretability of different variables in a unified model. To address these issues, this paper introduces a Reinforcement Learning environment in which the agent makes step-by-step modifications to input sequences to construct perturbed samples and gradually reduces the model's confidence in classification labels. The environment guides the agent to choose the token modification strategy along a more targeted interpretation path instead of random sampling, which can significantly improve the interpretation effectiveness. The flexibly designed agent can utilize multiple internal variables or even combinations of variables as observation, allowing for comparisons of their contributions to the model's interpretability. Extensive experiments conducted on three real-world datasets demonstrate the superior performance of our proposed model in both model interpretation and model adversarial attack tasks. We obtain a set of interesting findings, which can inspire further research on Transformer and Transformer-based model interpretation works. The code of this paper is available at https://***/niuzaisheng/Learn-to-Explain. © 2025

关键词： Reinforcement learning

Generative Classifier for Domain Generalization

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Long, Shaocong Zhou, Qianyu Li, Xiangtai Ying, Chenhao Tong, Yunhai Ma, Lizhuang Luo, Yuan Tao, Dacheng Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Nanyang Technological University Singapore Peking University Beijing China

Domain generalization (DG) aims to improve the generalizability of computer vision models toward distribution shifts. The mainstream DG methods predominantly focus on learning domain invariance across domains, however, such methods overlook the untapped potential inherent in domain-specific information. While the prevailing practice of discriminative linear classifier has been tailored to domain-invariant features, it struggles when confronted with diverse domain-specific information, e.g., intra-class shifts, that exhibits multi-modality. To address these issues, we explore the theoretical implications of relying on domain-invariant features, revealing the crucial role of domain-specific information in mitigating the target risk for DG. Drawing from these insights, we propose Generative Classifier-driven Domain Generalization (GCDG), introducing a generative paradigm for the DG classifier based on Gaussian Mixture Models (GMMs) for each class across domains. GCDG consists of three key modules: Heterogeneity Learning Classifier (HLC), Spurious Correlation Blocking (SCB), and Diverse Component Balancing (DCB). Concretely, HLC attempts to model the feature distributions and thereby capture valuable domain-specific information via GMMs. SCB identifies the neural units containing spurious correlations and perturbs them, mitigating the risk of HLC learning irrelevant spurious patterns. Meanwhile, DCB ensures a balanced contribution of components within HLC, preventing the underestimation or neglect of critical components. In this way, GCDG excels in capturing the nuances of domain-specific information characterized by diverse distributions. GCDG demonstrates the potential to reduce the target risk and encourage flat minima, improving the model’s generalizability. Extensive experiments show GCDG’s comparable performance on five DG benchmarks and one face anti-spoofing dataset, seamlessly integrating into existing DG methods with consistent improvements. Code will be avail

关键词： Discriminant analysis

Causality-inspired Unsupervised Domain Adaptation with Target Style Imitation for Medical Image Segmentation

学校读者我要写书评

暂无评论

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Song, Jincai Chen, Haipeng Lyu, Yingda Nie, Weizhi Liu, An-An Jilin University College of Computer Science and Technology Jilin Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin Changchun130012 China Jilin University Public Computer Education and Research Center Jilin Changchun130012 China Tianjin University School of Electrical and Information Engineering Tianjin300072 China

Deep learning performance may decrease substantially with unseen heterogeneous data. While most unsupervised domain adaptation (UDA) methods seek to address this through image alignment, they often ignore uncertainty style fluctuations within the target domain. When testing image styles vary in both direction and intensity, such models may fail to adapt. Furthermore, existing UDA methods tend to over-reliance on domain-level entire feature alignment, resulting in potentially over-exploiting semantic content-independent cues (e.g., intensity) as shortcut features. To address these limitations, this paper introduces an innovative and model-agnostic Causality-inspired Representation Learning Based on Target Style Imitation method for UDA. Specifically, we propose a novel Target Style Imitation (TSI) data augmentation approach to diversify the training data and align training and unseen target testing image styles. TSI constructs a Gaussian distribution for the target domain style and simulates unseen testing style variations through random sampling. Additionally, inspired by the stable and generalizable causal mechanism, we propose Causality-inspired Representation Learning (CRL) based on TSI method to enforce feature representations to adhere to causal properties (i.e., Separation and Independence) essential for robust UDA, thus fostering the model to focus on the domain-invariant semantic features. Our method surpasses state-of-the-art methods on two cross-modality medical image segmentation datasets. © 1991-2012 IEEE.

关键词： Semantic Segmentation