A Novel Paper Recommendation Method Empowered by Knowledge Graph: for Research Beginners

• URL: http://arxiv.org/abs/2103.08819v1
• Date: Tue, 16 Mar 2021 03:06:06 GMT
• Title: A Novel Paper Recommendation Method Empowered by Knowledge Graph: for Research Beginners
• Authors: Bangchao Wang (1 and 2), Ziyang Weng (1), Yanping Wang (3) ((1) School of Mathematics and Computer Science, Wuhan Textile University, Wuhan, China, (2) School of Computer Science, Wuhan University, Wuhan, China, (3) School of Information Management, Wuhan University, Wuhan, China)
• Abstract summary: "Master-slave" domain knowledge graphs help users express their requirements more accurately and also helps the recommendation system better express knowledge. The experimental results demonstrate the feasibility of obtaining new technical papers in the cross-domain scenario by research beginners using the proposed method.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Searching for papers from different academic databases is the most commonly used method by research beginners to obtain cross-domain technical solutions. However, it is usually inefficient and sometimes even useless because traditional search methods neither consider knowledge heterogeneity in different domains nor build the bottom layer of search, including but not limited to the characteristic description text of target solutions and solutions to be excluded. To alleviate this problem, a novel paper recommendation method is proposed herein by introducing "master-slave" domain knowledge graphs, which not only help users express their requirements more accurately but also helps the recommendation system better express knowledge. Specifically, it is not restricted by the cold start problem and is a challenge-oriented method. To identify the rationality and usefulness of the proposed method, we selected two cross-domains and three different academic databases for verification. The experimental results demonstrate the feasibility of obtaining new technical papers in the cross-domain scenario by research beginners using the proposed method. Further, a new research paradigm for research beginners in the early stages is proposed herein.

Related papers

• A Framework for Guided Motion Planning [1.179253400575852]
  We formalize the notion of guided search by defining the concept of a guiding space. This new language encapsulates many seemingly distinct prior methods under the same framework. We suggest an information theoretic method to evaluate guidance, which experimentally matches intuition when tested on known algorithms.
  arXiv  Detail & Related papers  (2024-04-04T00:58:19Z)
• Embedding in Recommender Systems: A Survey [67.67966158305603]
  A crucial aspect is embedding techniques that covert the high-dimensional discrete features, such as user and item IDs, into low-dimensional continuous vectors. Applying embedding techniques captures complex entity relationships and has spurred substantial research. This survey covers embedding methods like collaborative filtering, self-supervised learning, and graph-based techniques.
  arXiv  Detail & Related papers  (2023-10-28T06:31:06Z)
• Guided Depth Map Super-resolution: A Survey [88.54731860957804]
  Guided depth map super-resolution (GDSR) aims to reconstruct a high-resolution (HR) depth map from a low-resolution (LR) observation with the help of a paired HR color image. A myriad of novel and effective approaches have been proposed recently, especially with powerful deep learning techniques. This survey is an effort to present a comprehensive survey of recent progress in GDSR.
  arXiv  Detail & Related papers  (2023-02-19T15:43:54Z)
• Review-Based Domain Disentanglement without Duplicate Users or Contexts for Cross-Domain Recommendation [1.2074552857379273]
  Cross-domain recommendation has shown promising results in solving data-sparsity and cold-start problems. Our model (named SER) uses three text analysis modules, guided by a single domain discriminator for disentangled representation learning.
  arXiv  Detail & Related papers  (2021-10-25T05:17:58Z)
• A Survey on Deep Semi-supervised Learning [51.26862262550445]
  We first present a taxonomy for deep semi-supervised learning that categorizes existing methods. We then offer a detailed comparison of these methods in terms of the type of losses, contributions, and architecture differences.
  arXiv  Detail & Related papers  (2021-02-28T16:22:58Z)
• Unsupervised Neural Domain Adaptation for Document Image Binarization [13.848843012433187]
  This paper proposes a method that combines neural networks and Domain Adaptation (DA) in order to carry out unsupervised document binarization. Results show that our proposal successfully deals with the binarization of new document domains without the need for labeled data.
  arXiv  Detail & Related papers  (2020-12-02T13:42:38Z)
• A Theory of Multiple-Source Adaptation with Limited Target Labeled Data [66.53679520072978]
  We show that a new family of algorithms based on model selection ideas benefits from very favorable guarantees in this scenario. We also report the results of several experiments with our algorithms that demonstrate their practical effectiveness.
  arXiv  Detail & Related papers  (2020-07-19T19:34:48Z)
• A Prescription of Methodological Guidelines for Comparing Bio-inspired Optimization Algorithms [15.803264424018488]
  We propose methodological guidelines to prepare a successful proposal of a new bio-inspired algorithm. Results reported by the authors should be proven to achieve a significant advance over previous outcomes. We expect these guidelines to be useful not only for authors, but also for reviewers and editors along their assessment of new contributions to the field.
  arXiv  Detail & Related papers  (2020-04-19T04:46:45Z)
• Recommendation system using a deep learning and graph analysis approach [1.2183405753834562]
  We propose a novel recommendation method based on Matrix Factorization and graph analysis methods. In addition, we leverage deep Autoencoders to initialize users and items latent factors, and deep embedding method gathers users' latent factors from the user trust graph.
  arXiv  Detail & Related papers  (2020-04-17T08:05:33Z)
• There and Back Again: Revisiting Backpropagation Saliency Methods [87.40330595283969]
  Saliency methods seek to explain the predictions of a model by producing an importance map across each input sample. A popular class of such methods is based on backpropagating a signal and analyzing the resulting gradient. We propose a single framework under which several such methods can be unified.
  arXiv  Detail & Related papers  (2020-04-06T17:58:08Z)
• A Survey on Knowledge Graph-Based Recommender Systems [65.50486149662564]
  We conduct a systematical survey of knowledge graph-based recommender systems. We focus on how the papers utilize the knowledge graph for accurate and explainable recommendation. We introduce datasets used in these works.
  arXiv  Detail & Related papers  (2020-02-28T02:26:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.