Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (5)
  • Open Access

    ARTICLE

    Knowledge Graph Representation Learning Based on Automatic Network Search for Link Prediction

    Zefeng Gu, Hua Chen*

    CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.3, pp. 2497-2514, 2023, DOI:10.32604/cmes.2023.024332

    Abstract Link prediction, also known as Knowledge Graph Completion (KGC), is the common task in Knowledge Graphs (KGs) to predict missing connections between entities. Most existing methods focus on designing shallow, scalable models, which have less expressive than deep, multi-layer models. Furthermore, most operations like addition, matrix multiplications or factorization are handcrafted based on a few known relation patterns in several well-known datasets, such as FB15k, WN18, etc. However, due to the diversity and complex nature of real-world data distribution, it is inherently difficult to preset all latent patterns. To address this issue, we propose KGE-ANS, a novel knowledge graph embedding… More >

  • Open Access

    ARTICLE

    Future Event Prediction Based on Temporal Knowledge Graph Embedding

    Zhipeng Li1,2, Shanshan Feng3,*, Jun Shi2, Yang Zhou2, Yong Liao1,2, Yangzhao Yang2, Yangyang Li4, Nenghai Yu1, Xun Shao5

    Computer Systems Science and Engineering, Vol.44, No.3, pp. 2411-2423, 2023, DOI:10.32604/csse.2023.026823

    Abstract Accurate prediction of future events brings great benefits and reduces losses for society in many domains, such as civil unrest, pandemics, and crimes. Knowledge graph is a general language for describing and modeling complex systems. Different types of events continually occur, which are often related to historical and concurrent events. In this paper, we formalize the future event prediction as a temporal knowledge graph reasoning problem. Most existing studies either conduct reasoning on static knowledge graphs or assume knowledges graphs of all timestamps are available during the training process. As a result, they cannot effectively reason over temporal knowledge graphs… More >

  • Open Access

    ARTICLE

    DeepWalk Based Influence Maximization (DWIM): Influence Maximization Using Deep Learning

    Sonia1, Kapil Sharma1,*, Monika Bajaj2

    Intelligent Automation & Soft Computing, Vol.35, No.1, pp. 1087-1101, 2023, DOI:10.32604/iasc.2023.026134

    Abstract Big Data and artificial intelligence are used to transform businesses. Social networking sites have given a new dimension to online data. Social media platforms help gather massive amounts of data to reach a wide variety of customers using influence maximization technique for innovative ideas, products and services. This paper aims to develop a deep learning method that can identify the influential users in a network. This method combines the various aspects of a user into a single graph. In a social network, the most influential user is the most trusted user. These significant users are used for viral marketing as… More >

  • Open Access

    ARTICLE

    Multiple Object Tracking through Background Learning

    Deependra Sharma*, Zainul Abdin Jaffery

    Computer Systems Science and Engineering, Vol.44, No.1, pp. 191-204, 2023, DOI:10.32604/csse.2023.023728

    Abstract This paper discusses about the new approach of multiple object tracking relative to background information. The concept of multiple object tracking through background learning is based upon the theory of relativity, that involves a frame of reference in spatial domain to localize and/or track any object. The field of multiple object tracking has seen a lot of research, but researchers have considered the background as redundant. However, in object tracking, the background plays a vital role and leads to definite improvement in the overall process of tracking. In the present work an algorithm is proposed for the multiple object tracking… More >

  • Open Access

    ARTICLE

    Fusion Recommendation System Based on Collaborative Filtering and Knowledge Graph

    Donglei Lu1, Dongjie Zhu2,*, Haiwen Du3, Yundong Sun3, Yansong Wang2, Xiaofang Li4, Rongning Qu4, Ning Cao1, Russell Higgs5

    Computer Systems Science and Engineering, Vol.42, No.3, pp. 1133-1146, 2022, DOI:10.32604/csse.2022.021525

    Abstract The recommendation algorithm based on collaborative filtering is currently the most successful recommendation method. It recommends items to the user based on the known historical interaction data of the target user. Furthermore, the combination of the recommended algorithm based on collaborative filtration and other auxiliary knowledge base is an effective way to improve the performance of the recommended system, of which the Co-Factorization Model (CoFM) is one representative research. CoFM, a fusion recommendation model combining the collaborative filtering model FM and the graph embedding model TransE, introduces the information of many entities and their relations in the knowledge graph into… More >

Displaying 1-10 on page 1 of 5. Per Page  

Share Link