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

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Jiang, Zhihui Zhang, Qinghua Wang, Yutai School of Science Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China

ISBN: (纸本)9783031927430

In multi-attribute group decision making (MAGDM), it is important to deal with heterogeneous data and integrate the evaluation information from different decision makers (DMs). To more accurately capture the uncertain information in the real decision-making environment, a hybrid MAGDM method using normal cloud model (NCM) and multi-granularity information is proposed. First, utilizing the theta scaling method, multi-granularity linguistic term sets are established. Considering the exact numbers, interval numbers, multi-granularity linguistic terms, and multi-granularity linguistic expressions, the concept of multi-granularity information is further expanded. Second, these data with different granularity are uniformly converted into NCMs, which can simultaneously preserve both magnitude information and uncertainty information. Third, based on the internal consensus index (ICI) and the external consensus index (ECI), a novel group analytic hierarchy process (GAHP) method is proposed for calculating attribute weights. Finally, NCM-extended VIKOR method is proposed for ranking the alternatives. The flexibility and superiority of the proposed method are confirmed through a case study and comparisons with previous methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Linguistics

来源：评论

学校读者我要写书评

暂无评论

Last-X-Generation Archiving Strategy for Multi-Objective Evolutionary Algorithms 13

Last-X-Generation Archiving Strategy for Multi-Objective Evo...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Shu, Tianye Nan, Yang Shang, Ke Ishibuchi, Hisao Southern University of Science and Technology Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Department of Computer Science and Engineering Shenzhen518055 China Southern University of Science and Technology Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

ISBN: (纸本)9798350308365

For evolutionary multi-objective optimization algorithms (EMOAs), an external archive can be utilized for saving good solutions found throughout the evolutionary process. Recent studies showed that a solution set selected from an external archive is usually superior to the final population. That is, the incorporation of an external archive improves the performance of EMOAs. However, the computation time for maintaining an external archive is long, especially when the archive size is large. To solve this issue, a simple archiving strategy is to save all solutions generated in the last several generations. In this paper, we examine this archiving strategy for three representative EMOAs on artificial test problems (Minus-DTLZ and WFG) and real-world problems (RE). Our results show that archiving the last several generations clearly improves the performance of EMOAs without severely increasing the computation time. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Disentangled latent factors for muti-cause treatment effect estimation 6

Disentangled latent factors for muti-cause treatment effect ...

引用

2024 6th International Conference on Artificial Intelligence Technologies and Applications, ICAITA 2024

作者： Zhao, Zhuoyue Wang, Haotian Xu, Liyang Wang, Qian Tang, Yuhua Department of Intelligent Data Science National University of Defense Technology Changsha410073 China Intelligent Game and Decision Lab. Academy of Military Science Beijing100071 China Institute for Quantum Information State Key Laboratory of High-Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China

Existing methods estimate treatment effects from observational data and assume that covariates are all confounders. However, observed covariates may not directly represent confounding variables that influence both treatment and outcome. They always include variables that only affect the treatment or the outcome. In addition, for multi-dimensional binary treatments, disentangled methods are mainly designed for binary variables and ignore the impact of multi-cause treatment variables on the inference of latent factors. To address these two issues, based on variable decomposition and proxy inference, we propose the Disentangled Latent Factors for Multi-cause Treatment Estimation (DEMTE) algorithm. It utilizes an identifiable autoencoder to infer and disentangle latent factors based on the joint distribution of variables in observational data. DEMTE evaluates the treatment effect on the disentangled factors. Synthetic experiments and semi-synthetic experiments demonstrate the effectiveness of the inference and disentanglement techniques and our method achieves more accurate treatment effect estimation. © 2024 Institute of Physics Publishing. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Model-Agnostic Hierarchical Framework Towards Trajectory Prediction

引用

Journal of Computer science & Technology 2025年第2期40卷 322-339页

作者： Tang-Wen Qian Yuan Wang Yong-Jun Xu Zhao Zhang Lin Wu Qiang Qiu Fei Wang Domain-Oriented Intelligent System Research Center Institute of Computing TechnologyChinese Academy of Sciences Beijing 100190China University of Chinese Academy of Sciences Beijing 100190China CAS Key Laboratory of Network Data Science and Technology Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China

Predicting the future trajectories of multiple agents is essential for various applications in real life,such as surveillance systems,autonomous driving,and social *** trajectory prediction task is influenced by many factors,including the individual historical trajectory,interactions between agents,and the fuzzy nature of the observed agents’*** existing methods have made great progress on the topic of trajectory prediction,they treat all the information uniformly,which limits the effectiveness of information *** this end,in this paper,we propose and utilize a model-agnostic framework to regard all the information in a two-level hierarchical ***,the first-level view is the inter-trajectory *** this level,we observe that the difficulty in predicting different trajectory samples *** define trajectory difficulty and train the proposed framework in an“easy-to-hard”*** second-level view is the intra-trajectory *** find the influencing factors for a particular trajectory can be divided into two *** first part is global features,which keep stable within a trajectory,i.e.,the expected *** second part is local features,which change over time,i.e.,the current *** believe that the two types of information should be handled in different *** hierarchical view is beneficial to take full advantage of the information in a fine-grained *** results validate the effectiveness of the proposed model-agnostic framework.

关键词： spatial-temporal data mining trajectory prediction hierarchical framework model-agnostic

来源：评论

学校读者我要写书评

暂无评论

Set pair three-way overlapping community discovery algorithm for weighted social internet of things

引用

Digital Communications and Networks 2023年第1期9卷 3-13页

作者： Chunying Zhang Jing Ren Lu Liu Shouyue Liu Xiaoqi Li Liya Wang College of Science North China University of Science and TechnologyTangshanHebeiChina Hebei Engineering Research Center for the Intelligentization of Iron Ore Optimization and Ironmaking Raw Materials Preparation Processes North China University of Science and TechnologyTangshanHebeiChina Hebei Key Laboratory of Data Science and Application North China University of Science and TechnologyTangshanHebeiChina The Key Laboratory of Engineering Computing in Tangshan City North China University of Science and TechnologyTangshanHebeiChina Tangshan Intelligent Industry and Image Processing Technology Innovation Center North China University of Science and TechnologyTangshanHebeiChina

There are many problems in Social Internet of Things(IoTs),such as complex topology information,different degree of association between nodes and overlapping *** idea of set pair information grain computing and clustering is introduced to solve the above problems so as to accurately describe the similarity between nodes and fully explore the multi-community structure.A Set Pair Three-Way Overlapping Community Discovery Algorithm for Weighted Social Internet of Things(WSIoT-SPTOCD)is *** the local network structure,which fully considers the topological information between nodes,the set pair connection degree is used to analyze the identity,difference and reverse of neighbor *** similarity degree of different neighbor nodes is defined from network edge weight and node degree,and the similarity measurement method of set pair between nodes based on the local information structure is *** to the number of nodes'neighbors and the connection degree of adjacent edges,the clustering intensity of nodes is defined,and an improved algorithm for initial value selection of k-means is *** nodes are allocated according to the set pair similarity between nodes and different ***-way community structures composed of a positive domain,boundary domain and negative domain are generated ***,the overlapping node set is generated according to the calculation results of community node ***,experiments are carried out on artificial networks and real *** results show that WSIoT-SPTOCD performs well in terms of standardized mutual information,overlapping community modularity and F1.

关键词： Social internet of things Set pair analysis K-means Local information structure Overlapping community

来源：评论

学校读者我要写书评

暂无评论

DFGET: Displacement-Field Assisted Graph Energy Transmitter for Gland Instance Segmentation 17

DFGET: Displacement-Field Assisted Graph Energy Transmitter ...

引用

17th IEEE International Conference on Signal Processing, ICSP 2024

作者： Jian, Caiqing Qin, Yongbin Wang, Lihui Ye, Chen Cheng, Xinyu Guizhou University Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang China

ISBN: (纸本)9798350387384

Gland instance segmentation is an essential but challenging task in the diagnosis of adenocarcinoma. The existing models usually achieve gland instance segmentation through multi-task learning and boundary loss constraint. However, how to deal with the problems of gland adhesion and inaccurate boundary in segmenting the complex samples remains a challenge. In this work, we propose a novel geometric feature named displacement field (DF), which can represent the geometric information such as shape, size, and orientation of the glands. Based on the explicit constraint of DF, a displacement-field assisted graph energy transmitter (DFGET) framework is proposed for solving the above problems. Using such graph framework, the gland semantic segmentation map and the displacement field of the graph nodes are estimated with two graph network branches. With the constraint of DF, a graph cluster module is presented to improve the intra-class feature consistency and inter-class feature discrepancy, as well as to separate the adherent glands. Extensive comparison and ablation experiments on the GlaS dataset demonstrate the effectiveness of the displacement field and the superiority of DFGET. Compared to the best comparative model, DFGET increases the object-Dice and object-F1 score by 2.27% and 3.11% respectively, while decreases the object-HD by 15.58, achieving state-of-the-art performance, which indicates that DFGET can serve as an auxiliary tool for the diagnosis of adenocarcinoma. © 2024 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

User-Level Large Scale Load Forecasting Based on GPU 9

User-Level Large Scale Load Forecasting Based on GPU

引用

9th Annual International Conference on Network and Information Systems for Computers, ICNISC 2023

作者： Qi, Jinshan Wang, Jiangtao Liang, Xun Xu, Zhiming Huaiyin Normal University Huai'an Key Laboratory of Big Data Intelligent Computing and Analysis School of Computer Science and Technology Huai'an China Renmin University of China School of Information Beijing China

ISBN: (纸本)9798350306682

Load forecasting is an essential part in power system management and planning. In recent years, more and more researchers started to focus on the behavior of terminal customers, trying to improve the accuracy of load forecasting. This paper proposes to use the neuron network model to predict each user's load first, and then aggregate all the forecasting results to get higher-level prediction. In order to speed up the process, we also design a model based on CUDA. We conducted several experiments on real-world data (160 thousand consumers' load profiles) and the results confirm the effectiveness and efficiency of our method. © 2023 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

DMHFR:Decoder with Multi-Head Feature Receptors for Tract Image Segmentation

引用

Computers, Materials & Continua 2025年第3期82卷 4841-4862页

作者： Jianuo Huang Bohan Lai Weiye Qiu Caixu Xu Jie He Department of Endoscopy Center Zhongshan Hospital(Xiamen)Fudan UniversityXiamen361015China School of Computing and Data Science Xiamen University MalaysiaSepang43900Malaysia School of Computer Science and Techonology Tongji UniversityShanghai200092China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou UniversityWuzhou543002China Xiamen Clinical Research Center for Cancer Therapy Xiamen361015China

The self-attention mechanism of Transformers,which captures long-range contextual information,has demonstrated significant potential in image ***,their ability to learn local,contextual relationships between pixels requires further *** methods face challenges in efficiently managing multi-scale fea-tures of different granularities from the encoder backbone,leaving room for improvement in their global representation and feature extraction *** address these challenges,we propose a novel Decoder with Multi-Head Feature Receptors(DMHFR),which receives multi-scale features from the encoder backbone and organizes them into three feature groups with different granularities:coarse,fine-grained,and full *** groups are subsequently processed by Multi-Head Feature Receptors(MHFRs)after feature capture and modeling *** include two Three-Head Feature Receptors(THFRs)and one Four-Head Feature Receptor(FHFR).Each group of features is passed through these MHFRs and then fed into axial transformers,which help the model capture long-range dependencies within the *** three MHFRs produce three distinct feature *** output from the FHFR serves as auxiliary auxiliary features in the prediction head,and the prediction output and their losses will eventually be *** results show that the Transformer using DMHFR outperforms 15 state of the arts(SOTA)methods on five public ***,it achieved significant improvements in mean DICE scores over the classic Parallel Reverse Attention Network(PraNet)method,with gains of 4.1%,2.2%,1.4%,8.9%,and 16.3%on the CVC-ClinicDB,Kvasir-SEG,CVC-T,CVC-ColonDB,and ETIS-LaribPolypDB datasets,respectively.

关键词： Medical image segmentation feature exploration feature aggregation deep learning multi-head feature receptor

来源：评论

学校读者我要写书评

暂无评论

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation 38

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmenta...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization techniques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is available at https://***/boyuh/AUCSeg. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hypertensive Pulse Diagnosis Method Based on Hilbert-Huang Transform and Feature Fusion Dimensionality Reduction 5

Hypertensive Pulse Diagnosis Method Based on Hilbert-Huang T...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Fan, Lin Yao, Ruiling Wang, Zhongmin School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi 'An Key Laboratory of Big Data and Intelligent Computing China School of Computer Science and Technology Xi'an University of Posts and Telecommunications China

ISBN: (纸本)9781450396899

With the development of artificial intelligence, pulse diagnosis has been standardized and objectified. However, there is a lack of research on the extraction and dimensionality reduction of hypertensive pulse features. We propose two effective features for distinguishing pulses of disease samples and a fusion dimensionality reduction method that combines linear and nonlinear dimensionality reduction. The results show that the proposed features and dimensionality reduction method make the classification accuracy of hypertension pulse feature reach 94.23%, and the training time of the classifier is reduced by 47 seconds, which improves the performance in terms of both accuracy and time. © 2022 ACM.

关键词： Hilbert-Huang transform

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：