Abstract

Citation recommendation is an effective and efficient way to facilitate authors finding desired references. This paper presents a novel neural network based model, called gated relational probabilistic stacked denoising autoencoder with localized author (GRSLA) embedding, for global citation recommendation task. Our model is comprised of two modules with different neural network architecture. For each citing and cited papers, we use a gated paper embedding module, which is extended from probabilistic stacked denoising autoencoder (PSDAE) by adding gated units, to obtain their paper vectors. The added gated units are able to utilize text information of cited paper to refine the vector representation of citing paper in multiple semantic levels. For an author in papers, we first apply topic model to obtain his/her semantic neighbors, and then use a localized author embedding (LAE) module to excavate author vector representation from semantic and explicit neighbors. Unlike most graph convolutional network (GCN) based methods, the LAE module is able to avoid computing global Laplacian in whole graph by taking limited neighbors. Moreover, the LAE module can also be stacked to absorb more neighbors, which makes our model have high extendibility. Based on the generation process of GRSLA, we also derive a learning algorithm of our model by maximum a posteriori (MAP) estimation. We conduct experiments on the AAN, DBLP and CORD-19 datasets, and the results show that GRSLA model works well than previous global citation recommendation methods.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.