Alert button
Picture for Nan Wu

Nan Wu

Alert button

Zero-shot information extraction from radiological reports using ChatGPT

Sep 07, 2023
Danqing Hu, Bing Liu, Xiaofeng Zhu, Xudong Lu, Nan Wu

Figure 1 for Zero-shot information extraction from radiological reports using ChatGPT
Figure 2 for Zero-shot information extraction from radiological reports using ChatGPT
Figure 3 for Zero-shot information extraction from radiological reports using ChatGPT
Figure 4 for Zero-shot information extraction from radiological reports using ChatGPT

Electronic health records contain an enormous amount of valuable information, but many are recorded in free text. Information extraction is the strategy to transform the sequence of characters into structured data, which can be employed for secondary analysis. However, the traditional information extraction components, such as named entity recognition and relation extraction, require annotated data to optimize the model parameters, which has become one of the major bottlenecks in building information extraction systems. With the large language models achieving good performances on various downstream NLP tasks without parameter tuning, it becomes possible to use large language models for zero-shot information extraction. In this study, we aim to explore whether the most popular large language model, ChatGPT, can extract useful information from the radiological reports. We first design the prompt template for the interested information in the CT reports. Then, we generate the prompts by combining the prompt template with the CT reports as the inputs of ChatGPT to obtain the responses. A post-processing module is developed to transform the responses into structured extraction results. We conducted the experiments with 847 CT reports collected from Peking University Cancer Hospital. The experimental results indicate that ChatGPT can achieve competitive performances for some extraction tasks compared with the baseline information extraction system, but some limitations need to be further improved.

Viaarxiv icon

Sensing Aided Covert Communications: Turning Interference into Allies

Jul 21, 2023
Xinyi Wang, Zesong Fei, Peng Liu, J. Andrew Zhang, Qingqing Wu, Nan Wu

Figure 1 for Sensing Aided Covert Communications: Turning Interference into Allies
Figure 2 for Sensing Aided Covert Communications: Turning Interference into Allies
Figure 3 for Sensing Aided Covert Communications: Turning Interference into Allies
Figure 4 for Sensing Aided Covert Communications: Turning Interference into Allies

In this paper, we investigate the realization of covert communication in a general radar-communication cooperation system, which includes integrated sensing and communications as a special example. We explore the possibility of utilizing the sensing ability of radar to track and jam the aerial adversary target attempting to detect the transmission. Based on the echoes from the target, the extended Kalman filtering technique is employed to predict its trajectory as well as the corresponding channels. Depending on the maneuvering altitude of adversary target, two channel models are considered, with the aim of maximizing the covert transmission rate by jointly designing the radar waveform and communication transmit beamforming vector based on the constructed channels. For the free-space propagation model, by decoupling the joint design, we propose an efficient algorithm to guarantee that the target cannot detect the transmission. For the Rician fading model, since the multi-path components cannot be estimated, a robust joint transmission scheme is proposed based on the property of the Kullback-Leibler divergence. The convergence behaviour, tracking MSE, false alarm and missed detection probabilities, and covert transmission rate are evaluated. Simulation results show that the proposed algorithms achieve accurate tracking. For both channel models, the proposed sensing-assisted covert transmission design is able to guarantee the covertness, and significantly outperforms the conventional schemes.

* 13 pages, 12 figures, submitted to IEEE journals for potential publication 
Viaarxiv icon

Air-Ground Integrated Sensing and Communications: Opportunities and Challenges

Feb 13, 2023
Zesong Fei, Xinyi Wang, Nan Wu, Jingxuan Huang, J. Andrew Zhang

Figure 1 for Air-Ground Integrated Sensing and Communications: Opportunities and Challenges
Figure 2 for Air-Ground Integrated Sensing and Communications: Opportunities and Challenges
Figure 3 for Air-Ground Integrated Sensing and Communications: Opportunities and Challenges
Figure 4 for Air-Ground Integrated Sensing and Communications: Opportunities and Challenges

The air-ground integrated sensing and communications (AG-ISAC) network, which consists of unmanned aerial vehicles (UAVs) and ground terrestrial networks, offers unique capabilities and demands special design techniques. In this article, we provide a review on AG-ISAC, by introducing UAVs as ``relay'' nodes for both communications and sensing to resolve the power and computation constraints on UAVs. We first introduce an AG-ISAC framework, including the system architecture and protocol. Four potential use cases are then discussed, with the analysis on the characteristics and merits of AG-ISAC networks. The research on several critical techniques for AG-ISAC is then discussed. Finally, we present our vision of the challenges and future research directions for AG-ISAC, to facilitate the advancement of the technology.

* 7 pages, 4 figures. To appear in IEEE Communications Magazines 
Viaarxiv icon

Improving Accuracy of Zero-Shot Action Recognition with Handcrafted Features

Jan 21, 2023
Nan Wu, Hiroshi Kera, Kazuhiko Kawamoto

Figure 1 for Improving Accuracy of Zero-Shot Action Recognition with Handcrafted Features
Figure 2 for Improving Accuracy of Zero-Shot Action Recognition with Handcrafted Features
Figure 3 for Improving Accuracy of Zero-Shot Action Recognition with Handcrafted Features
Figure 4 for Improving Accuracy of Zero-Shot Action Recognition with Handcrafted Features

With the development of machine learning, datasets for models are getting increasingly larger. This leads to increased data annotation costs and training time, which undoubtedly hinders the development of machine learning. To solve this problem, zero-shot learning is gaining considerable attention. With zero-shot learning, objects can be recognized or classified, even without having been seen before. Nevertheless, the accuracy of this method is still low, thus limiting its practical application. To solve this problem, we propose a video-text matching model, which can learn from handcrafted features. Our model can be used alone to predict the action classes and can also be added to any other model to improve its accuracy. Moreover, our model can be continuously optimized to improve its accuracy. We only need to manually annotate some features, which incurs some labor costs; in many situations, the costs are worth it. The results with UCF101 and HMDB51 show that our model achieves the best accuracy and also improves the accuracies of other models.

* 15 pages, 7 figures 
Viaarxiv icon

Privacy-Preserving Record Linkage for Cardinality Counting

Jan 09, 2023
Nan Wu, Dinusha Vatsalan, Mohamed Ali Kaafar, Sanath Kumar Ramesh

Figure 1 for Privacy-Preserving Record Linkage for Cardinality Counting
Figure 2 for Privacy-Preserving Record Linkage for Cardinality Counting
Figure 3 for Privacy-Preserving Record Linkage for Cardinality Counting
Figure 4 for Privacy-Preserving Record Linkage for Cardinality Counting

Several applications require counting the number of distinct items in the data, which is known as the cardinality counting problem. Example applications include health applications such as rare disease patients counting for adequate awareness and funding, and counting the number of cases of a new disease for outbreak detection, marketing applications such as counting the visibility reached for a new product, and cybersecurity applications such as tracking the number of unique views of social media posts. The data needed for the counting is however often personal and sensitive, and need to be processed using privacy-preserving techniques. The quality of data in different databases, for example typos, errors and variations, poses additional challenges for accurate cardinality estimation. While privacy-preserving cardinality counting has gained much attention in the recent times and a few privacy-preserving algorithms have been developed for cardinality estimation, no work has so far been done on privacy-preserving cardinality counting using record linkage techniques with fuzzy matching and provable privacy guarantees. We propose a novel privacy-preserving record linkage algorithm using unsupervised clustering techniques to link and count the cardinality of individuals in multiple datasets without compromising their privacy or identity. In addition, existing Elbow methods to find the optimal number of clusters as the cardinality are far from accurate as they do not take into account the purity and completeness of generated clusters. We propose a novel method to find the optimal number of clusters in unsupervised learning. Our experimental results on real and synthetic datasets are highly promising in terms of significantly smaller error rate of less than 0.1 with a privacy budget {\epsilon} = 1.0 compared to the state-of-the-art fuzzy matching and clustering method.

Viaarxiv icon

GReS: Graphical Cross-domain Recommendation for Supply Chain Platform

Sep 02, 2022
Zhiwen Jing, Ziliang Zhao, Yang Feng, Xiaochen Ma, Nan Wu, Shengqiao Kang, Cheng Yang, Yujia Zhang, Hao Guo

Figure 1 for GReS: Graphical Cross-domain Recommendation for Supply Chain Platform
Figure 2 for GReS: Graphical Cross-domain Recommendation for Supply Chain Platform
Figure 3 for GReS: Graphical Cross-domain Recommendation for Supply Chain Platform
Figure 4 for GReS: Graphical Cross-domain Recommendation for Supply Chain Platform

Supply Chain Platforms (SCPs) provide downstream industries with numerous raw materials. Compared with traditional e-commerce platforms, data in SCPs is more sparse due to limited user interests. To tackle the data sparsity problem, one can apply Cross-Domain Recommendation (CDR) which improves the recommendation performance of the target domain with the source domain information. However, applying CDR to SCPs directly ignores the hierarchical structure of commodities in SCPs, which reduce the recommendation performance. To leverage this feature, in this paper, we take the catering platform as an example and propose GReS, a graphical cross-domain recommendation model. The model first constructs a tree-shaped graph to represent the hierarchy of different nodes of dishes and ingredients, and then applies our proposed Tree2vec method combining GCN and BERT models to embed the graph for recommendations. Experimental results on a commercial dataset show that GReS significantly outperforms state-of-the-art methods in Cross-Domain Recommendation for Supply Chain Platforms.

Viaarxiv icon

Heterogeneous Graph Tree Networks

Sep 01, 2022
Nan Wu, Chaofan Wang

Figure 1 for Heterogeneous Graph Tree Networks
Figure 2 for Heterogeneous Graph Tree Networks
Figure 3 for Heterogeneous Graph Tree Networks
Figure 4 for Heterogeneous Graph Tree Networks

Heterogeneous graph neural networks (HGNNs) have attracted increasing research interest in recent three years. Most existing HGNNs fall into two classes. One class is meta-path-based HGNNs which either require domain knowledge to handcraft meta-paths or consume huge amount of time and memory to automatically construct meta-paths. The other class does not rely on meta-path construction. It takes homogeneous convolutional graph neural networks (Conv-GNNs) as backbones and extend them to heterogeneous graphs by introducing node-type- and edge-type-dependent parameters. Regardless of the meta-path dependency, most existing HGNNs employ shallow Conv-GNNs such as GCN and GAT to aggregate neighborhood information, and may have limited capability to capture information from high-order neighborhood. In this work, we propose two heterogeneous graph tree network models: Heterogeneous Graph Tree Convolutional Network (HetGTCN) and Heterogeneous Graph Tree Attention Network (HetGTAN), which do not rely on meta-paths to encode heterogeneity in both node features and graph structure. Extensive experiments on three real-world heterogeneous graph data demonstrate that the proposed HetGTCN and HetGTAN are efficient and consistently outperform all state-of-the-art HGNN baselines on semi-supervised node classification tasks, and can go deep without compromising performance.

Viaarxiv icon

Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation

Jul 14, 2022
Haoyu Wang, Nan Wu, Hang Yang, Cong Hao, Pan Li

Figure 1 for Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation
Figure 2 for Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation
Figure 3 for Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation
Figure 4 for Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation

Using machine learning to solve combinatorial optimization (CO) problems is challenging, especially when the data is unlabeled. This work proposes an unsupervised learning framework for CO problems. Our framework follows a standard relaxation-plus-rounding approach and adopts neural networks to parameterize the relaxed solutions so that simple back-propagation can train the model end-to-end. Our key contribution is the observation that if the relaxed objective satisfies entry-wise concavity, a low optimization loss guarantees the quality of the final integral solutions. This observation significantly broadens the applicability of the previous framework inspired by Erdos' probabilistic method. In particular, this observation can guide the design of objective models in applications where the objectives are not given explicitly while requiring being modeled in prior. We evaluate our framework by solving a synthetic graph optimization problem, and two real-world applications including resource allocation in circuit design and approximate computing. Our framework largely outperforms the baselines based on na\"{i}ve relaxation, reinforcement learning, and Gumbel-softmax tricks.

* Code: https://github.com/Graph-COM/CO_ProxyDesign 
Viaarxiv icon

Dog nose print matching with dual global descriptor based on Contrastive Learning

Jun 01, 2022
Bin Li, Zhongan Wang, Nan Wu, Shuai Shi, Qijun Ma

Figure 1 for Dog nose print matching with dual global descriptor based on Contrastive Learning
Figure 2 for Dog nose print matching with dual global descriptor based on Contrastive Learning
Figure 3 for Dog nose print matching with dual global descriptor based on Contrastive Learning
Figure 4 for Dog nose print matching with dual global descriptor based on Contrastive Learning

Recent studies in biometric-based identification tasks have shown that deep learning methods can achieve better performance. These methods generally extract the global features as descriptor to represent the original image. Nonetheless, it does not perform well for biometric identification under fine-grained tasks. The main reason is that the single image descriptor contains insufficient information to represent image. In this paper, we present a dual global descriptor model, which combines multiple global descriptors to exploit multi level image features. Moreover, we utilize a contrastive loss to enlarge the distance between image representations of confusing classes. The proposed framework achieves the top2 on the CVPR2022 Biometrics Workshop Pet Biometric Challenge. The source code and trained models are publicly available at: https://github.com/flyingsheepbin/pet-biometrics

Viaarxiv icon

Neural network topological snake models for locating general phase diagrams

May 19, 2022
Wanzhou Zhang, Huijiong Yang, Nan Wu

Figure 1 for Neural network topological snake models for locating general phase diagrams
Figure 2 for Neural network topological snake models for locating general phase diagrams
Figure 3 for Neural network topological snake models for locating general phase diagrams
Figure 4 for Neural network topological snake models for locating general phase diagrams

Machine learning for locating phase diagram has received intensive research interest in recent years. However, its application in automatically locating phase diagram is limited to single closed phase boundary. In this paper, in order to locate phase diagrams with multiple phases and complex boundaries, we introduce (i) a network-shaped snake model and (ii) a topologically transformable snake with discriminative cooperative networks, respectively. The phase diagrams of both quantum and classical spin-1 model are obtained. Our method is flexible to determine the phase diagram with just snapshots of configurations from the cold-atom or other experiments.

* 6 pages, 5 figures 
Viaarxiv icon