8
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Knowledge Graph Entity Similarity Calculation under Active Learning

      1 , 2 , 3
      Complexity
      Hindawi Limited

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          To address the objectives of the adaptive learning platform, the requirements of the system in terms of business, functionality, and performance are mainly analysed, and the design of functions and database is completed; then, an updatable learner model is constructed based on the cognitive diagnosis model and resource preference attributes; then, the construction of the knowledge map is completed based on embedding to achieve knowledge point alignment, and based on this, the target knowledge points of learners are located with the help of deep learning; at the same time, the target knowledge points are taken as the starting point to generate the best learning path by traversing the knowledge map, and the corresponding learning resources and test questions are recommended for them with the help of the architecture; finally, the adaptive learning platform is developed in the environment using the architecture. Also, the target knowledge point is used as the starting point to traverse the knowledge map to generate the best learning path, and the corresponding learning resources and test questions are recommended for the learner in combination with the learner model; finally, this study adopts an architecture for the development of an adaptive learning platform in the environment to realize online tests, score analysis, resource recommendation, and other functions. A knowledge graph fusion system supporting interactive facilitation between entity alignment and attribute alignment is implemented. Under a unified conceptual layer, this system can combine entity alignment and attribute alignment to promote each other and truly achieve the final fusion of the two graphs. Our experimental results on real datasets show that the entity alignment algorithm proposed in this paper has a great improvement in accuracy compared with the previous mainstream alignment algorithms. Also, the attribute alignment algorithm proposed in this paper, which calculates the similarity based on associated entities, outperforms the traditional methods in terms of accuracy and recall.

          Related collections

          Most cited references28

          • Record: found
          • Abstract: found
          • Article: not found

          Discovering Protein Drug Targets Using Knowledge Graph Embeddings

          Computational approaches for predicting drug-target interactions (DTIs) can provide valuable insights into the drug mechanism of action. DTI predictions can help to quickly identify new promising (on-target) or unintended (off-target) effects of drugs. However, existing models face several challenges. Many can only process a limited number of drugs and/or have poor proteome coverage. The current approaches also often suffer from high false positive prediction rates. We propose a novel computational approach for predicting drug target proteins. The approach is based on formulating the problem as a link prediction in knowledge graphs (robust, machine-readable representations of networked knowledge). We use biomedical knowledge bases to create a knowledge graph of entities connected to both drugs and their potential targets. We propose a specific knowledge graph embedding model, TriModel, to learn vector representaions (i.e. embeddings) for all drugs and targets in the created knowledge graph. These representations are consequently used to infer candidate drug target interactions based on their scores computed by the trained TriModel model. We have experimentally evaluated our method using computer simulations and compared it to five existing models. This has shown that our approach outperforms all previous ones in terms of both area under ROC and precision-recall curves in standard benchmark tests. The data, predictions, and models are available at: drugtargets.insight-centre.org
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Active learning for computational chemogenomics.

            Computational chemogenomics models the compound-protein interaction space, typically for drug discovery, where existing methods predominantly either incorporate increasing numbers of bioactivity samples or focus on specific subfamilies of proteins and ligands. As an alternative to modeling entire large datasets at once, active learning adaptively incorporates a minimum of informative examples for modeling, yielding compact but high quality models. Results/methodology: We assessed active learning for protein/target family-wide chemogenomic modeling by replicate experiment. Results demonstrate that small yet highly predictive models can be extracted from only 10-25% of large bioactivity datasets, irrespective of molecule descriptors used.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Explainable Reasoning over Knowledge Graphs for Recommendation

              Incorporating knowledge graph into recommender systems has attracted increasing attention in recent years. By exploring the interlinks within a knowledge graph, the connectivity between users and items can be discovered as paths, which provide rich and complementary information to user-item interactions. Such connectivity not only reveals the semantics of entities and relations, but also helps to comprehend a user’s interest. However, existing efforts have not fully explored this connectivity to infer user preferences, especially in terms of modeling the sequential dependencies within and holistic semantics of a path.In this paper, we contribute a new model named Knowledgeaware Path Recurrent Network (KPRN) to exploit knowledge graph for recommendation. KPRN can generate path representations by composing the semantics of both entities and relations. By leveraging the sequential dependencies within a path, we allow effective reasoning on paths to infer the underlying rationale of a user-item interaction. Furthermore, we design a new weighted pooling operation to discriminate the strengths of different paths in connecting a user with an item, endowing our model with a certain level of explainability. We conduct extensive experiments on two datasets about movie and music, demonstrating significant improvements over state-of-the-art solutions Collaborative Knowledge Base Embedding and Neural Factorization Machine.
                Bookmark

                Author and article information

                Contributors
                Journal
                Complexity
                Complexity
                Hindawi Limited
                1099-0526
                1076-2787
                June 11 2021
                June 11 2021
                : 2021
                : 1-11
                Affiliations
                [1 ]School of International Education, Nanyang Medical College, Nanyang, Henan 473000, China
                [2 ]School of Computer and Software, Nanyang Institute of Technology, Nanyang, Henan 473000, China
                [3 ]Cofoe Medical Technology Company Limited, Shenzhen, Guangdong 518101, China
                Article
                10.1155/2021/3522609
                1481f6b2-ca3b-45b9-ad25-176b35ac8a23
                © 2021

                https://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article