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

Noise-Tolerant Multi-Label Feature Selection Based on Sample Reliability Degree and Fuzzy Association Confidence

IEEE Transactions on Fuzzy Systems 2025年

作者： Kang, Yun Li, Jiaxin Dai, Jianhua Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Changsha410081 China

Multi-label feature selection (MFS) has received much attention because it can effectively mitigate the impact of ‘dimensionality curse’. Ambiguity and unavoidable label noise in real life pose significant challenges to MFS. So far, there are relatively few studies on MFS considering label noise. Existing few studies do not consider that label sets of different samples are affected by noise to different degrees, and ignoring differences between samples may reduce robustness of MFS. Moreover, they explore the fuzzy relationship between samples and labels from a local perspective, which is not comprehensive. In addition, they lack a monotonic metric for measuring attribute importance, leading to the unreasonable selected feature subset. To solve these issues, we propose a noise-tolerant MFS method by monotonic noise-tolerant fuzzy confidence conditional entropy with sample reliability degree and fuzzy association confidence called SRDAC. Firstly, sample reliability degree is defined from the perspective of consistency to distinguish samples affected by different levels of label noise. Secondly, the idea of global similarity and the fuzzy association confidence between samples and labels are proposed, and corresponding noise-tolerant label enhancement for different types of samples is carried out to better explore the relationship between samples and labels. Thirdly, based on noise-tolerant label space, the noise-tolerant fuzzy confidence conditional entropy is proposed to more reasonably measure the relationship between attributes. Finally, a robust MFS method based on monotonic noise-tolerant fuzzy confidence conditional entropy is proposed. Extensive experiments show that the effectiveness and robustness of SRDAC is better than other representative methods. © 1993-2012 IEEE.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Flower Pollination Algorithm for Solving Optimal Power Flow Problem

SSRN

引用

SSRN 2022年

作者： Zhong, keyu Xiao, Fen Gao, Xieping Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Hunan Normal University Changsha410081 China School of Mathematics and Statistics Hunan Normal University Changsha410081 China School of Computer Science Xiangtan University Hunan Xiangtan411105 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

The OPF system for renewable energy power has presented characteristics such as extremely high security constraints and more obvious multimodal properties, its solution is a challenging task and requires more efficient methods. In this paper, an enhanced flower pollination algorithm, EFPA-SF is proposed to solve the OPF problem. In EFPA-SF, there are four improvements: firstly, a random step size in the process of cross-pollination is proposed to improve the global search ability of EFPA-SF. Secondly, in the stage of self-pollination, the global optimal pollen is introduced to improve the ability of exploitation–exploration balance of the algorithm. In addition, if pollen individual crosses boundaries, boundary constraint is carried out by the previous position and boundary position of pollen, which is instrumental to escape from local optimum. Finally, the superiority of feasible solutions (SF) constraints handling method is integrated into the algorithm to satisfy the feasibility of the solutions. To verify the effectiveness of the proposed algorithm, the optimization capability of EFPA is first investigated and analyzed by using the most recent IEEE CEC2021 benchmark functions. Then, EFPA-SF is used to solve three engineering design problems and the performance is compared with the state-of-the-art algorithms, the validation results reveal that the proposed algorithm outperforms state-of-the-art algorithms, and demonstrate that it can be used for constrained optimization as well as for unconstrained optimization problems with good generality. Finally, EFA-SF is applied to the OPF problem on a modified IEEE-30 bus system that incorporates stochastic wind, solar, and small hydro power in addition to conventional thermal power generation. The comprehensive investigation reveals that EFA-SF can provide competitive solutions to the OPF problem compared to popular algorithms. © 2022, The Authors. All rights reserved.

关键词： Constraint handling

来源：评论

学校读者我要写书评

暂无评论

On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering 14th

On Fixed-Order Book Thickness Parameterized by the Pathwidth...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Visual language Model based Cross-modal Semantic Communication Systems

arXiv

引用

arXiv 2024年

作者： Jiang, Feibo Tang, Chuanguo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China School of Information Science and Engineering Hunan Normal University Changsha China Changsha Social Laboratory of Artificial Intelligence Hunan University of Technology and Business Changsha China The Department of Computer Science Brunel University London United Kingdom The School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China

Semantic Communication (SC) has emerged as a novel communication paradigm in recent years, successfully transcending the Shannon physical capacity limits through innovative semantic transmission concepts. Nevertheless, extant Image Semantic Communication (ISC) systems face several challenges in dynamic environments, including low semantic density, catastrophic forgetting, and uncertain Signal-to-Noise Ratio (SNR). To address these challenges, we propose a novel Vision-language Model-based Cross-modal Semantic Communication (VLM-CSC) system. The VLM-CSC comprises three novel components: (1) Cross-modal Knowledge Base (CKB) is used to extract high-density textual semantics from the semantically sparse image at the transmitter and reconstruct the original image based on textual semantics at the receiver. The transmission of high-density semantics contributes to alleviating bandwidth pressure. (2) Memory-assisted Encoder and Decoder (MED) employ a hybrid long/short-term memory mechanism, enabling the semantic encoder and decoder to overcome catastrophic forgetting in dynamic environments when there is a drift in the distribution of semantic features. (3) Noise Attention Module (NAM) employs attention mechanisms to adaptively adjust the semantic coding and the channel coding based on SNR, ensuring the robustness of the CSC system. The experimental simulations validate the effectiveness, adaptability, and robustness of the CSC system. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

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

ISBN: (纸本)9781665429825

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.

关键词： Deep learning Image segmentation Breast tumors Ultrasonic imaging Semantics Feature extraction Visual effects

来源：评论

学校读者我要写书评

暂无评论

Small Object Detection via Precise Region-Based Fully Convolutional Networks

引用

Computers, Materials & Continua 2021年第11期69卷 1503-1517页

作者： Dengyong Zhang Jiawei Hu Feng Li Xiangling Ding Arun Kumar Sangaiah Victor SSheng Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha410114China School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China School of Computer Science and Engineering Hunan University of Science and TechnologyXiangtan411004China School of Computing Science and Engineering Vellore Institute of Technology(VIT)Vellore632014India Department of Computer Science Texas Tech UniversityLubbock79409TXUSA

In the past several years,remarkable achievements have been made in the field of object *** performance is generally improving,the accuracy of small object detection remains low compared with that of large object *** addition,localization misalignment issues are common for small objects,as seen in GoogLeNets and residual networks(ResNets).To address this problem,we propose an improved region-based fully convolutional network(R-FCN).The presented technique improves detection accuracy and eliminates localization misalignment by replacing positionsensitive region of interest(PS-RoI)pooling with position-sensitive precise region of interest(PS-Pr-RoI)pooling,which avoids coordinate quantization and directly calculates two-order integrals for position-sensitive score maps,thus preventing a loss of spatial precision.A validation experiment was conducted in which the Microsoft common objects in context(MS COCO)training dataset was *** showed an accuracy improvement of 3.7%for object detection tasks and an increase of 6.0%for small objects.

关键词： Small object detection precise R-FCN PS-Pr-RoI pooling two-stage detector

来源：评论

学校读者我要写书评

暂无评论

Reachable Distance Function for KNN Classification

arXiv

引用

arXiv 2021年

作者： Zhang, Shichao Li, Jiaye Li, Yangding School of Computer Science and Engineering Central South University Changsha410083 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

Distance function is a main metrics of measuring the affinity between two data points in machine learning. Extant distance functions often provide unreachable distance values in real applications. This can lead to incorrect measure of the affinity between data points. This paper proposes a reachable distance function for KNN classification. The reachable distance function is not a geometric direct-line distance between two data points. It gives a consideration to the class attribute of a training dataset when measuring the affinity between data points. Concretely speaking, the reachable distance between data points includes their class center distance and real distance. Its shape looks like "Z," and we also call it a Z distance function. In this way, the affinity between data points in the same class is always stronger than that in different classes. Or, the intraclass data points are always closer than those interclass data points. We evaluated the reachable distance with experiments, and demonstrated that the proposed distance function achieved better performance in KNN classification. © 2021, CC BY-NC-ND.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Lightweight Vision Model-based Multi-user Semantic Communication Systems

arXiv

引用

arXiv 2025年

作者： Jiang, Feibo Tu, Siwei Dong, Li Wang, Kezhi Yang, Kun Liu, Ruiqi Pan, Cunhua Wang, Jiangzhou Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Information Science and Engineering Hunan Normal University Changsha410081 China School of Computer Science Hunan University of Technology and Business Changsha410205 China Xiangjiang Laboratory Changsha410205 China Department of Computer Science Brunel University London United Kingdom School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China Wireless and Computing Research Institute ZTE Corporation Beijing100029 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China National Mobile Communications Research Laboratory Southeast University Nanjing China Purple Mountain Laboratories Nanjing China

Semantic Communication (SemCom) is a promising new paradigm for next-generation communication systems, emphasizing the transmission of core information, particularly in environments characterized by uncertainty, noise, and bandwidth constraints. However, existing image SemCom systems face several challenges, such as inefficient knowledge base construction, insufficient semantic encoding, and lack of multi-user semantic sharing. To address these issues, we propose a Lightweight Vision Model-based Multi-user Semantic Communication System (LVM-MSC). First, we construct a Lightweight Knowledge Base (LKB) based on the fast Segment Anything Model (SAM). LKB incorporates the extensive image knowledge of the SAM model while significantly reducing the number of parameters through its convolutional architecture. Next, we design an Efficient Semantic Codec (ESC) based on the Masked AutoEncoder (MAE) architecture. ESC enhances semantic compression at both the pixel and semantic levels and implements lightweight semantic decoding tailored for user devices. Furthermore, we propose a Multi-user Semantic Sharing (MSS) transmission for the multi-user SemCom. By calculating the similarity of semantic information among different users in the sharing semantic space, we unify the transmissions of similar semantic information through broadcasting, further improving the transmission efficiency. Finally, simulation results demonstrate the feasibility and effectiveness of the proposed LVM-MSC system. Copyright © 2025, The Authors. All rights reserved.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Clustering and Independent Competing Based Evolutionary Algorithm for Multimodal Multi-Objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2025年

作者： Zhong, keyu Xiao, Fen Gao, Xieping Hunan Normal University School of Mathematics and Statistics Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Changsha410081 China Xiangtan University School of Computer Science Xiangtan411105 China Hunan Normal University Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

The multimodal multi-objective optimization problem (MMOP) involves multiple distinct components of the Pareto set (PS), which correspond to the same Pareto front (PF). Most existing multimodal multi-objective evolutionary algorithms (MMOEAs) face challenges in achieving both accuracy and timeliness in solving MMOPs. In this article, a two-stage clustering and independent competing based evolutionary algorithm (TSCICEA) is proposed for solving MMOPs. Firstly, in the early stage of population evolution, the K-means technique is used to coarsely cluster the population into multiple independent subpopulations, which aims to rapidly ascertain the approximate distribution structure of modalities and preliminarily locate their spatial positions. In the later stage, the DBSCAN technique is utilized to conduct fine clustering of the population, which aims to re-cluster misclustered individuals in the coarse clustering into new subpopulations, thus achieving a precise distinction between different modalities. Subsequently, to accurately identify the corresponding modality for each subpopulation, an independent competing strategy is proposed. This strategy can automatically assign different identification approaches for each modality based on their differences, and it simultaneously manages different modalities through parallel execution, thus significantly enhancing both the accuracy and timeliness of modality identification. To evaluate the effectiveness of TSCICEA, we compare it against state-of-the-art algorithms on benchmark test problems with 2–15 objectives and 4–15 variables. Experimental results demonstrate that TSCICEA achieves superior performance in terms of the IEDRX, IMST, and HV indicators © 1997-2012 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Large AI Model-Based Semantic Communications

arXiv

引用

arXiv 2023年

作者： Jiang, Feibo Peng, Yubo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua You, Xiaohu Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China School of Information Science and Engineering Hunan Normal University Changsha China Changsha Social Laboratory of Artificial Intelligence Hunan University of Technology and Business Changsha China Department of Computer Science Brunel University London United Kingdom School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China

Semantic communication (SC) is an emerging intelligent paradigm, offering solutions for various future applications like metaverse, mixed reality, and the Internet of Everything. However, in current SC systems, the construction of the knowledge base (KB) faces several issues, including limited knowledge representation, frequent knowledge updates, and insecure knowledge sharing. Fortunately, the development of the large AI model (LAM) provides new solutions to overcome the above issues. Here, we propose a LAM-based SC framework (LAM-SC) specifically designed for image data, where we first apply the segment anything model (SAM)-based KB (SKB) that can split the original image into different semantic segments by universal semantic knowledge. Then, we present an attention-based semantic integration (ASI) to weigh the semantic segments generated by SKB without human participation and integrate them as the semanticaware image. Additionally, we propose an adaptive semantic compression (ASC) encoding to remove redundant information in semantic features, thereby reducing communication overhead. Finally, through simulations, we demonstrate the effectiveness of the LAM-SC framework and the possibility of applying the LAM-based KB in future SC paradigms. Copyright © 2023, The Authors. All rights reserved.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：