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

arXiv 2023年

作者： Jiang, Luyu Ouyang, Dantong Zhang, Qi Zhang, Liming 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

Local search is an effective method for solving large-scale combinatorial optimization problems, and it has made remarkable progress in recent years through several subtle mechanisms. In this paper, we found two ways to improve the local search algorithms in solving Pseudo-Boolean Optimization(PBO): Firstly, some of those mechanisms such as unit propagation are merely used in solving MaxSAT before, which can be generalized to solve PBO as well;Secondly, the existing local search algorithms utilize the heuristic on variables, so-called score, to mainly guide the search. We attempt to gain more insights into the clause, as it plays the role of a middleman who builds a bridge between variables and the given formula. Hence, we first extended the combination of unit propagation-based decimation algorithm to PBO problem, giving a further generalized definition of unit clause for PBO problem, and apply it to the existing solver LS-PBO for constructing an initial assignment;then, we introduced a new heuristic on clauses, dubbed care, to set a higher priority for the clauses that are less satisfied in current iterations. Experiments on benchmarks from the most recent PB Competition, as well as three real-world application benchmarks including minimum-width confidence band, wireless sensor network optimization, and seating arrangement problems show that our algorithm DeciLS-PBO has a promising performance compared to the state-of-the-art algorithms. Copyright © 2023, The Authors. All rights reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Review of dataset and labeling methods for causality extraction 28

A Review of dataset and labeling methods for causality extra...

引用

28th International Conference on computational Linguistics, COLING 2020

作者： Xu, Jinghang Zuo, Wanli Liang, Shining Zuo, Xianglin College of Computer Science and Technology Jilin University China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education China

ISBN: (纸本)9781952148279

Causality represents the most important kind of correlation between events. Extracting causality from text has become a promising hot topic in NLP. However, there is no mature research systems, evaluation rules and datasets for public evaluation. Moreover, there is a lack of unified causal sequence labeling methods, which constitute the key factors that hinder the progress of causality extraction research. We survey the limitations and shortcomings of existing causality research field comprehensively from the aspects of basic concepts, extraction methods, experimental data, and labeling methods, so as to provide reference for future research on causality extraction. We summarize the existing causality datasets, explore their practicability and extensibility from multiple perspectives. Aiming at the problem of causal sequence labeling, we analyze the existing methods of causal sequence labeling, with a summarizations of its regulation. Multiple candidate causal labeling sequences are put forward according to labeling controversy to explore the optimal labeling method through experiments, and suggestions are provided for selecting labeling method. © 2020 COLING 2020 - 28th International Conference on computational Linguistics, Proceedings of the Conference. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A Driving Area Detection Algorithm Based on Improved Swin Transformer

SSRN

引用

SSRN 2023年

作者： Li, Ying Liu, Shuang Sheng, Huankun 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

Drivable area or free space detection is an essential part of the perception system of an autonomous vehicle. It helps intelligent vehicles understand road conditions and determine safe driving areas. Most of the driving area detection algorithms are based on semantic segmentation that classifies each pixel into its category, and recent advances in convolutional neural networks (CNNs) have significantly facilitated semantic segmentation in driving scenarios. Though promising results have been obtained, the existing CNN-based drivable area detection methods usually process one local neighborhood at a time. The locality of convolutional operation fails to capture long-range dependencies. To solve this problem, we propose an improved Swin Transformer based on shift window, named Multi-Swin. First, an improved patch merging strategy is proposed to enhance feature interactions between adjacent patches. Second, a decoder with upsampling layer is designed to restore the resolution of the feature map. Last, a multi-scale fusion module is utilized to improve the representation ability of global semantic and geometric information. Our method is evaluated and tested on the publicly available Cityscapes dataset. The experimental results show that our method achieves 91.92% mIoU in road segmentation detection, surpassing state-of-the-art methods. © 2023, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A Driving Area Detection Algorithm Based on Swin Transformer

A Driving Area Detection Algorithm Based on Swin Transformer

引用

Frontiers Technology of Information and Computer (ICFTIC), IEEE International Conference on

作者： Shuang Liu Ying Li 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

The detection of drivable areas holds immense significance within the perception system of autonomous vehicles. This capability enables intelligent vehicles to gain a comprehensive understanding of the current road conditions and effectively identify safe areas suitable for safe navigation. Convolutional Neural Networks (CNNs) have achieved significant progress in the application of drivable areas detection, particularly in semantic segmentation. However, most existing CNN-based methods for drivable area detection only consider information within a local neighborhood, thus failing to effectively capture long-range dependencies. To tackle this concern, we propose a novel U-shaped network based on the Swin Transformer. The Swin Transformer block was employed as the fundamental element of both the encoder and decoder. Additionally, an upsampling layer was introduced in the decoder to effectively restore the resolution of the feature map. We evaluate our approach on the Cityscapes dataset, a publicly available benchmark for autonomous driving. Experimental results verify the exceptional performance of our proposed method, achieving an impressive mean Intersection over Union (mIoU) score of 91.61%. Our method outperforms existing state-of-the-art techniques in road segmentation detection, further demonstrating its superiority.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Neural Explainable Recommender Model Based on Attributes and Reviews

引用

Journal of Computer Science & Technology 2020年第6期35卷 1446-1460页

作者： Yu-Yao Liu Bo Yang Hong-Bin Pei Jing Huang Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China

Explainable recommendation, which can provide reasonable explanations for recommendations, is increasingly important in many fields. Although traditional embedding-based models can learn many implicit features, resulting in good performance, they cannot provide the reason for their recommendations. Existing explainable recommender methods can be mainly divided into two types. The first type models highlight reviews written by users to provide an explanation. For the second type, attribute information is taken into consideration. These approaches only consider one aspect and do not make the best use of the existing information. In this paper, we propose a novel neural explainable recommender model based on attributes and reviews (NERAR) for recommendation that combines the processing of attribute features and review features. We employ a tree-based model to extract and learn attribute features from auxiliary information, and then we use a time-aware gated recurrent unit (T-GRU) to model user review features and process item review features based on a convolutional neural network (CNN). Extensive experiments on Amazon datasets demonstrate that our model outperforms the state-of-the-art recommendation models in accuracy of recommendations. The presented examples also show that our model can offer more reasonable explanations. Crowd-sourcing based evaluations are conducted to verify our model's superiority in explainability.

关键词： recommender system explainable recommendation review usefulness attribute usefulness

来源：评论

学校读者我要写书评

暂无评论

SMT(LIA) Sampling with High Diversity

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An AutoEncoder-Based Matrix Factorization Approach to Estimating Cell Proportion from Bulk Tumor RNA-seq Data

An AutoEncoder-Based Matrix Factorization Approach to Estima...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yingze Xu Yan Wang Xuping Xie Feilong Wang Qiong Chen Huiyan Sun College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology School of Artificial Intelligence Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Artificial Intelligence Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781665429825

The deconvolution of infiltrating immune cells and stromal cells from complex tumor tissues is significant for studying the impact of these cells on tumor development, as well as assisting cancer therapies. Integrating cell-specific marker genes from several references, we put forward an AutoEncoder-based matrix factorization method to estimate the cell proportion in heterogeneous samples. The proportion predicted by our method achieved over 0.95 Pearson correlation coefficient (PCC) with the ground truth. Moreover, through analyzing association between cell proportion of tumor tissues and clinical information of the tumor patients, we found that the proportion of cancer-associated fibroblast (CAF) gradually increased with the progress of tumor, and the proportion of B cell in tissues was significantly related to the five-year survival rate of tumor patients.

关键词： Head Deconvolution Medical treatment Melanoma Fibroblasts Neck Reliability

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：