Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guohua Wang 0003

dblp:74/4514-3 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
9since 2021 · last 2024
0000-0001-9705-4993ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 5 since 2021Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
6 papers
Information extraction and text analysis · 74% Reinforcement learning · 9% Transfer learning and domain adaptation · 8%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

Topics — the 13 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
named entity recognition
1.022021
A Multi-Agent Communication Based Model for Nested Named Entity Recognition · IEEE ACM Trans. Audio Speech Lang. Process. 2021
A Nested Named Entity Recognition Model Based on Multi-agent Communication Mechanism (Student Abstract) · AAAI 2021
Natural language and speech › Information extraction and text analysis › named entity recognition
nested named entity recognition
1.022021
A Multi-Agent Communication Based Model for Nested Named Entity Recognition · IEEE ACM Trans. Audio Speech Lang. Process. 2021
A Nested Named Entity Recognition Model Based on Multi-agent Communication Mechanism (Student Abstract) · AAAI 2021
Visualization and visual analytics › data storytelling
infographic authoring
0.812024
Towards Automated Infographic Authoring From Natural Language Statement With Multiple Proportional Facts · IEEE Trans. Multim. 2024
Machine learning › Reinforcement learning › multi-agent reinforcement learning
multi-agent communication
0.722021
A Nested Named Entity Recognition Model Based on Multi-agent Communication Mechanism (Student Abstract) · AAAI 2021
A Multi-Agent Communication Based Model for Nested Named Entity Recognition · IEEE ACM Trans. Audio Speech Lang. Process. 2021
Natural language and speech › Information extraction and text analysis › sentiment analysis
aspect-based sentiment analysis
0.612022
Enhance Cross-Domain Aspect-Based Sentiment Analysis by Incorporating Commonsense Relational Structure (Student Abstract) · AAAI 2022
Natural language and speech › Information extraction and text analysis › sentiment analysis › sentiment classification
cross-domain sentiment classification
0.612022
Enhance Cross-Domain Aspect-Based Sentiment Analysis by Incorporating Commonsense Relational Structure (Student Abstract) · AAAI 2022
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.612022
Task-Adaptive Feature Fusion for Generalized Few-Shot Relation Classification in an Open World Environment · IEEE ACM Trans. Audio Speech Lang. Process. 2022
Natural language and speech › Information extraction and text analysis › relation extraction › relation classification
few-shot relation classification
0.612022
Task-Adaptive Feature Fusion for Generalized Few-Shot Relation Classification in an Open World Environment · IEEE ACM Trans. Audio Speech Lang. Process. 2022
Natural language and speech › Information extraction and text analysis › relation extraction
relation classification
0.612022
Task-Adaptive Feature Fusion for Generalized Few-Shot Relation Classification in an Open World Environment · IEEE ACM Trans. Audio Speech Lang. Process. 2022
Natural language and speech › Information extraction and text analysis › relation extraction
joint entity and relation extraction
0.512021
Incorporating Bidirection-Interactive Information and Semantic Features for Relational Facts Extraction (Student Abstract) · AAAI 2021
Natural language and speech › Information extraction and text analysis
relation extraction
0.512021
Incorporating Bidirection-Interactive Information and Semantic Features for Relational Facts Extraction (Student Abstract) · AAAI 2021
Natural language and speech › Language models and text generation
text representation
0.512021
Incorporating Bidirection-Interactive Information and Semantic Features for Relational Facts Extraction (Student Abstract) · AAAI 2021
Knowledge, reasoning and agents › Knowledge representation and reasoning
commonsense reasoning
0.212022
Enhance Cross-Domain Aspect-Based Sentiment Analysis by Incorporating Commonsense Relational Structure (Student Abstract) · AAAI 2022

Methods — techniques the papers use, named apart from their topics

deep learning classification · 1.5multi-agent communication · 1.0task-adaptive feature fusion · 0.6syntactic structure transfer · 0.6prototypical network · 0.6open-set learning · 0.6commonsense relational structure · 0.6sequence tagging · 0.5graph convolutional network · 0.5BiLSTM · 0.5
YearPublicationVenuePosition
2024 Knowledge-Guided Cross-Topic Visual Question Generation
abstract
Visual question generation (VQG) task aims to generate high-quality questions based on the input image. Current methods primarily focus on generating questions containing specified content utilizing answers or question types as constraints. However, these constraints make it challenging to control the topic of generated questions (e.g., conversation or test subject topics) for various applications. Thus, it is necessary to utilize topics as constraints to guide question generation. Considering that there are many topics and it is almost impossible for human annotations to cover them, we propose the cross-topic learning VQG (CTL-VQG) task, which aims to generate questions related to unseen topics in cross-topic scenarios. In this paper, we propose a knowledge-guided cross-topic visual question generation (KC-VQG) model to extract unseen topic-related information for question generation. Specifically, an image-topic feature extractor is introduced in our model to extract topic-related intuitive visual features; an image-topic knowledge extractor is used to extract and select the most appropriate topic-related implicit knowledge from large language models for generating questions. Extensive experiments show that our model outperforms baselines and can effectively generate unseen topic-related questions in cross-topic scenarios.
Guohua Wang 0003, Jiayuan Xie, Wenhao Fang, Yi Cai 0001
LREC/COLING2
2024 A Knowledge-Enhanced and Topic-Guided Domain Adaptation Model for Aspect-Based Sentiment Analysis
abstract
Cross-domain aspect-based sentiment analysis has recently attracted significant attention, which can effectively alleviate the problem of lacking large-scale labeled data for supervised learning based methods. Most of current methods mainly focus on extracting domain-shared syntactic features to conduct the domain adaptation. Due to the language and syntax are diverse between domains, these methods lack generalization and even lead to syntactic transfer errors. External knowledge graphs have rich domain commonsense and share the relational structures between source and target domains. The domain-shared relational structure can effectively bridge the gap across domains and solve the problem of syntactic transfer errors. Moreover, not all the introduced external knowledge is equally important for the cross-domain aspect-based sentiment analysis. Motivated by these, we propose a knowledge-enhanced and topic-guided cross domain aspect-based sentiment analysis model with the domain-shared commonsense relational structure learning module and the topic-guided knowledge attention module. Extensive experiments are conducted and the experimental results evaluate the effectiveness of our proposed model.
Yushi Zeng, Guohua Wang 0003, Haopeng Ren, Yi Cai 0001, Ho-fung Leung, Qing Li 0001, Qingbao Huang
IEEE Trans. Affect. Comput.2
2024 Towards Bridged Vision and Language: Learning Cross-Modal Knowledge Representation for Relation Extraction
abstract
In natural language processing, relation extraction (RE) is to detect and classify the semantic relationship of two given entities within a sentence. Previous RE methods consider only the textual contents and suffer performance decline in social media when texts lack contexts. Incorporating text-related visual information can supplement the missing semantics for relation extraction in social media posts. However, textual relations are usually abstract and of high-level semantics, which causes the semantic gap between visual contents and textual expressions. In this paper, we propose RECK - a neural network for relation extraction with cross-modal knowledge representations. Different from previous multimodal methods training a common subspace for all modalities, we bridge the semantic gaps by explicitly selecting knowledge paths from external knowledge through the cross-modal object-entity pairs. We further extend the paths into a knowledge graph, and adopt a graph attention network to capture the multi-grained relevant concepts which can provide higher level and key semantics information from external knowledge. Besides, we employ a cross-modal attention mechanism to align and fuse the multimodal information. Experimental results on a multimodal RE dataset show that our model achieves new state-of-the-art performance with knowledge evidence.
Guohua Wang 0003, Changmeng Zheng, Yi Cai 0001, Ze Fu, Yaowei Wang 0001, Xiaoyong Wei, Qing Li 0001
IEEE Trans. Circuits Syst. Video Technol.2
2024 Towards Automated Infographic Authoring From Natural Language Statement With Multiple Proportional Facts
abstract
Infographics, which usually contain many well-designed visual elements, have significant advantages in delivering information efficiently and accurately. Previous research shows that proportion-related infographics make up the majority of all infographics. However, the creation of proportion-related infographics is difficult for general users. Recently, many researchers focus on generating infographics from the text with a single proportional fact. Our further research found that users tend to create infographics with multiple proportional facts. Existing research lacks modeling of relations between different facts, resulting in poor performance when generating infographics with multiple facts. In this paper, we model the relationship of different proportional facts based on the results of our investigation and design a deep learning-based model to classify them. At the same time, we also optimize the ability to extract multiple proportional facts from text. The experiments show that our model outperforms existing models when visualizing text with multiple proportional facts.
Guohua Wang 0003, Yi Cai 0001, Xin Wu 0003
IEEE Trans. Multim.2
2022 Enhance Cross-Domain Aspect-Based Sentiment Analysis by Incorporating Commonsense Relational Structure (Student Abstract)
abstract
Aspect Based Sentiment Analysis (ABSA) aims to extract aspect terms and identify the sentiment polarities towards each extracted aspect term. Currently, syntactic information is seen as the bridge for the domain adaptation and achieves remarkable performance. However, the transferable syntactic knowledge is complex and diverse, which causes the transfer error problem in domain adaptation. In our paper, we propose a domain-shared relational structure incorporated cross-domain ABSA model. The experimental results show the effectiveness of our model.
Yushi Zeng, Guohua Wang 0003, Haopeng Ren, Yi Cai 0001
AAAI2
2022 Task-Adaptive Feature Fusion for Generalized Few-Shot Relation Classification in an Open World Environment
abstract
Relation Classification (RC) is an important task in information extraction. In most real-world scenarios, the frequency of relations often follows a long-tailed and open-ended distribution. However, current efforts mainly focus on the partial frequency distribution of relations, which is limited in real-world applications. Meanwhile, prototypical network achieves remarkable performance among fields of deep supervised learning, few-shot learning and open set learning. Nevertheless, in the open world environment, it still suffers from the incompatible feature embedding problem as the novel and unknown relations come in. To address these problems, we propose an Open Generalized Prototypical Network with task-adaptive feature fusion for the open generalized few-shot relation classification. Extensive experiments are conducted on public large-scale datasets and our proposed model obtains the better performances.
Xiaofeng Chen 0001, Guohua Wang 0003, Haopeng Ren, Yi Cai 0001, Ho-fung Leung, Tao Wang 0036
IEEE ACM Trans. Audio Speech Lang. Process.2
2021 A Nested Named Entity Recognition Model Based on Multi-agent Communication Mechanism (Student Abstract)
abstract
Traditional sequence tagging methods for named entity recognition (NER) face challenges when handling nested entities, where an entity is nested in another. Most previous methods for nested NER ignore the effect of entity boundary information or type information. Considering that entity boundary information and type information can be utilized to improve the performance of boundary detection, we propose a nested NER model with a multi-agent communication module. The type tagger and boundary tagger in the multi-agent communication module iteratively utilize the information from each other, which improves the boundary detection and the final performance of nested NER. Empirical experiments conducted on two nested NER datasets show the effectiveness of our model.
Canguang Li, Guohua Wang 0003, Yi Cai 0001
AAAI2
2021 Incorporating Bidirection-Interactive Information and Semantic Features for Relational Facts Extraction (Student Abstract)
abstract
The interaction between named entity recognition and relation classification is quite essential for the extraction of relational triplets. However, most of jointly extraction works only consider unidirectional interaction between the two sub-tasks. They even neglect the interactive information totally. In order to tackle these problems, we propose a novel unified joint extraction model which considers bidirection-interactive information between the two subtasks. Our model consists of two modules. The first module utilizes Bi-LSTM and GCN to capture the sequential and the structure-semantic features of a sentence, The second module utilizes two layers to capture bidirection-interactive information between the two subtasks and generates relational triplets respectively. The experimental results show that our proposed model outperforms the state-of-the-art models on two public datasets.
Guohua Wang 0003, Haopeng Ren, Yi Cai 0001
AAAI2
2021 A Multi-Agent Communication Based Model for Nested Named Entity Recognition
abstract
Named entity recognition (NER) is a basic task in natural language processing. Traditionally, sequence labeling methods are applied to named entity recognition and achieve good performance. However, sequence labeling methods can not be straightly applied to recognize nested named entities where an entity is included in another entity. Recently, some new methods are proposed for nested named entity recognition. Most of them ignore that entity type information can help recognize entity boundaries or ignore that entity boundary information can help recognize entity type, which limits the performance of nested NER. Considering the effect of entity type information and entity boundary information, in this paper, we propose a multi-agent communication module to utilize these two kinds of information. Our multi-agent communication module contains a type labeling agent and a boundary labeling agent. The type labeling agent can utilize boundary information from boundary labeling agent to recognize entity type. And the boundary labeling agent can utilize type information from type labeling agent to recognize entity boundaries. They communicate and collaborate iteratively to finish the entity boundary recognition. Compared with previous methods, with the assist of entity type information and entity boundary information, the performance of boundary recognition improves. The improvement of boundary recognition is beneficial to recognizing nested named entities, which improves the performance of nested named entity recognition. Empirical experiments are conducted on three nested NER datasets. And the experimental results show the effectiveness of our model.
Canguang Li, Guohua Wang 0003, Yi Cai 0001
IEEE ACM Trans. Audio Speech Lang. Process.2
2020 A Two-phase Prototypical Network Model for Incremental Few-shot Relation Classification
abstract
Relation Classification (RC) plays an important role in natural language processing (NLP).Current conventional supervised and distantly supervised RC models always make a closed-world assumption which ignores the emergence of novel relations in an open environment.To incrementally recognize the novel relations, current two solutions (i.e, re-training and lifelong learning) are designed but suffer from the lack of large-scale labeled data for novel relations.Meanwhile, prototypical network enjoys better performance on both fields of deep supervised learning and few-shot learning.However, it still suffers from the incompatible feature embedding problem when the novel relations come in.Motivated by them, we propose a two-phase prototypical network with prototype attention alignment and triplet loss to dynamically recognize the novel relations with a few support instances meanwhile without catastrophic forgetting.Extensive experiments are conducted to evaluate the effectiveness of our proposed model.
Haopeng Ren, Yi Cai 0001, Xiaofeng Chen 0001, Guohua Wang 0003, Qing Li 0001
COLING4
2020 Incorporating Boundary and Category Feature for Nested Named Entity Recognition
Guohua Wang 0003, Canguang Li, Haopeng Ren, Yi Cai 0001, Raymond Chi-Wing Wong, Qing Li 0001
DASFAA (2)2