Kaiqun Fu

Kaiqun Fu

Auto-generated profile, based on publicly available information

Kaiqun Fu

Virginia Tech

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 July 2021 in arXiv
Verified
Preprint
Open access
PDF file
Zhiqian ChenZhiqian Chen
Zhiqian Chen
FCFanglan Chen
Fanglan Chen
LZLei Zhang
Lei Zhang
TJTaoran Ji
Taoran Ji
KFKaiqun Fu
Kaiqun Fu
CLChang-Tien Lu
Chang-Tien Lu
Deep learning's success has been widely recognized in a variety of machine learning tasks, including image classification, audio recognition, and natural language processing. As an extension of deep learning beyond these domains, graph neural networks (GNNs) are designed to handle the non-Euclidean graph-structure which is intractable to previous deep learning techniques. Existing GNNs are presented using various techniques, making direct comparison and cross-reference more complex. Although existing studies categorize GNNs into spatial-based and spectral-based techniques, there hasn't been a thorough examination of their relationship. To close this gap, this study presents a single framework that systematically incorporates most GNNs. We organize existing GNNs into spatial and spectral domains, as well as expose the connections within each domain. A review of spectral graph theory and approximation theory builds a strong relationship across the spatial and spectral domains in further investigation.

22 May 2019 in arXiv
Verified
Preprint
Open access
PDF file
TJTaoran Ji
Taoran Ji
ZCZhiqian Chen
Zhiqian Chen
NSNathan Self
Nathan Self
KFKaiqun Fu
Kaiqun Fu
CLChang-Tien Lu
Chang-Tien Lu
NRNaren Ramakrishnan
Naren Ramakrishnan
Modeling and forecasting forward citations to a patent is a central task for the discovery of emerging technologies and for measuring the pulse of inventive progress. Conventional methods for forecasting these forward citations cast the problem as analysis of temporal point processes which rely on the conditional intensity of previously received citations. Recent approaches model the conditional intensity as a chain of recurrent neural networks to capture memory dependency in hopes of reducing the restrictions of the parametric form of the intensity function. For the problem of patent citations, we observe that forecasting a patent's chain of citations benefits from not only the patent's history itself but also from the historical citations of assignees and inventors associated with that patent. In this paper, we propose a sequence-to-sequence model which employs an attention-of-attention mechanism to capture the dependencies of these multiple time sequences. Furthermore, the proposed model is able to forecast both the timestamp and the category of a patent's next citation. Extensive experiments on a large patent citation dataset collected from USPTO demonstrate that the proposed model outperforms state-of-the-art models at forward citation forecasting.