Proceedings of the 22nd ACM International Conference on Information &Amp; Knowledge Management 2013
DOI: 10.1145/2505515.2507831
|View full text |Cite
|
Sign up to set email alerts
|

A unified graph model for personalized query-oriented reference paper recommendation

Abstract: With the tremendous amount of research publications, it has become increasingly important to provide a researcher with a rapid and accurate recommendation of a list of reference papers about a research field or topic. In this paper, we propose a unified graph model that can easily incorporate various types of useful information (e.g., content, authorship, citation and collaboration networks etc.) for efficient recommendation. The proposed model not only allows to thoroughly explore how these types of informati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 50 publications
(32 citation statements)
references
References 14 publications
0
32
0
Order By: Relevance
“…Baseline 3 (Random Walk (RW) [32]): RW runs on 2layer graph, i.e., the undirected paper citation graph and the built paper-keywords graph. In addition, each query only uses users' entered keywords: q � [0, q W ], and this approach only executes the keywords query of set C. Baseline 4 (Random Walk Restart (RWR) [31]): RWR runs on same 2-layer graph. Furthermore, this approach only executes the query keywords of set C, i.e., q � [0, q W ].…”
Section: Experimental Settingsmentioning
confidence: 99%
See 1 more Smart Citation
“…Baseline 3 (Random Walk (RW) [32]): RW runs on 2layer graph, i.e., the undirected paper citation graph and the built paper-keywords graph. In addition, each query only uses users' entered keywords: q � [0, q W ], and this approach only executes the keywords query of set C. Baseline 4 (Random Walk Restart (RWR) [31]): RWR runs on same 2-layer graph. Furthermore, this approach only executes the query keywords of set C, i.e., q � [0, q W ].…”
Section: Experimental Settingsmentioning
confidence: 99%
“…Currently, the papers' relationships can further reflect the future research trends of paper recommendation, which is mainly because the correlation relationships among papers can indicate the correlation of papers' research contents. For example, Meng et al [31] regarded authors, papers, topics, and keywords as nodes and their relationships as edges, and the approach recommended academic papers by executing the random walk on a fourlayer heterogeneous graph. Furthermore, Gori and Pucci [32] proposed the graph-based PageRank-like recommendation approach that performed the biased random walk on paper citation graphs, and the approach further emphasized on the correlations among citations.…”
Section: Graph Modelmentioning
confidence: 99%
“…Recent studies employed graph-based approaches to investigate the reference paper recommendation problem [6][7][8][9][10]. Strohman et al [6] deemed reference paper recommendation as link prediction problem.…”
Section: Graph-based Reference Paper Recommendationmentioning
confidence: 99%
“…Meng et al [9] presented a personalized reference paper recommendation approach, which incorporated different kinds of information, such as content of papers, authorship and citation etc., into a unified graph model. Pan et al [10] proposed an academic paper recommendation approach based on a heterogeneous graph containing various kinds of features.…”
Section: Graph-based Reference Paper Recommendationmentioning
confidence: 99%
“…Existing methods for recommending publications can be mapped into three main approaches: content-based [12,14,18], graph-based [10,17,20], and collaborative filtering methods [9,18,19]. Techniques such as PageRank [3] and HITS [7] can also be used to pre-compute the authority scores for publications, which can then be used in conjunction with text similarity to rank documents.…”
Section: Related Workmentioning
confidence: 99%