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

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

来源：评论

学校读者我要写书评

暂无评论

Mx2M: Masked Cross-Modality Modeling in Domain Adaptation for 3D Semantic Segmentation

arXiv

引用

arXiv 2023年

作者： Zhang, Boxiang Wang, Zunran Ling, Yonggen Guan, Yuanyuan Zhang, Shenghao Li, Wenhui College of Computer Science and Technology Jilin University Changchun China Robotics X Tencent Shenzhen China Key Laboratory of Symbolic Computation and Knowledge Engineer Jilin University Changchun China

Existing methods of cross-modal domain adaptation for 3D semantic segmentation predict results only via 2D-3D complementarity that is obtained by cross-modal feature matching. However, as lacking supervision in the target domain, the complementarity is not always reliable. The results are not ideal when the domain gap is large. To solve the problem of lacking supervision, we introduce masked modeling into this task and propose a method Mx2M, which utilizes masked cross-modality modeling to reduce the large domain gap. Our Mx2M contains two components. One is the core solution, cross-modal removal and prediction (xMRP), which makes the Mx2M adapt to various scenarios and provides cross-modal self-supervision. The other is a new way of cross-modal feature matching, the dynamic cross-modal filter (DxMF) that ensures the whole method dynamically uses more suitable 2D-3D complementarity. Evaluation of the Mx2M on three DA scenarios, including Day/Night, USA/Singapore, and A2D2/SemanticKITTI, brings large improvements over previous methods on many metrics. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Do We Need an Encoder-Decoder to Model Dynamical Systems on Networks?

arXiv

引用

arXiv 2023年

作者： Liu, Bing Luo, Wei Li, Gang Huang, Jing Yang, Bo College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China School of Information Technology Deakin University Geelong Australia

As deep learning gains popularity in modelling dynamical systems, we expose an underappreciated misunderstanding relevant to modelling dynamics on networks. Strongly influenced by graph neural networks, latent vertex embeddings are naturally adopted in many neural dynamical network models. However, we show that embeddings tend to induce a model that fits observations well but simultaneously has incorrect dynamical behaviours. Recognising that previous studies narrowly focus on short-term predictions during the transient phase of a flow, we propose three tests for correct long-term behaviour, and illustrate how an embedding-based dynamical model fails these tests, and analyse the causes, particularly through the lens of topological conjugacy. In doing so, we show that the difficulties can be avoided by not using embedding. We propose a simple embedding-free alternative based on parametrising two additive vector-field components. Through extensive experiments, we verify that the proposed model can reliably recover a broad class of dynamics on different network topologies from time series data. © 2023, CC BY.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

A Novel Local Search Algorithm Based on Connectivity Method and Vertex Penalty Mechanism for Minimum Weighted Connected Dominating Set Problem

SSRN

引用

SSRN 2024年

作者： Li, Ruizhi He, Jintao Yin, Minghao Hu, Shuli Ding, Nan Jilin University of Finance and Economics Changchun130117 China Northeast Normal University Changchun130117 China Business Big Data Research Center of Jilin Province Changchun130117 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China

The minimum weighted connected dominating set problem is a classical NP-hard problem with wide applications in practice. In this paper, an efficient local search algorithm is proposed to solve this problem. In this algorithm, firstly, an initial solution construction method based on greedy randomized adaptive strategy is adopted, which can balance the quality and the diversity of the initial solutions. Second, two new scoring functions, Ascore and Cscore, are proposed to increase the diversity of deleted vertices. Third, a new connectivity method is proposed so that the algorithm no longer relies on the shortest path between two connected components. Fourth, a vertex penalty mechanism is introduced, which helps the algorithm to jump out of the local optimum effectively. Fifth, two scoring functions, Ascore and Cscore, are combined with the vertex penalty mechanism to propose an effective vertex selection method, which helps the algorithm to select suitable vertices to be added to or removed from the current candidate solution. Finally, the propsoed local search algorithm is compared with seven state-of-the-art algorithms on three types of benchmark instances. The experimental results show that the algorithm exhibits better performance on these three types of classical benchmark instances. © 2024, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Nighttime traffic object detection via adaptively integrating event and frame domains

引用

Fundamental Research 2024年

作者： Jiang, Yu Wang, Yuehang Zhao, Minghao Zhang, Yongji Qi, Hong The College of Computer Science and Technology Jilin University Changchun 130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China The College of Earth Sciences Jilin University Changchun 130012 China

Intelligent perception is crucial in Intelligent Transportation Systems (ITS), with vision cameras as critical components. However, traditional RGB cameras exhibit a significant decline in performance when capturing nighttime traffic scenes, limiting their effectiveness in supporting ITS. In contrast, event cameras possess a high dynamic range (140 dB vs. 60 dB for traditional cameras), enabling them to overcome frame degradation in low-light conditions. Recently, multimodal learning paradigms have made substantial progress in various vision tasks, such as image-text retrieval. Motivated by this progress, we propose an adaptive selection and fusion detection method that leverages both event and RGB frame domains to optimize nighttime traffic object detection jointly. To address the challenge of unbalanced multimodal data fusion, we design a learnable adaptive selection and fusion module. This module performs feature ranking and fusion in the channel dimension, allowing efficient multimodal fusion. Additionally, we construct a novel multi-level feature pyramid network based on multimodal attention fusion. This network extracts potential features to enhance robustness in detecting nighttime traffic objects. Furthermore, we curate a dataset for nighttime traffic scenarios comprising RGB frames and corresponding event streams. Through experiments, we demonstrate that our proposed method outperforms current state-of-the-art techniques in event-based, frame-based, and event and frame fusion methods. This highlights the effectiveness of integrating the event and frame domains in enhancing nighttime traffic object detection. © 2023 The Authors

关键词： Event camera Intelligent transportation Multimodal learning Nighttime object detection

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy Clustering Based Collaborative Filtering Algorithm for Time-Aware POI Recommendation 3

A Fuzzy Clustering Based Collaborative Filtering Algorithm f...

引用

2020 3rd International Conference on Modeling, Simulation and Optimization Technologies and Applications, MSOTA 2020

作者： Yin, Minghao Liu, Yanheng Zhou, Xu Sun, Geng College of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China Center for Computer Fundamental Education Jilin University Changchun Jilin China

Location based social network develops and gets widely concern along with the population and widespread use of mobile. Point of interest(POI) recommendation become one of the most widely application among location-based service. To get better POI recommendation performance, a fuzzy clustering based collaborative filtering algorithm (FCCF) for time-Aware POI recommendation is proposed in this paper. It first constructs the user feature vector from users' check-in behaviours. Individual's check-in behaviour can be under the influence of location region and time slots, so user's feature consists of two parts. One is the vising frequency of each user in different location regions, and the other is the vising frequency of each user in different time slots. Next fuzzy c-means is adopted due to its simplicity to group users according to user feature vector. Then the user similarity computation can be limited in the similar small user groups. In the end, a collaborative filtering algorithm is applied to recommend a number of top-N POIs at a given time for the target user. Some experiments are conducted and the comparative results on Foursquare and Gowalla show that FCCF has higher precision and recall value than the comparative algorithms. © Published under licence by IOP Publishing Ltd.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

WGAN-GP_Glu: A semi-supervised model based on double generator-Wasserstein GAN with gradient penalty algorithm for glutarylation site identification

引用

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

作者： Ning, Qiao Qi, Zedong Information Science and Technology Dalian Maritime University Liaoning Dalian China The School of Artificial Intelligence and Computer Science Jiangnan University Wuxi China Neusoft Education Technology Group Dalian China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

As an important post-translational modification, glutarylation plays a crucial role in a variety of cellular functions. Recently, diverse computational methods for glutarylation site identification have been proposed. However, the class imbalance problem due to data noise and uncertainty of non-glutarylation sites remains a great challenge. In this article, we propose a novel semi-supervised learning algorithm, called WGAN-GP_Glu, for identifying reliable non-glutarylation lysine sites from those without glutarylation annotation. WGAN-GP_Glu method is a multi-module framework algorithm, which mainly includes a reliable negative sample selection module, a deep feature extraction module, and a glutarylation site prediction module. In reliable negative sample selection module, we design an improved method of Wasserstein GAN with Gradient Penalty (WGAN-GP), named ReliableWGAN-GP, including three parts, two generators G1, G2 and a discriminator D, which can select reliable non-glutarylation samples from a great number of unlabeled samples. Generator G1 is utilized to generate noise data from unlabeled samples. For generator G2, both the positive sample and the noise data are used as inputs to improve the discriminant capability of discriminator D. Then, convolutional neural network and bidirectional long short-term memory network combined with attention mechanism are utilized to extract deep features for glutarylation samples and reliable non-glutarylation samples. Finally, a glutarylation site prediction module based on the three-layer fully connected layer is designed to make class predictions for samples. The sensitivity, specificity, accuracy and Matthew correlation coefficient of WGAN-GP_Glu on the independent test data set reach 90.58 %, 95.82 %, 94.44 % and 0.8645, respectively, which surpassed the existing methods for glutarylation sites prediction. Therefore, WGAN-GP_Glu can serve as a powerful tool in identifying glutarylation sites and the ReliableWGAN-GP algo

关键词： Gallium nitride

来源：评论

学校读者我要写书评

暂无评论

END-TO-END ENTITY DETECTION WITH PROPOSER AND REGRESSOR

arXiv

引用

arXiv 2022年

作者： Wen, Xueru Zhou, Changjiang Tang, Haotian Liang, Luguang Jiang, Yu Qi, Hong College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University China

Named entity recognition is a traditional task in natural language processing. In particular, nested entity recognition receives extensive attention for the widespread existence of the nesting scenario. The latest research migrates the well-established paradigm of set prediction in object detection to cope with entity nesting. However, the manual creation of query vectors, which fail to adapt to the rich semantic information in the context, limits these approaches. An end-to-end entity detection approach with proposer and regressor is presented in this paper to tackle the issues. First, the proposer utilizes the feature pyramid network to generate high-quality entity proposals. Then, the regressor refines the proposals for generating the final prediction. The model adopts encoder-only architecture and thus obtains the advantages of the richness of query semantics, high precision of entity localization, and easiness of model training. Moreover, we introduce the novel spatially modulated attention and progressive refinement for further improvement. Extensive experiments demonstrate that our model achieves advanced performance in flat and nested NER, achieving a new state-of-the-art F1 score of 80.74 on the GENIA dataset and 72.38 on the WeiboNER dataset. Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Towards More Accurate and Complete Iris Segmentation Using Hybrid Transformer U-Net

Towards More Accurate and Complete Iris Segmentation Using H...

引用

IEEE International Joint Conference on Biometrics (IJCB)

作者： Ye Sun Yinan Lu Yuanning Liu Xiaodong Zhu College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education

ISBN: (纸本)9781665463959

Iris images captured in less-constrained environments often suffer from adverse noise, challenging many existing segmentation algorithms. In this paper, we propose an efficient Hybrid Transformer U-Net (HTU-Net) to address this dilemma. Unlike previous studies that only focus on utilizing popular CNN technology to predict iris masks accurately, HTU-Net can simultaneously obtain segmentation masks and parameterized pupillary and limbic boundaries by a multi-task network, further enabling CNN-based iris segmentation to be applied in any regular iris recognition systems. We explore the application of the Transformer in iris segmentation and propose a hybrid encoder that employs convolutional layers to extract local intensity features and the Transformer to capture long-range associative information. For decoding, we adopt a novel Multi-Head Dilated Attention to exploit the multi-scale contextual information by gating mechanism, thus emphasizing the important features and rendering powerful representations. Inspired by the consistent class characteristics of iris, we further devise a Pyramid Center-Aware Module to capture the global structural context of iris from a categorical perspective to improve performance. Experimental results show that our method, with fewer parameters than previous approaches, achieves competitive or new state-of-the-art performance in both iris segmentation and localization on three challenging iris datasets. Code will be released at https://***/Syloveslife/HTU-Net.

关键词： Image segmentation Biological system modeling Transformers Feature extraction Rendering (computer graphics) Prediction algorithms Multitasking

来源：评论

学校读者我要写书评

暂无评论

TYPE-SUPERVISED SEQUENCE LABELING BASED ON THE HETEROGENEOUS STAR GRAPH FOR NAMED ENTITY RECOGNITION

arXiv

引用

arXiv 2022年

Named entity recognition is a fundamental task in natural language processing, identifying the span and category of entities in unstructured texts. The traditional sequence labeling methodology ignores the nested entities, i.e. entities included in other entity mentions. Many approaches attempt to address this scenario, most of which rely on complex structures or have high computation complexity. The representation learning of the heterogeneous star graph containing text nodes and type nodes is investigated in this paper. In addition, we revise the graph attention mechanism into a hybrid form to address its unreasonableness in specific topologies. The model performs the type-supervised sequence labeling after updating nodes in the graph. The annotation scheme is an extension of the single-layer sequence labeling and is able to cope with the vast majority of nested entities. Extensive experiments on public NER datasets reveal the effectiveness of our model in extracting both flat and nested entities. The method achieved state-of-the-art performance on both flat and nested datasets. The significant improvement in accuracy reflects the superiority of the multi-layer labeling strategy. Copyright © 2022, The Authors. All rights reserved.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：