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

arXiv 2023年

作者： Lou, Wei Wan, Xiang Li, Guanbin Lou, Xiaoying Li, Chenghang Gao, Feng Li, Haofeng Shenzhen Research Institute of Big Data Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong at Shenzhen Shenzhen518172 China Pazhou Lab Guangzhou510330 China The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China Department of Pathology Guangdong Provincial Key Laboratory of Colorectal and Pelvic Floor Diseases The Sixth Affiliated Hospital of Sun Yat-sen University Guangzhou China Artificial Intelligence Thrust The Hong Kong University of Science and Technology at Guangzhou Guangzhou510030 China Department of Colorectal Surgery Department of General Surgery Guangdong Provincial Key Laboratory of Colorectal and Pelvic Floor Diseases The Sixth Affiliated Hospital Sun Yat-sen University Guangzhou510655 China Shanghai Artificial Intelligence Laboratory Shanghai China

Nuclei classification provides valuable information for histopathology image analysis. However, the large variations in the appearance of different nuclei types cause difficulties in identifying nuclei. Most neural network based methods are affected by the local receptive field of convolutions, and pay less attention to the spatial distribution of nuclei or the irregular contour shape of a nucleus. In this paper, we first propose a novel polygon-structure feature learning mechanism that transforms a nucleus contour into a sequence of points sampled in order, and employ a recurrent neural network that aggregates the sequential change in distance between key points to obtain learnable shape features. Next, we convert a histopathology image into a graph structure with nuclei as nodes, and build a graph neural network to embed the spatial distribution of nuclei into their representations. To capture the correlations between the categories of nuclei and their surrounding tissue patterns, we further introduce edge features that are defined as the background textures between adjacent nuclei. Lastly, we integrate both polygon and graph structure learning mechanisms into a whole framework that can extract intra and inter-nucleus structural characteristics for nuclei classification. Experimental results show that the proposed framework achieves significant improvements compared to the state-of-the-art methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Secrets Behind Advanced Artificial Intelligence Language Models in Deidentifying Chinese-English Mixed Clinical Text: Development and Validation Study

引用

Journal of Medical Internet Research 2024年第1期26卷 e48443页

作者： Lee, You-Qian Chen, Ching-Tai Chen, Chien-Chang Lee, Chung-Hong Chen, Peitsz Wu, Chi-Shin Dai, Hong-Jie Dialogue System Technical Department Asustek Computer Inc Taipei Taiwan Intelligent System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Bioinformatics and Medical Engineering Asia University Taichung Taiwan Center for Precision Health Research Asia University Taichung Taiwan Electromagnetic Sensing Control and AI Computing System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Knowledge Discovery and Data Mining Lab Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Chemical Engineering Feng Chia University Taichung Taiwan National Center for Geriatrics and Welfare Research National Health Research Institutes Zhunan Taiwan National Institute of Cancer Research National Health Research Institutes Tainan Taiwan School of Post-Baccalaureate Medicine College of Medicine Kaohsiung Medical University Kaohsiung Taiwan Center for Big Data Research Kaohsiung Medical University Kaohsiung Taiwan

Background: The widespread use of electronic health records in the clinical and biomedical fields makes the removal of protected health information (PHI) essential to maintain privacy. However, a significant portion of information is recorded in unstructured textual forms, posing a challenge for deidentification. In multilingual countries, medical records could be written in a mixture of more than one language, referred to as code mixing. Most current clinical natural language processing techniques are designed for monolingual text, and there is a need to address the deidentification of code-mixed text. Objective: The aim of this study was to investigate the effectiveness and underlying mechanism of fine-tuned pretrained language models (PLMs) in identifying PHI in the code-mixed context. Additionally, we aimed to evaluate the potential of prompting large language models (LLMs) for recognizing PHI in a zero-shot manner. Methods: We compiled the first clinical code-mixed deidentification data set consisting of text written in Chinese and English. We explored the effectiveness of fine-tuned PLMs for recognizing PHI in code-mixed content, with a focus on whether PLMs exploit naming regularity and mention coverage to achieve superior performance, by probing the developed models’ outputs to examine their decision-making process. Furthermore, we investigated the potential of prompt-based in-context learning of LLMs for recognizing PHI in code-mixed text. Results: The developed methods were evaluated on a code-mixed deidentification corpus of 1700 discharge summaries. We observed that different PHI types had preferences in their occurrences within the different types of language-mixed sentences, and PLMs could effectively recognize PHI by exploiting the learned name regularity. However, the models may exhibit suboptimal results when regularity is weak or mentions contain unknown words that the representations cannot generate well. We also found that the availability of cod

关键词： ChatGPT code mixing deidentification electronic health record large language model pretrained language model

来源：评论

学校读者我要写书评

暂无评论

Joint Compression and Deadline Optimization for Wireless Federated Learning

arXiv

引用

arXiv 2023年

作者： Zhang, Maojun Li, Yang Liu, Dongzhu Jin, Richeng Zhu, Guangxu Zhong, Caijun Quek, Tony Q.S. The College of information Science and Electronic Engineering Zhejiang University Hangzhou China China Academy of Information and Communications Technology Beijing China School of Computing Science University of Glasgow United Kingdom The Department of Information and Communication Engineering Zhejiang University Hangzhou310007 China The Zhejiang–Singapore Innovation and AI Joint Research Lab Hangzhou310007 China Hangzhou310007 China The Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China The Peng Cheng Laboratory Guangdong Shenzhen518055 China Guangdong Guangzhou510555 China The Singapore University of Technology and Design Singapore487372 Singapore

Federated edge learning (FEEL) is a popular distributed learning framework for privacy-preserving at the edge, in which densely distributed edge devices periodically exchange model-updates with the server to complete the global model training. Due to limited bandwidth and uncertain wireless environment, FEEL may impose heavy burden to the current communication system. In addition, under the common FEEL framework, the server needs to wait for the slowest device to complete the update uploading before starting the aggregation process, leading to the straggler issue that causes prolonged communication time. In this paper, we propose to accelerate FEEL from two aspects: i.e., 1) performing data compression on the edge devices and 2) setting a deadline on the edge server to exclude the straggler devices. However, undesired gradient compression errors and transmission outage are introduced by the aforementioned operations respectively, affecting the convergence of FEEL as well. In view of these practical issues, we formulate a training time minimization problem, with the compression ratio and deadline to be optimized. To this end, an asymptotically unbiased aggregation scheme is first proposed to ensure zero optimality gap after convergence, and the impact of compression error and transmission outage on the overall training time are quantified through convergence analysis. Then, the formulated problem is solved in an alternating manner, based on which, the novel joint compression and deadline optimization (JCDO) algorithm is derived. Numerical experiments for different use cases in FEEL including image classification and autonomous driving show that the proposed method is nearly 30X faster than the vanilla FedSGD algorithm, and outperforms the state-of-the-art schemes. © 2023, CC BY.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Multi-User Probabilistic Semantic Communication with Semantic Compression Ratio Optimization

Multi-User Probabilistic Semantic Communication with Semanti...

引用

IEEE International Conference on Communications Workshops, ICC

作者： Zhouxiang Zhao Zhaohui Yang Mingzhe Chen Changsheng You Qianqian Yang Wei Xu Zhaoyang Zhang College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China National Mobile Communications Research Laboratory Southeast University Nanjing China

ISBN: (数字)9798350304053

ISBN: (纸本)9798350304060

In this paper, the problem of joint transmission and computation resource allocation for a multi-user probabilistic semantic communication (PSC) network is investigated. In the considered model, users employ semantic information extraction techniques to compress their large-sized raw data before transmitting them to a multi-antenna base station (BS). Our model represents the raw data through comprehensive knowledge graphs, utilizing shared probability graphs between users and the BS for efficient semantic compression. The resource allocation problem is formulated as an optimization problem with the objective of maximizing the sum of equivalent rate of all users, considering total power budget constraint. This joint optimization problem inherently addresses the delicate balance between transmission efficiency and computational complexity. To address this optimization challenge, we present an iterative algorithm in which the optimal solution for the semantic compression ratio of a specific user is determined at each iteration. Numerical results validate the effectiveness of the proposed scheme.

关键词： Conferences Computational modeling Semantics Knowledge graphs Probabilistic logic Information retrieval data models

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Semantic Relay Aided Wireless Networks with Probability Graph

Resource Allocation for Semantic Relay Aided Wireless Networ...

引用

IEEE International Conference on Communications (ICC)

作者： Jiahui Zhao Ming Chen Zhaohui Yang Changsheng You Mingzhe Chen National Mobile Communications Research Laboratory Southeast University Nanjing China College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

In this paper, we introduce a novel uplink semantic relay (SemRelay)-aided wireless communication system, catering to multiple users by leveraging a shared probability graph between the SemRelay and the base station (BS). In this system, users transmit text information to the SemRelay through conventional bit transmission, and the SemRelay compresses this information using a knowledge based characterized by probability graph before transmitting it to the BS through semantic communication. Then, the BS recovers the information based on the shared probability graph. While the semantic information compression incurs computational resource consumption, it significantly reduces communication resource usage. This paper addresses the challenge of minimizing overall system latency through jointly optimizing communication and computation re-source allocation, considering limited wireless resources and the system's energy budget. To address this problem, we introduce an efficient iterative algorithm, which employs block coordinate descent for communication resource allocation and exhaustive searching for determining the optimal data compression scheme. In particular, both power allocation subproblem and bandwidth allocation subproblem are proved to be convex. The complexity analysis of the proposed algorithm are also provided. Numerical results validate the effectiveness of the proposed algorithm and the superior performance of semantic communication compared to the conventional bit transmission.

关键词： Wireless networks Semantics Knowledge based systems data compression Search problems Complexity theory Resource management

来源：评论

学校读者我要写书评

暂无评论

Coherent H ∞ control for Markovian jump linear quantum systems

引用

IFAC-PapersOnLine 2020年第2期53卷 269-274页

作者： Yanan Liu Daoyi Dong Ian R. Petersen Qing Gao Steven X. Ding Hidehiro Yonezawa School of Engineering and Information Technology University of New South Wales Canberra ACT 2600 Australia Center for Quantum Computation and Communication Technology Australian Research Council Canberra ACT 2600 Australia Institute for Automatic Control and Complex Systems (AKS) University of Duisburg-Essen. 47057 Duisburg Germany Research School of Electrical Energy and Materials Engineering The Australian National University Canberra ACT 2601 Australia School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing and also with Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing 100191 China

The purpose of this paper is to design a coherent feedback controller for a Markovian jump linear quantum system suffering from a fault signal. The control objective is to bound the effect of the disturbance input on the output for the time-varying quantum system. We prove the relation between the H ∞ control problem, the dissipation properties, and the solutions of Riccati differential equations, by which the H ∞ controller of the Markovian jump linear quantum system is given by the solutions of Linear Matrix Inequalities (LMIs).

关键词： Coherent quantum feedback H∞ control fault-tolerant control Markovian jump linear quantum systems

来源：评论

学校读者我要写书评

暂无评论

The minority matters: a diversity-promoting collaborative metric learning algorithm 22

The minority matters: a diversity-promoting collaborative me...

引用

Proceedings of the 36th International Conference on Neural Information Processing systems

作者： Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang State Key Laboratory of Information Security Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Laboratory of Big Data Mining and Knowledge Management CAS and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a Diversity Control Regularization Scheme (DCRS) to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AdAUC: End-to-end Adversarial AUC Optimization Against Long-tail Problems

arXiv

引用

arXiv 2022年

作者： Hou, Wenzheng Xu, Qianqian Yang, Zhiyong Bao, Shilong He, Yuan Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Alibaba Group Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen China

It is well-known that deep learning models are vulnerable to adversarial examples. Existing studies of adversarial training have made great progress against this challenge. As a typical trait, they often assume that the class distribution is overall balanced. However, long-tail datasets are ubiquitous in a wide spectrum of applications, where the amount of head class instances is larger than the tail classes. Under such a scenario, AUC is a much more reasonable metric than accuracy since it is insensitive toward class distribution. Motivated by this, we present an early trial to explore adversarial training methods to optimize AUC. The main challenge lies in that the positive and negative examples are tightly coupled in the objective function. As a direct result, one cannot generate adversarial examples without a full scan of the dataset. To address this issue, based on a concavity regularization scheme, we reformulate the AUC optimization problem as a saddle point problem, where the objective becomes an instance-wise function. This leads to an end-to-end training protocol. Furthermore, we provide a convergence guarantee of the proposed algorithm. Our analysis differs from the existing studies since the algorithm is asked to generate adversarial examples by calculating the gradient of a min-max problem. Finally, the extensive experimental results show the performance and robustness of our algorithm in three long-tail datasets. © 2022, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm

arXiv

引用

arXiv 2022年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China 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 Alibaba Group China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China Peng Cheng Laboratory China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a diversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML. © 2022, CC BY-NC-SA.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features

arXiv

引用

arXiv 2024年

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at this url. © 2024, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：