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

arxiv 2024年

作者： Luo, Nanfang Zhang, Qinghua xie, Qin Wang, Yutai Yin, Longjun Wang, Guoyin Chongqing Key Laboratory of Tourism Multisource Data Perception and Decision Ministry of Culture and Tourism Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China College of Computer and Information Science Chongqing Normal University Chongqing401331 China

Group decision-making (GDM) characterized by complexity and uncertainty is an essential part of various life scenarios. Most existing researches lack tools to fuse information quickly and interpret decision results for partially formed decisions. This limitation is particularly noticeable when there is a need to improve the efficiency of GDM. To address this issue, a novel multi-level sequential three-way decision for group decision-making (S3W-GDM) method is constructed from the perspective of granular computing. This method simultaneously considers the vagueness, hesitation, and variation of GDM problems under double hierarchy hesitant fuzzy linguistic term sets (DHHFLTS) environment. First, for fusing information efficiently, a novel multi-level expert information fusion method is proposed, and the concepts of expert decision table and the extraction/aggregation of decision-leveled information based on the multi-level granularity are defined. Second, the neighborhood theory, outranking relation and regret theory (RT) are utilized to redesign the calculations of conditional probability and relative loss function. Then, the granular structure of DHHFLTS based on the sequential three-way decision (S3WD) is defined to improve the decision-making efficiency, and the decision-making strategy and interpretation of each decision-level are proposed. Furthermore, the algorithm of S3W-GDM is given. Finally, an illustrative example of diagnosis is presented, and the comparative and sensitivity analysis with other methods are performed to verify the efficiency and rationality of the proposed method. © 2024, CC BY.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Martingale Stopping Rule Application in Bayesian A/B Testing With Batch data

引用

IEEE Access 2025年 13卷 100462-100478页

作者： Yali Wang Haiyan Yu Ching-Chi Yang Ronggui Zhang School of Management Huazhong University of Science and Technology Wuhan Hubei China School of Economics and Management Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing China Chongqing Big Data Research Institute Peking University Chongqing China Department of Mathematical Sciences The University of Memphis Memphis TN USA Chongqing Key Laboratory of Emergency Medicine Chongqing Emergency Medical Center Chongqing University Central Hospital School of Medicine Chongqing University Chongqing China NHC Key Laboratory of Birth Defects and Reproductive Health Chongqing Population and Family Planning Science and Technology Research Institute Chongqing China

Continuous monitoring in A/B testing is widely used for selecting options, variants, or treatments in healthcare analytics. However, the appropriate stopping strategy for A/B testing in continuous monitoring remains unclear. This study proposes a Bayesian A/B testing method for continuous monitoring, incorporating a martingale stopping strategy. A uniform Beta distribution is used as the prior in the Bayesian A/B testing method. The posterior expected loss is employed as the criterion for choosing an option. When the posterior expected loss falls below a preset threshold, the result of the continuous monitoring is accepted for the A/B testing. With the proposed method, continuous monitoring of the null hypothesis (that the conversion rate of A is less than that of B) is managed using the posterior expected loss. The results obtained using the martingale stopping strategy enhance the interpretability of the A/B testing process. Finally, the effectiveness of the Bayesian A/B testing method is validated through numerical experiments on both simulated data and real-world applications.

关键词： Testing Bayes methods Monitoring Convergence Standards Decision making Posterior probability Stochastic processes Statistical analysis Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Congress on Evolutionary Computation

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

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

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.

关键词： Costs Sociology Evolutionary computation Statistics Optimization Standards

来源：评论

学校读者我要写书评

暂无评论

Fast Intra Mode Prediction Algorithms for SCBS in VVC SCC

Fast Intra Mode Prediction Algorithms for SCBS in VVC SCC

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Dayong Wang Yishen Deng Weisheng Li xin Lu Frederic Dufaux Bo Hang Ce Zhu Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Faculty of Computing Engineering and Media (CEM) De Montfort University Université Paris-Saclay CNRS CentraleSupélec Laboratoire des Signaux et systèmes The Computer School Hubei University of Arts and Science School of Information and Communication Engineering University of Electronic Science and Technology of China

Versatile Video Coding (VVC) now supports Screen Content Coding (SCC) by integrating two efficient coding modes: Intra Block Copy (IBC) and Palette (PLT). However, the numerous modes and the Quad-Tree Plus Multi-Type Tree (QTMT) structure inherent to VVC contribute to a very high coding complexity. To effectively reduce the computational complexity of VVC SCC, we propose a fast Intra mode prediction algorithm for VVC SCC. More specifically, we first use the difference of minimum Sum of Absolute Transformed Differences (SATD) value of four Directional Modes (DMs) of Intra and the SATD value of the IBC-merge mode to determine whether to early skip Intra checking. Subsequently, we use a decision tree to determine whether to early terminate the checking after block differential pulse coded modulation (BDPCM). Finally, we employ a decision tree to determine whether to early skip multiple transform selection (MTS) and low frequency non-separable transform (LFNST) checking. The results demonstrate that our algorithm achieves an average encoding time reduction of 34.34% with a negligible Bjøntegaard delta bitrate increase of 0.46%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

从信号到知识——基于人工智能的医学影像裸数据诊断价值初探

引用

Engineering 2024年第3期34卷 60-69页

作者： Bingxi He Yu Guo Yongbei Zhu Lixia Tong Boyu Kong Kun Wang Caixia Sun Hailin Li Feng Huang Liwei Wu Meng Wang Fanyang Meng Le Dou Kai Sun Tong Tong Zhenyu Liu Ziqi Wei Wei Mu Shuo Wang Zhenchao Tang Shuaitong Zhang Jingwei Wei Lizhi Shao Mengjie Fang Juntao Li Shouping Zhu Lili Zhou Shuo Wang Di Dong Huimao Zhang Jie Tian Beijing Advanced Innovation Center for Big Data-Based Precision Medicine School of Engineering MedicineBeihang UniversityBeijing 100191China Key Laboratory of Big Data-Based Precision Medicine Beihang UniversityMinistry of Industry and Information TechnologyBeijing 100191China CAS Key Laboratory of Molecular Imaging Institute of AutomationChinese Academy of SciencesBeijing 100190China Department of Radiology The First Hospital of Jilin UniversityChangchun 130021China Neusoft Medical Systems Co.Ltd. Shenyang 110167China Neusoft Research of Intelligent Healthcare Technology Co.Ltd. Shenyang 110167China School of Life Science and Technology Xidian UniversityXi’an 710126China Engineering Research Center of Molecular and Neuro Imaging Ministry of EducationXi’an 710126China School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 100049China

Encouraging and astonishing developments have recently been achieved in image-based diagnostic *** medical care and imaging technology are becoming increasingly ***,the current diagnosis pattern of signal to image to knowledge inevitably leads to information distortion and noise introduction in the procedure of image reconstruction(from signal to image).Artificial intelligence(AI)technologies that can mine knowledge from vast amounts of data offer opportunities to disrupt established *** this prospective study,for the first time,we develop an AI-based signal-toknowledge diagnostic scheme for lung nodule classification directly from the computed tomography(CT)raw data(the signal).We find that the raw data achieves almost comparable performance with CT,indicating that it is possible to diagnose diseases without reconstructing ***,the incorporation of raw data through three common convolutional network structures greatly improves the performance of the CT models in all cohorts(with a gain ranging from 0.01 to 0.12),demonstrating that raw data contains diagnostic information that CT does not *** results break new ground and demonstrate the potential for direct signal-to-knowledge domain analysis.

关键词： Computed tomography Diagnosis Deep learning Lung cancer Raw data

来源：评论

学校读者我要写书评

暂无评论

Channel and space-based joint rate allocation algorithm

Channel and space-based joint rate allocation algorithm

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Dayong Wang Chao Yuan Yu Sun xin Lu Hui Guo Frederic Dufaux Ce Zhu Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications China Department of Computer Science University of Central Arkansas Faculty of Computing Engineering and Media (CEM) De Montfort University UK Université Paris-Saclay CNRS CentraleSupélec Laboratoire Des Signaux et Systèmes France School of Information and Communication Engineering University of Electronic Science and Technology of China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Rate control is a critical component for image and video compression Particularly under limited network bandwidth conditions, bitrate control is essential to ensure efficient image transmission by effectively allocation channel resources. In this research, since both Channel and Spatial have relationship with rate allocation, we first propose a joint Channel-wise and Spatial-wise Quantization scheme to determine optimal quantization parameters. Subsequently, we develop a quantization step estimation network to obtain parameters to efficiently allocate rate according to target rate. Experiments demonstrate that our algorithm significantly improve compressed image quality with minimal bitrate distortion and achieve accurate rate control with nearly 3% average bitrate error.

关键词： Image quality Quantization (signal) Image coding Bit rate Signal processing algorithms Estimation Rate-distortion Video compression Resource management Speech processing

来源：评论

学校读者我要写书评

暂无评论

A Low-rank Matching Attention based Cross-modal Feature Fusion Method for Conversational Emotion Recognition

arXiv

引用

arxiv 2023年

作者： Shou, Yuntao Liu, Huan Cao, xiangyong Meng, Deyu Dong, Bo School of Computer Science and Technology The Ministry of Education Key Laboratory for Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong Shaanxi Xi’an710049 China School of Computer Science and Technology Xi’an Jiaotong Shaanxi Xi’an710049 China The BigKE Joint Innovation Center SHMEEA Shanghai China School of Mathematics and Statistics Xi’an Jiaotong University Xi’an China

Conversational emotion recognition (CER) is an important research topic in human-computer interactions. Although recent advancements in transformer-based cross-modal fusion methods have shown promise in CER tasks, they tend to overlook the crucial intra-modal and inter-modal emotional interaction or suffer from high computational complexity. To address this, we introduce a novel and lightweight cross-modal feature fusion method called Low-Rank Matching Attention Method (LMAM). LMAM effectively captures contextual emotional semantic information in conversations while mitigating the quadratic complexity issue caused by the self-attention mechanism. Specifically, by setting a matching weight and calculating inter-modal features attention scores row by row, LMAM requires only one-third of the parameters of self-attention methods. We also employ the low-rank decomposition method on the weights to further reduce the number of parameters in LMAM. As a result, LMAM offers a lightweight model while avoiding overfitting problems caused by a large number of parameters. Moreover, LMAM is able to fully exploit the intra-modal emotional contextual information within each modality and integrates complementary emotional semantic information across modalities by computing and fusing similarities of intra-modal and inter-modal features simultaneously. Experimental results verify the superiority of LMAM compared with other popular cross-modal fusion methods on the premise of being more lightweight. Also, LMAM can be embedded into any existing state-of-the-art CER methods in a plug-and-play manner, and can be applied to other multi-modal recognition tasks, e.g., session recommendation and humour detection, demonstrating its remarkable generalization ability. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

arxiv 2023年

作者： Jian, Caiqing Qin, Yongbin Wang, Lihui 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 Guizhou University Guiyang550025 China

Gland instance segmentation is an essential but challenging task in the diagnosis and treatment 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 displacement-field assisted graph energy transmitter (DFGET) framework to solve these problems. Specifically, a novel message passing manner based on anisotropic diffusion is developed to update the node features, which can distinguish the isomorphic graphs and improve the expressivity of graph nodes for complex samples. Using such graph framework, the gland semantic segmentation map and the displacement field (DF) of the graph nodes are estimated with two graph network branches. With the constraint of DF, a graph cluster module based on diffusion theory is presented to improve the intra-class feature consistency and inter-class feature discrepancy, as well as to separate the adherent glands from the semantic segmentation maps. Extensive comparison and ablation experiments on the GlaS dataset demonstrate the superiority of DFGET and effectiveness of the proposed anisotropic message passing manner and clustering method. Compared to the best comparative model, DFGET increases the object-Dice and object-F1 score by 2.5% and 3.4% respectively, while decreases the object-HD by 32.4%, achieving state-of-the-art performance. © 2023, CC BY-NC-ND.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

LLM Knows Geometry Better than Algebra: Numerical Understanding of LLM-Based Agents in A Trading Arena

arXiv

引用

arxiv 2025年

作者： Ma, Tianmi Du, Jiawei Huang, Wenxin Wang, Wenjie xie, Liang Zhong, xian Zhou, Joey Tianyi Hubei Key Laboratory of Transportation Internet of Things Wuhan University of Technology China Hubei Key Laboratory of Big Data Intelligent Analysis and Application Hubei University China Centre for Frontier AI Research Agency for Science Technology and Research Singapore Institute of High Performance Computing Agency for Science Technology and Research Singapore School of Computing National University of Singapore Singapore School of Science Wuhan University of Technology China

Recent advancements in large language models (LLMs) have significantly improved performance in natural language processing tasks. However, their ability to generalize to dynamic, unseen tasks, particularly in numerical reasoning, remains a challenge. Existing benchmarks mainly evaluate LLMs on problems with predefined optimal solutions, which may not align with real-world scenarios where clear answers are absent. To bridge this gap, we design the Agent Trading Arena, a virtual numerical game simulating complex economic systems through zero-sum games, where agents invest in stock portfolios. Our experiments reveal that LLMs, including GPT-4o, struggle with algebraic reasoning when dealing with plain-text stock data, often focusing on local details rather than global trends. In contrast, LLMs perform significantly better with geometric reasoning when presented with visual data, such as scatter plots or K-line charts, suggesting that visual representations enhance numerical reasoning. This capability is further improved by incorporating the reflection module, which aids in the analysis and interpretation of complex data. We validate our findings on NASDAQ STOCK dataset, where LLMs demonstrate stronger reasoning with visual data compared to text. Our code and data are publicly available at https://***/wekjsdvnm/***. © 2025, CC BY.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

arXiv

引用

arxiv 2024年

作者： Zhong, Luying Pi, Yueyang Chen, Zheyi Yu, Zhengxin Miao, Wang Chen, xing Min, Geyong College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster United Kingdom School of Engineering Computing and Mathematics University of Plymouth United Kingdom Department of Computer Science University of Exeter United Kingdom

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：