Data are essential for the experiments of relevant scientific publication recommendation methods but it is difficult to build ground truth data. A naturally promising solution is using publications that are referenced by researchers to build their ground truth data. Unfortunately, this approach has not been explored in the literature, so its applicability is still a gap in our knowledge. In this research, we systematically study this approach by theoretical and empirical analyses. In general, the results show that this approach is reasonable and has many advantages. However, the empirical analysis shows both positive and negative results. We conclude that, in some situations, this is a useful alternative approach toward overcoming data limitation. Based on this approach, we build and publish a dataset in computer science domain to help advancing other researches.
The emerging trend in relevant scientific publication recommendation research has raised an increasing attention to ground truth data @cite_8 @cite_0 @cite_4 . Many approaches have been proposed but all of them have flaws. Some researchers manually build ground truth data by surveying a group of researchers. With a high cost, these datasets are usually small, e.g., with only 28 researchers @cite_8 . Moreover, due to privacy issues, these datasets are not fully shared. Some researchers use datasets adapted from reference management systems, e.g., Mendeley and Docear. However, ground truth data in these datasets are not guaranteed to represent researchers' real research interests. Another approach to build dataset is crowdsourcing but it has not been used in relevant scientific publication recommendation area and requires complicated systems. A promising approach is building ground truth data based on reference data. However, to the best of our knowledge, no research has been done on assessing its applicability. In this paper, we systematically explore this approach.
@cite_0 @cite_4 @cite_8
1511181855 2043778286 2062340319
In this work, we propose a new approach for discovering various relationships among keywords over the scientific publications based on a Markov Chain model. It is an important problem since keywords are the basic elements for representing abstract objects such as documents, user profiles, topics and many things else. Our model is very effective since it combines four important factors in scientific publications: content, publicity, impact and randomness. Particularly, a recommendation system (called SciRecSys) has been presented to support users to efficiently find out relevant articles. An online-browsing support system for research papers has been developed that extracts technical terms from a paper and presents links to useful pages such as those explaining the terms. A method to further use the extracted technical terms is proposed to recommend papers to a user that are related to the paper he or she is browsing. Specifically, the proposed method generates a bipartite graph consisting of papers retrieved by the extracted technical terms, which are called related papers, and technical terms appearing in these related papers. It then ranks the related papers using the HITS algorithm for analyzing the bipartite graph and recommends top-ranked papers to the user. The proposed method was compared with other recommendation methods in terms of effectiveness in an experiment. We examine the effect of modeling a researcher's past works in recommending scholarly papers to the researcher. Our hypothesis is that an author's published works constitute a clean signal of the latent interests of a researcher. A key part of our model is to enhance the profile derived directly from past works with information coming from the past works' referenced papers as well as papers that cite the work. In our experiments, we differentiate between junior researchers that have only published one paper and senior researchers that have multiple publications. We show that filtering these sources of information is advantageous -- when we additionally prune noisy citations, referenced papers and publication history, we achieve statistically significant higher levels of recommendation accuracy.