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

Qiran Gong

dblp:230/4573 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 2Applied, interdisciplinary, general and emerging computing · 2Databases, data management, data science and information retrieval · 1 · 1 since 2021

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
4 papers
Graph learning · 64% Information extraction and text analysis · 24% Learning paradigms · 12%
Databases, data mining, and information retrieval
2 papers
Web and social media mining · 42% Data mining · 42% Knowledge graphs · 16%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
graph convolutional network
0.822020
Motif-Matching Based Subgraph-Level Attentional Convolutional Network for Graph Classification · AAAI 2020
Fine-grained Event Categorization with Heterogeneous Graph Convolutional Networks · IJCAI 2019
Machine learning › Learning paradigms › multi-label classification
hierarchical multi-label classification
0.512021
Hierarchical Taxonomy-Aware and Attentional Graph Capsule RCNNs for Large-Scale Multi-Label Text Classification · IEEE Trans. Knowl. Data Eng. 2021
Natural language and speech › Information extraction and text analysis › text classification
multi-label text classification
0.512021
Hierarchical Taxonomy-Aware and Attentional Graph Capsule RCNNs for Large-Scale Multi-Label Text Classification · IEEE Trans. Knowl. Data Eng. 2021
Natural language and speech › Information extraction and text analysis
text classification
0.512021
Hierarchical Taxonomy-Aware and Attentional Graph Capsule RCNNs for Large-Scale Multi-Label Text Classification · IEEE Trans. Knowl. Data Eng. 2021
Machine learning › Graph learning › dynamic graph learning
dynamic network embedding
0.412020
Dynamic network embedding via incremental skip-gram with negative sampling · Sci. China Inf. Sci. 2020
Machine learning › Graph learning
graph classification
0.412020
Motif-Matching Based Subgraph-Level Attentional Convolutional Network for Graph Classification · AAAI 2020
Machine learning › Graph learning
network embedding
0.412020
Dynamic network embedding via incremental skip-gram with negative sampling · Sci. China Inf. Sci. 2020
Machine learning › Graph learning › graph neural network › heterogeneous graph neural network
heterogeneous graph convolutional network
0.412019
Fine-grained Event Categorization with Heterogeneous Graph Convolutional Networks · IJCAI 2019
Web and social media mining
event detection
0.412019
Fine-grained Event Categorization with Heterogeneous Graph Convolutional Networks · IJCAI 2019
Data mining › structured data mining › graph mining
heterogeneous information network
0.412019
Fine-grained Event Categorization with Heterogeneous Graph Convolutional Networks · IJCAI 2019
Machine learning › Graph learning
graph kernel
0.112020
Motif-Matching Based Subgraph-Level Attentional Convolutional Network for Graph Classification · AAAI 2020

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

recurrent CNN · 1.0margin loss · 1.0graph capsule network · 1.0attention · 1.0knowledge base integration · 0.8subgraph-level self-attention · 0.4skip-gram · 0.4negative sampling · 0.4motif matching · 0.4graph convolution · 0.4pairwise popularity graph convolutional network · 0.4meta-path based similarity · 0.4
YearPublicationVenuePosition
2021 Hierarchical Taxonomy-Aware and Attentional Graph Capsule RCNNs for Large-Scale Multi-Label Text Classification
abstract
CNNs, RNNs, GCNs, and CapsNets have shown significant insights in representation learning and are widely used in various text mining tasks such as large-scale multi-label text classification. Most existing deep models for multi-label text classification consider either the non-consecutive and long-distance semantics or the sequential semantics. However, how to coherently take them into account is still far from studied. In addition, most existing methods treat output labels as independent medoids, ignoring the hierarchical relationships among them, which leads to a substantial loss of useful semantic information. In this paper, we propose a novel hierarchical taxonomy-aware and attentional graph capsule recurrent CNNs framework for large-scale multi-label text classification. Specifically, we first propose to model each document as a word order preserved graph-of-words and normalize it as a corresponding word matrix representation preserving both the non-consecutive, long-distance and local sequential semantics. Then the word matrix is input to the proposed attentional graph capsule recurrent CNNs for effectively learning the semantic features. To leverage the hierarchical relations among the class labels, we propose a hierarchical taxonomy embedding method to learn their representations, and define a novel weighted margin loss by incorporating the label representation similarity. Extensive evaluations on three datasets show that our model significantly improves the performance of large-scale multi-label text classification by comparing with state-of-the-art approaches.
Hao Peng 0001, Jianxin Li 0002, Senzhang Wang, Qiran Gong, Renyu Yang, Bo Li 0005, Philip S. Yu, Lifang He 0001
IEEE Trans. Knowl. Data Eng.5
2020 Motif-Matching Based Subgraph-Level Attentional Convolutional Network for Graph Classification
abstract
Graph classification is critically important to many real-world applications that are associated with graph data such as chemical drug analysis and social network mining. Traditional methods usually require feature engineering to extract the graph features that can help discriminate the graphs of different classes. Although recently deep learning based graph embedding approaches are proposed to automatically learn graph features, they mostly use a few vertex arrangements extracted from the graph for feature learning, which may lose some structural information. In this work, we present a novel motif-based attentional graph convolution neural network for graph classification, which can learn more discriminative and richer graph features. Specifically, a motif-matching guided subgraph normalization method is developed to better preserve the spatial information. A novel subgraph-level self-attention network is also proposed to capture the different impacts or weights of different subgraphs. Experimental results on both bioinformatics and social network datasets show that the proposed models significantly improve graph classification performance over both traditional graph kernel methods and recent deep learning approaches.
Hao Peng 0001, Jianxin Li 0002, Qiran Gong, Yuanxing Ning, Senzhang Wang, Lifang He 0001
AAAI3
2020 Dynamic network embedding via incremental skip-gram with negative sampling
Hao Peng 0001, Jianxin Li 0002, Hao Yan 0004, Qiran Gong, Senzhang Wang, Xiang Ren 0001
Sci. China Inf. Sci.4
2020 Deep Irregular Convolutional Residual LSTM for Urban Traffic Passenger Flows Prediction
abstract
Urban traffic passenger flows prediction is practically important to facilitate many real applications including transportation management and public safety. Recently, deep learning based approaches are proposed to learn the spatio-temporal characteristics of the traffic passenger flows. However, it is still very challenging to handle some complex factors such as hybrid transportation lines, mixed traffic, transfer stations, and some extreme weathers. Considering the multi-channel and irregularity properties of urban traffic passenger flows in different transportation lines, a more efficient and fine-grained deep spatio-temporal feature learning model is necessary. In this paper, we propose a deep irregular convolutional residual LSTM network model called DST-ICRL for urban traffic passenger flows prediction. We first model the passenger flows among different traffic lines in a transportation network into multi-channel matrices analogous to the RGB pixel matrices of an image. Then, we propose a deep learning framework that integrates irregular convolutional residential network and LSTM units to learn the spatial-temporal feature representations. To fully utilize the historical passenger flows, we sample both the short-term and long-term historical traffic data, which can capture the periodicity and trend of the traffic passenger flows. In addition, we also fuse other external factors further to facilitate a real-time prediction. We conduct extensive experiments on different types of traffic passenger flows datasets including subway, taxi and bus flows in Beijing as well as bike flows in New York. The results show that the proposed DST-ICRL significantly outperforms both traditional and deep learning based urban traffic passenger flows prediction methods.
Bowen Du 0001, Hao Peng 0001, Senzhang Wang, Md. Zakirul Alam Bhuiyan, Qiran Gong
IEEE Trans. Intell. Transp. Syst.6
2019 Fine-grained Event Categorization with Heterogeneous Graph Convolutional Networks
abstract
Events are happening in real-world and real-time, which can be planned and organized occasions involving multiple people and objects. Social media platforms publish a lot of text messages containing public events with comprehensive topics. However, mining social events is challenging due to the heterogeneous event elements in texts and explicit and implicit social network structures. In this paper, we design an event meta-schema to characterize the semantic relatedness of social events and build an event-based heterogeneous information network (HIN) integrating information from external knowledge base, and propose a novel Pairwise Popularity Graph Convolutional Network (PP-GCN) based fine-grained social event categorization model. We propose a Knowledgeable meta-paths Instances based social Event Similarity (KIES) between events and build a weighted adjacent matrix as input to the PP-GCN model. Comprehensive experiments on real data collections are conducted to compare various social event detection and clustering tasks. Experimental results demonstrate that our proposed framework outperforms other alternative social event categorization techniques.
Hao Peng 0001, Jianxin Li 0002, Qiran Gong, Yangqiu Song, Yuanxing Ning, Kunfeng Lai, Philip S. Yu
IJCAI3