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

14th International Conference on Algorithmic Aspects in information and Management, AAIM 2020

作者： Liu, Yunlong Chen, Jie Huang, Jingui Wang, Jianxin Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Computer Science and Engineering Central South University Changsha410083 China

ISBN: (纸本)9783030576011

Given a graph (Formula Presented) and a fixed linear order (Formula Presented) of V, the problem fixed-order book thickness asks whether there is a page assignment (Formula Presented) such that (Formula Presented) is a k-page book embedding of G. Recently, Bhore et al.(GD2019) presented an algorithm parameterized by the pathwidth of the vertex ordering (denoted by (Formula Presented)). In this paper, we first re-analyze the running time for Bhore et al.’s algorithm, and prove a bound of (Formula Presented) improving on Bhore et al.’s bound of (Formula Presented). We further show that this parameterized problem does not admit a polynomial kernel unless NP (Formula Presented) coNP/poly. Finally, we show that the general fixed-order book thickness problem, in which a budget of at most c crossings over all pages was given, admits an algorithm running in time (Formula Presented). © 2020, Springer Nature Switzerland AG.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Dynamic maintenance of decision rules for decision attribute values’ changing 25th

Dynamic maintenance of decision rules for decision attribute...

引用

25th International Conference on Neural information processing, ICONIP 2018

作者： Wang, Yingyao Dai, Jianhua Shi, Hong School of Computer Science and Technology Tianjin University Tianjin300350 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030041816

Rule induction method based on rough set theory (RST) which can generate a minimal set of decision rules by using attribute reduction and approximations has received much attention recently. In real-life, the variation of objects, attributes and attributes’ values affects reducts and approximations, e.g., the coarsening and refining of attributes’ values. The goal of this paper is dynamic maintenance of decision rules for decision attribute values’ coarsening and refining. Two incremental rough-set based methods are proposed to deal with this issue by updating assignment discernibility matrix dynamically without recomputing the reducts from the beginning, which increases the efficiency. © Springer Nature Switzerland AG 2018.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Label distribution learning based on ensemble neural networks 25th

Label distribution learning based on ensemble neural network...

引用

25th International Conference on Neural information processing, ICONIP 2018

作者： Zhai, Yansheng Dai, Jianhua Shi, Hong School of Computer Science and Technology Tianjin University Tianjin300350 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030041816

Label distribution learning (LDL), as an extension of multi-label learning, is a new arising machine learning technique to deal with label ambiguity problems. The maximum entropy model is commonly used in label distribution learning. However, it does not consider the correlation between the labels and is not suitable for nonlinear relationships, and the prediction performance is also limited. In this paper, we propose a label distribution learning algorithm based on ensemble neural networks. The algorithm trains neural networks with preferences using training sets with different label sets to construct base learners, and combines the base learners with the weights, which is learned by the combined learner to obtain the final learning results. Experimental results show that the proposed algorithm is effective for label distribution data. © Springer Nature Switzerland AG 2018.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

BGRA-Net: Boundary-Guided and Region-Aware Convolutional Neural Network for the Segmentation of Breast Ultrasound Images

BGRA-Net: Boundary-Guided and Region-Aware Convolutional Neu...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Zhang, Xiang Li, Xuanya Hu, Kai Gao, Xieping Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Baidu Inc. Beijing100085 China Key Laboratory of Medical Imaging and Artifical Intelligence of Hunan Province Xiangnan University Chenzhou423000 China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

ISBN: (纸本)9781665401265

In this paper, we propose a novel convolutional neural network based on boundary-guided and region-aware (BGRA-Net) for breast tumor segmentation in ultrasound images. In particular, in the encoding stage, we propose a boundary-guided module (BGM) to guide the learning of boundary features in the decoding stage by explicitly strengthening the extracted boundary information. Meanwhile, in the decoding stage, we propose a region-aware module (RAM) to integrate different levels of detailed and semantic features to improve the comprehensive representation of tumor regional features. Besides, a scale-adaptive module (SAM) is further proposed to capture the characteristics of tumors with different sizes between the encoding and decoding stages. To evaluate the effectiveness of our BGRA-Net, we conduct extensive experiments on the UDIAT dataset and compare it with eight state-of-the-art methods. The experimental results show that our BGRA-Net outperforms the state-of-the-art methods and can achieve accurate segmentation of breast tumors with ambiguous boundaries. © 2021 IEEE.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

NONMONOTONE LOCAL MINIMAX METHODS FOR FINDING MULTIPLE SADDLE POINTS

引用

Journal of Computational Mathematics 2024年第3期42卷 851-884页

作者： Wei Liu Ziqing Xie Wenfan Yi South China Research Center for Applied Mathematics and Interdisciplinary Studies South China Normal UniversityGuangzhou 510631China Key Laboratory of Computing and Stochastic Mathematics(Ministry of Education) Hunan Normal UniversityChangshaHunan 410081China Hunan Provincial Key Laboratory of Intelligent Information Processing and Applied Mathematics School of MathematicsHunan UniversityChangshaHunan 410082China

In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to find multiple(unstable)saddle points of nonconvex functionals in Hilbert *** to traditional LMMs with monotone search strategies,this approach,which does not require strict decrease of the objective functional value at each iterative step,is observed to converge faster with less ***,based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold,by generalizing the Zhang-Hager(ZH)search strategy in the optimization theory to the LMM framework,a kind of normalized ZH-type nonmonotone step-size search strategy is introduced,and then a novel nonmonotone LMM is *** feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative ***,in order to speed up the convergence of the nonmonotone LMM,a globally convergent Barzilai-Borwein-type LMM(GBBLMM)is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each ***,the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures:one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary *** numerical results indicate that our approach is very effective and speeds up the LMMs significantly.

关键词： Multiple saddle points Local minimax method Barzilai-Borwein gradient method Normalized nonmonotone search strategy Global convergence

来源：评论

学校读者我要写书评

暂无评论

A niching-based nondominated sorting for multimodal multiobjective optimization with local pareto fronts

引用

Applied Soft computing 2025年

作者： Qi Deng Juan Zou Shengxiang Yang Yuan Liu Fan Yu Tianbin Xie Jinhua Zheng Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Computer Science and School of Cyberspace Science of Xiangtan University Xiangtan Hunan Province China Faculty of School of Computer Science and School of Cyberspace Science of Xiangtan University Xiangtan 411105 China School of Computer Science and Informatics De Montfort University Leicester LE1 9BH UK School of Traffic and Transport Engineering Central South University Changsha China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang 421002 China

In multimodal multiobjective optimization problems (MMOPs), there may be local Pareto optimal solutions (PSs). Finding both global PS and local PS simultaneously can provide additional options for decision makers. However, since individuals on the global Pareto front (PF) dominate individuals on the local PF, traditional multimodal multiobjective evolutionary algorithms (MMEAs) cannot effectively handle MMOPs with local PF (MMOPLs). In this paper, we improve our previous dynamic-niching-based Pareto domination (DNPD) approach to search for local Pareto optimal solutions. The new version is called niching-based non-dominated sorting (NNSL). There are two improvements to NNSL. First, the dynamic niche is changed to a fixed niche to increase the diversity of the population. Second, individuals with poor convergence in the non-dominated layer are deleted to ensure the convergence of the population. NNSL can be combined with Pareto dominance-based algorithms. We apply NNSL to solve MMOPLs (MMF_e and IDMP_e series). Experiments show that NNSL can help traditional MMEAs find global PF/PS and local PF/PS simultaneously.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Multi-level Approach to Learning Early Warning based on Cognitive Diagnosis and Learning Behaviors Analysis 26

A Multi-level Approach to Learning Early Warning based on Co...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Ma, Hua Zhao, Wen Jiang, Zixu Huang, Peiji Tang, Wensheng Zhang, Hongyu Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha China Hunan Normal University College of Information Science and Engineering Changsha China Co. Ltd China Central South University School of Business Changsha China

ISBN: (纸本)9798350331684

Learning early warning is of great significance for coping with students' learning risks. The existing research fails in modeling the fluctuation of students' learning states and providing the multi-level early warning for students at different levels. To address them, a new approach of learning early warning is proposed to predict at-risk students in e-learning environment by combining cognitive diagnosis with learning behaviors analysis. In this approach, the students' learning process is modeled from four dimensions, i.e., learning quality, learning engagement, latent learning state, and historical learning performance. The convolutional neural network and long short-term memory network are used to explore the students' latent learning features. Then, the Adaboost algorithm is applied to predict students' learning performance. Based on the predicted performance, the evaluation rules are designed to provide multi-level learning early warning for students. Finally, the experiments demonstrate that the proposed method could predict at-risk students efficiently and accurately. © 2023 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Multimodal Graph Neural Network for Recommendation with Dynamic De-redundancy and Modality-Guided Feature De-noisy

arXiv

引用

arXiv 2024年

作者： Mo, Feng Xiao, Lin Song, Qiya Gao, Xieping Liang, Eryao Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University China

Graph neural networks (GNNs) have become crucial in multimodal recommendation tasks because of their powerful ability to capture complex relationships between neighboring nodes. However, increasing the number of propagation layers in GNNs can lead to feature redundancy, which may negatively impact the overall recommendation performance. In addition, the existing recommendation task method directly maps the preprocessed multimodal features to the low-dimensional space, which will bring the noise unrelated to user preference, thus affecting the representation ability of the model. To tackle the aforementioned challenges, we propose Multimodal Graph Neural Network for Recommendation (MGNM) with Dynamic De-redundancy and Modality-Guided Feature De-noisy, which is divided into local and global interaction. Initially, in the local interaction process,we integrate a dynamic de-redundancy (DDR) loss function which is achieved by utilizing the product of the feature coefficient matrix and the feature matrix as a penalization factor. It reduces the feature redundancy effects of multimodal and behavioral features caused by the stacking of multiple GNN layers. Subsequently, in the global interaction process, we developed modality-guided global feature purifiers for each modality to alleviate the impact of modality noise. It is a two-fold guiding mechanism eliminating modality features that are irrelevant to user preferences and captures complex relationships within the modality. Experimental results demonstrate that MGNM achieves superior performance on multimodal information denoising and removal of redundant information compared to the state-of-the-art methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

ADHD diagnosis guided by functional brain networks combined with domain knowledge

引用

Computers in Biology and Medicine 2024年 177卷 108611-108611页

作者： Cao, Chunhong Fu, Huawei Li, Gai Wang, Mengyang Gao, Xieping MOE Key Laboratory of Intelligent Computing and Information Processing Xiangtan University Xiangtan411100 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

Utilizing functional magnetic resonance imaging (fMRI) to model functional brain networks (FBNs) is increasingly prominent in attention-deficit/hyperactivity disorder (ADHD) research, revealing neural impact and mechanisms through the exploration of activated brain regions. However, current FBNs-based methods face two major challenges. The primary challenge stems from the limitations of existing modeling methods in accurately capturing both regional correlations and long-distance dependencies (LDDs) within the dynamic brain, thereby affecting the diagnostic accuracy of FBNs as biomarkers. Additionally, limited sample size and class imbalance also pose a challenge to the learning performance of the model. To address the issues, we propose an automated diagnostic framework, which integrates modeling, multimodal fusion, and classification into a unified process. It aims to extract representative FBNs and efficiently incorporate domain knowledge to guide ADHD classification. Our work mainly includes three-fold: 1) A multi-head attention-based region-enhancement module (MAREM) is designed to simultaneously capture regional correlations and LDDs across the entire sequence of brain activity, which facilitates the construction of representative FBNs. 2) The multimodal supplementary learning module (MSLM) is proposed to integrate domain knowledge from phenotype data with FBNs from neuroimaging data, achieving information complementarity and alleviating the problems of insufficient medical data and unbalanced sample categories. 3) An ADHD automatic diagnosis framework guided by FBNs and domain knowledge (ADF-FAD) is proposed to help doctors make more accurate decisions, which is applied to the ADHD-200 dataset to confirm its effectiveness. The results indicate that the FBNs extracted by MAREM perform well in modeling and classification. After with MSLM, the model achieves accuracy of 92.4%, 74.4%, and 80% at NYU, PU, and KKI, respectively, demonstrating its ability to effecti

关键词： Domain Knowledge

来源：评论

学校读者我要写书评

暂无评论

Improving Continual Few-shot Relation Extraction through Relational Knowledge Distillation and Prototype Augmentation 30

Improving Continual Few-shot Relation Extraction through Rel...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on language Resources and Evaluation, LREC-COLING 2024

作者： Zhang, Zhiheng Zeng, Daojian Bai, Xue Institute of AI and Targeted International Communication Hunan Normal University Changsha China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Changsha Dworld AI Tech Co. Ltd. China

ISBN: (纸本)9782493814104

In this paper, we focus on the challenging yet practical problem of Continual Few-shot Relation Extraction (CFRE), which involves extracting relations in the continuous and iterative arrival of new data with only a few labeled examples. The main challenges in CFRE are overfitting due to few-shot learning and catastrophic forgetting caused by continual learning. To address these problems, we propose a novel framework called RK2DA, which seamlessly integrates prototype-based data augmentation and relational knowledge distillation. Specifically, RK2DA generates pseudo data by introducing Gaussian noise to the prototype embeddings and utilizes a novel two-phase multi-teacher relational knowledge distillation method to transfer diverse knowledge from different embedding spaces. Experimental results on the FewRel and TACRED datasets demonstrate that our method outperforms the state-of-the-art baselines. © 2024 ELRA language Resource Association: CC BY-NC 4.0.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：