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

Structural Optimization of Causal Driven Model Based on Bayesian Network in High-dimensional Data Classification

Applied Mathematics and Nonlinear Sciences 2025年第1期10卷

作者： Li, Kuo Wang, Aimin Wang, Limin Zhao, Yuetan Zhu, Xinyu 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 College of Software Jilin University Changchun130012 China

The Bayesian network (BN) model, as a big data graph model that integrates causal inference and probabilistic representation, has received widespread attention and research in both academia and industry. However, with the advent of the big data era, traditional BN structure learning algorithms have encountered unprecedented challenges in processing high-dimensional data, mainly manifested as a sharp increase in computational complexity and difficulty in achieving ideal accuracy requirements within an acceptable time range, which greatly limits their breadth and depth in practical applications. In response to this bottleneck problem, this article innovatively proposes a new approach that combines width learning theory with BN, referred to as Broad Bayesian Neural Network (Broad-BNN). This model effectively reduces the dimensionality of the original high-dimensional data by introducing a feature mapping layer and gradually expanding it, while achieving non-linear transformation of information and effective feature extraction. The experimental results show that the model proposed in this paper has achieved significant performance improvement in high-dimensional data classification problems, not only accelerating training speed but also significantly improving classification accuracy, providing a new perspective and solution for solving the difficulties of high-dimensional data processing. © 2025 Kuo Li et al., published by Sciendo.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Attribute imputation autoencoders for attribute-missing graphs

引用

knowledge-Based Systems 2024年 291卷

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

Analyzing attribute-missing graphs with a complete topology, but missing the attributes of some nodes, is an emerging and challenging research topic. Data imputation techniques based on graph autoencoders are commonly used for attribute-missing graphs. However, this method cannot effectively integrate existing attributes and structural information during the encoding stage and is prone to introducing noise, resulting in inaccurate imputation. In addition, the expressiveness of decoders in existing methods is limited because their network architecture has not been adequately designed, which restricts the accuracy and robustness of the generated attributes. To address these issues, we propose a novel Attribute Imputation AutoEncoder for attribute-missing graphs, named AIAE. In particular, during the encoding stage, a dual encoder based on knowledge distillation is designed to encode both attribute and structural information into representations of attribute-missing nodes to achieve more accurate imputation. To avoid introducing noise, we fully exploit the observed information by reorganizing the representations of the attribute-missing and attribute-observed nodes. In the decoding stage, we propose a multi-scale decoder with masking to make the decoder more expressive and enhance its robustness and generative ability. Extensive experiments demonstrate that our model significantly outperforms state-of-the-art methods in attribute-missing graphs. © 2024 Elsevier B.V.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Decision Mamba: Reinforcement Learning via Hybrid Selective Sequence Modeling

arXiv

引用

arXiv 2024年

作者： Huang, Sili Hu, Jifeng Yang, Zhejian Yang, Liwei Luo, Tao Chen, Hechang Sun, Lichao Yang, Bo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China School of Artificial Intelligence Jilin University China Institute of High Performance Computing A*STAR Singapore Lehigh University BethlehemPA United States

Recent works have shown the remarkable superiority of transformer models in reinforcement learning (RL), where the decision-making problem is formulated as sequential generation. Transformer-based agents could emerge with self-improvement in online environments by providing task contexts, such as multiple trajectories, called in-context RL. However, due to the quadratic computation complexity of attention in transformers, current in-context RL methods suffer from huge computational costs as the task horizon increases. In contrast, the Mamba model is renowned for its efficient ability to process long-term dependencies, which provides an opportunity for in-context RL to solve tasks that require long-term memory. To this end, we first implement Decision Mamba (DM) by replacing the backbone of Decision Transformer (DT). Then, we propose a Decision Mamba-Hybrid (DM-H) with the merits of transformers and Mamba in high-quality prediction and long-term memory. Specifically, DM-H first generates high-value sub-goals from long-term memory through the Mamba model. Then, we use sub-goals to prompt the transformer, establishing high-quality predictions. Experimental results demonstrate that DM-H achieves state-of-the-art in long and short-term tasks, such as D4RL, Grid World, and Tmaze benchmarks. Regarding efficiency, the online testing of DM-H in the long-term task is 28× times faster than the transformer-based baselines. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

UAV Deployment Optimization in UAV-assisted Wireless Communications

arXiv

引用

arXiv 2024年

作者： Zhang, Xueqi Wang, Aimin Sun, Geng Liu, Lingling Zhang, Jing College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Communication Engineering Jilin University Changchun130012 China

Due to the fact that the locations of base stations (BSs) cannot be changed after they are installed, it is very difficult to communicate directly with remote user equipment (UE), which will directly affect the lifespan of the system. Unmanned aerial vehicles (UAVs) offer a hopeful solution as mobile relays for fifth-generation wireless communications due to the flexible and cost-effective deployment. However, with the limited onboard energy of UAV and slow progress in energy storage technology, it is a key challenge to achieve the energy-efficient communication. Therefore, in this article, we study a wireless communication network using a UAV as a high-altitude relay, and formulate a UAV relay deployment optimization problem (URDOP) to minimize the energy consumption of system by optimizing the deployment of UAV, including the locations and number of UAV hover points. Since the formulated URDOP is a mixed-integer programming problem, it presents a significant challenge for conventional gradient-based approaches. To this end, we propose a self-adaptive differential evolution with a variable population size (SaDEVPS) algorithm to solve the formulated URDOP. The performance of proposed SaDEVPS is verified through simulations, and the results show that it can successfully decrease the energy consumption of system when compared to other benchmark algorithms across multiple instances. Copyright © 2024, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

A Novel Drug-Drug Interaction Prediction Model Based on Line Subgraph Generation Strategy

A Novel Drug-Drug Interaction Prediction Model Based on Line...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Bai, Tian Li, Chu Peng, Xinyue Guan, Haotian Zhang, Zefan Wang, Guishen Jilin University College of Computer Science and Technology Changchun China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China Jilin University College of Software Changchun China Jilin University School of Nursing Changchun China Jilin University School of Life Sciences Changchun China Changchun University of Technology College of Computer Science and Engineering Changchun China

ISBN: (纸本)9798350337488

Drug-Drug Interaction (DDI) prediction task is helpful for better-understanding drugs. In this paper, we propose a novel drug-drug interaction prediction model based on line subgraph generation strategy, named DDI-LSG model. Our DDI-LSG model consists of three main parts which include drug relation graph construction, line subgraph generation strategy, and graph-level classification. To consider more relationships among drugs, we propose a node feature-enhancing method to encode drug features in drug relation graph construction process. To consider drugs and DDI as equivalent factors of our DDI-LSG model, we introduce line graph transformation to integrate DDI with drug feature enhancing vector. Combining Jaccard similarity with cosine similarity, we propose a line subgraph generation strategy to evaluate node relation and extract key structures around target DDI in the line graph. Then, we reformulate the DDI prediction task into a graph-level classification task for the line subgraph of the target DDI. Therefore, in the final part of our DDI-LSG model, we use a graph-level classifier to classify the line subgraphs. Our DDI-LSG model outperforms better experiment results than baselines. Ablation results have validated the node feature enhancing method and line subgraph generation strategy. © 2023 IEEE.

关键词： drug-drug interaction prediction graph-level classification line graph line subgraph strategy node feature enhancing method

来源：评论

学校读者我要写书评

暂无评论

Learning Stable Task-Level Manifold for Few-Shot Learning

Learning Stable Task-Level Manifold for Few-Shot Learning

引用

Proceedings of the Digital Image Computing: Technqiues and Applications (DICTA)

作者： Siyi Yu Wei Luo Gang Li Bo Yang 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

Few-shot learning (FSL) aims to learn to new concepts based on very limited data. One of the main challenges in FSL is the use of pretrained embeddings whose dimension is too high for the small sample size. While the large dimensionality helps capture diverse features in the training example, not all the features are relevant to the task at hand. Such task-irrelevant features from pre-trained embeddings can negatively impact the performance of the FSL model. To address this challenge, we propose a simple yet effective way to learn task-level manifolds that explicitly eliminate the negative effect of nuisance features. One key novelty of our approach is to address class imbalance in the training data by injecting supervised information through key virtual samples, which we named Manifold Support Points. Empirically, we demonstrate that the stability of the learnt task-level manifolds and their effectiveness in challenging tasks in FSL. Our approach shows competitive performance on several benchmark datasets, including tieredImageNet and CUB.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Sentence Representation Learning with Frequency-induced Adversarial Tuning and Incomplete Sentence Filtering

arXiv

引用

arXiv 2023年

作者： Wang, Bing Li, Ximing Yang, Zhiyao Guan, Yuanyuan Li, Jiayin Wang, Shengsheng College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China School of Humanities Jilin University China

Pre-trained Language Model (PLM) is nowadays the mainstay of Unsupervised Sentence Representation Learning (USRL). However, PLMs are sensitive to the frequency information of words from their pre-training corpora, resulting in anisotropic embedding space, where the embeddings of high-frequency words are clustered but those of low-frequency words disperse sparsely. This anisotropic phenomenon results in two problems of similarity bias and information bias, lowering the quality of sentence embeddings. To solve the problems, we fine-tune PLMs by leveraging the frequency information of words and propose a novel USRL framework, namely Sentence Representation Learning with Frequency-induced Adversarial tuning and Incomplete sentence filtering (SLT-FAI). We calculate the word frequencies over the pre-training corpora of PLMs and assign words thresholding frequency labels. With them, (1) we incorporate a similarity discriminator used to distinguish the embeddings of high-frequency and low-frequency words, and adversarially tune the PLM with it, enabling to achieve uniformly frequency-invariant embedding space;and (2) we propose a novel incomplete sentence detection task, where we incorporate an information discriminator to distinguish the embeddings of original sentences and incomplete sentences by randomly masking several low-frequency words, enabling to emphasize the more informative low-frequency words. Our SLT-FAI is a flexible and plug-and-play framework, and it can be integrated with existing USRL techniques. We evaluate SLT-FAI with various backbones on benchmark datasets. Empirical results indicate that SLT-FAI can be superior to the existing USRL baselines. Our code is released in https://***/wangbing1416/SLT-FAI. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Geometrical Characterizations of Non-Radiating Sources at Polyhedral and Conical Corners with Applications

引用

Communications in Mathematical Research 2023年第4期39卷 523-538页

作者： Huaian Diao Yueran Geng Hongyu Liu Qinghua Yu School of Mathematics and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchunJilin 130012P.R.China. Department of Mathematics City University of Hong KongKowloonHong Kong SARP.R.China. The School Attached to Dalian Maritime University Dalian 116000P.R.China.

Considering the acoustic source scattering problems,when the sour-ce is non-radiating/invisible,we investigate the geometrical characterization for the underlying sources at polyhedral and conical *** is revealed that the non-radiating source with Holder continuous regularity must vanish at the *** this kind of geometrical characterization of non-radiating sources,we establish local and global unique determination for a source with the polyhedral or corona shape support by a single far field *** by a single far field measurement constitutes of a long standing problem in inverse scattering problems.

关键词： Non-radiating sources corner singularity vanishing inverse scattering sin-gle far-field measurement

来源：评论

学校读者我要写书评

暂无评论

FastClass: A Time-Efficient Approach to Weakly-Supervised Text Classification

FastClass: A Time-Efficient Approach to Weakly-Supervised Te...

引用

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

作者： Xia, Tingyu Wang, Yue Tian, Yuan Chang, Yi School of Artificial Intelligence Jilin University China School of Information and Library Science University of North Carolina Chapel Hill United States Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University China International Center of Future Science Jilin University China

Weakly-supervised text classification aims to train a classifier using only class descriptions and unlabeled data. Recent research shows that keyword-driven methods can achieve state-of-the-art performance on various tasks. However, these methods not only rely on carefully-crafted class descriptions to obtain class-specific keywords but also require substantial amount of unlabeled data and takes a long time to train. This paper proposes FastClass, an efficient weakly-supervised classification approach. It uses dense text representation to retrieve class-relevant documents from external unlabeled corpus and selects an optimal subset to train a classifier. Compared to keyword-driven methods, our approach is less reliant on initial class descriptions as it no longer needs to expand each class description into a set of class-specific keywords. Experiments on a wide range of classification tasks show that the proposed approach frequently outperforms keyword-driven models in terms of classification accuracy and often enjoys orders-of-magnitude faster training speed. © 2022 Association for computational Linguistics.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：