IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i11p1921-d831140.html
   My bibliography  Save this article

Hypergraph and Uncertain Hypergraph Representation Learning Theory and Methods

Author

Listed:
  • Liyan Zhang

    (College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China)

  • Jingfeng Guo

    (College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China)

  • Jiazheng Wang

    (College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China)

  • Jing Wang

    (College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China)

  • Shanshan Li

    (College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China)

  • Chunying Zhang

    (School of Science, North China University of Science and Technology, Tangshan 063210, China)

Abstract

With the advent of big data and the information age, the data magnitude of various complex networks is growing rapidly. Many real-life situations cannot be portrayed by ordinary networks, while hypergraphs have the ability to describe and characterize higher order relationships, which have attracted extensive attention from academia and industry in recent years. Firstly, this paper described the development process, the application areas, and the existing review research of hypergraphs; secondly, introduced the theory of hypergraphs briefly; then, compared the learning methods of ordinary graphs and hypergraphs from three aspects: matrix decomposition, random walk, and deep learning; next, introduced the structural optimization of hypergraphs from three perspectives: dynamic hypergraphs, hyperedge weight optimization, and multimodal hypergraph generation; after that, the applicability of three uncertain hypergraph models were analyzed based on three uncertainty theories: probability theory, fuzzy set, and rough set; finally, the future research directions of hypergraphs and uncertain hypergraphs were prospected.

Suggested Citation

  • Liyan Zhang & Jingfeng Guo & Jiazheng Wang & Jing Wang & Shanshan Li & Chunying Zhang, 2022. "Hypergraph and Uncertain Hypergraph Representation Learning Theory and Methods," Mathematics, MDPI, vol. 10(11), pages 1-22, June.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:11:p:1921-:d:831140
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/11/1921/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/11/1921/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Musavarah Sarwar & Gohar Ali, 2022. "A Theoretical Investigation Based on the Rough Approximations of Hypergraphs," Journal of Mathematics, Hindawi, vol. 2022, pages 1-19, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jing Wang & Jing Wang & Jingfeng Guo & Liya Wang & Chunying Zhang & Bin Liu, 2023. "Research Progress of Complex Network Modeling Methods Based on Uncertainty Theory," Mathematics, MDPI, vol. 11(5), pages 1-27, March.
    2. Liya Wang & Yaxun Dai & Renzhuo Wang & Yuwen Sun & Chunying Zhang & Zhiwei Yang & Yuqing Sun, 2022. "SEIARN: Intelligent Early Warning Model of Epidemic Spread Based on LSTM Trajectory Prediction," Mathematics, MDPI, vol. 10(17), pages 1-23, August.
    3. Jingfeng Guo & Chao Zheng & Shanshan Li & Yutong Jia & Bin Liu, 2022. "BiInfGCN: Bilateral Information Augmentation of Graph Convolutional Networks for Recommendation," Mathematics, MDPI, vol. 10(17), pages 1-16, August.
    4. Fengchun Liu & Sen Zhang & Weining Ma & Jingguo Qu, 2022. "Research on Attack Detection of Cyber Physical Systems Based on Improved Support Vector Machine," Mathematics, MDPI, vol. 10(15), pages 1-14, August.
    5. Xiao Chen & Tong Hao & Li Han & Meng Leng & Jing Chen & Jingfeng Guo, 2022. "Heterogeneous Network Embedding Based on Random Walks of Type and Inner Constraint," Mathematics, MDPI, vol. 10(15), pages 1-20, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:11:p:1921-:d:831140. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.