2 April 2020 in IEEE Access
Event argument extraction, which aims to identify arguments of specific events and label their roles, is a challenging subtask of event extraction. Previous approaches solve this problem in a two-stage manner that first extracts named entities as argument candidates and then determines their roles. However, many nested entities may be missed or wrongly predicted during the argument candidate extraction procedure, which substantially affects the performance of the downstream classifier. In this paper, we propose a novel one-step question answering based framework, which performs argument candidate extraction and argument role classification simultaneously to mitigate the error propagation problem in conventional two-stage methods. Since the conventional question answering based framework cannot be applied directly to this task, we design a Question Answering based Sequence Labeling (QA-SL) model to tackle inexistent argument roles and multiple argument token spans. Moreover, considering the overwhelming number of parameters in question answering based neural network models and the relatively small size of event extraction corpus, we fine-tune the pre-trained model from BERT to mitigate the data scarcity problem. Extensive experiments demonstrate the benefits of the proposed method, leading to a competitive performance compared with state-of-the-art methods. To the best of our knowledge, this is the first work to cast event argument extraction as a question answering task.
16 March 2020 in IEEE Access
12 November 2019 in IEEE Access
Visualization of the small world network is an excellent challenge for classic layout algorithm, which is highly connected, resulting in the shape of the hairball. Backbone extraction method can simplify the classic layout to get better visualization, and it has become a significant approach in this field. However, contemporary approaches have two primary defects. Centrality based method loses plenty of topology information, and most contemporary approaches have the problem in low interactivity due to parameter sensibility. We proposed a backbone method based on interactive edge selection (IES-Backbone) to solve two problems for small world network visualization that mentioned above. The proposed method starts with backbone extraction of the network and then apply the layout algorithm to get visualization results. A critical approach of the backbone method is edge selection, which is based on the distance between vertices layout of the binary stress model. Edge selection makes the simplified network a clear community structure feature with more topological details. The simplified network is high in homophily and has closer average path length to the original network. The visualization result is controlled by edge limit ratio r and sampling rate s. Different choices of two parameters can change the results substantially on visual without affecting the layout quality, which proves high interactivity for users. Experiments prove that IES-Backbone is an interactive visualization method that presents community and sufficient topological features.
24 February 2020 in IEEE Access
Network embedding (NE) aims to represent network information appropriately by learning low-dimensional and dense vectors for the nodes and edges of information network. Actually, the real world is almost full of heterogeneous information networks, which stimulates the emergence of heterogeneous information networks (HINs) embedding models. However, parts of existing HIN embedding models like meta-path-based methods only capture limited and aggregated information of relations, whereas some models based on metric or distance learning are usually of high computational complexity and slow training speed. In this paper, we present a novel heterogeneous information network embedding model, which applies dynamic projection metrics and translation mechanisms to the complicated heterogeneous information networks including multiple nodes and different relations. In order to overcome the imbalance of the distribution of relations in HIN and optimize the training process, we introduce an adaptive loss function for model optimization. Further more, we propose a hybrid model with baseline method as the initialization of the model. Experiments have been implemented on some real-world HIN datasets. And empirical results show that our model significantly outperforms the state-of-the-art representation learning models.