IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v200y2025ip2s0960077925010483.html

Multiscale Weighted Motif Entropy based on Radius Constrained Arc-Limited Penetrable Visibility Graph: Concepts and applications

Author

Listed:
  • Li, Yongjian
  • Chen, Zhaoyang
  • Wu, Yuyuan
  • Gan, Yi
  • Lv, Qiuxia
  • Xiong, Qing

Abstract

The complexity, nonlinearity, and noise interference inherent in vibration signals pose a continuous challenge to the accurate diagnosis of rolling bearing faults. Under these conditions, traditional signal processing techniques often fail to robustly extract informative features. In recent years, visibility graphs have garnered significant attention due to their ability to effectively integrate graph theory and nonlinear dynamics in the analysis of complex signals. However, traditional visibility graphs exhibit poor noise resistance and lack quantitative evaluation of graph structures. Therefore, this study proposes a Radius Constrained Arc-Limited Penetrable Visibility Graph (RCALPVG) methodology and employs the Weighted Motif Entropy (WME) technique to quantitatively evaluate the RCALPVG network, thereby quantifying the complexity of its graph structure. First, the RCALPVG is compared with commonly used visibility graph models in terms of their features. The results indicate that RCALPVG offers significant advantages in classifying various signal types and exhibits greater robustness against noise interference. Next, the method was applied to diagnose rolling bearing faults. By integrating multiscale analysis, a graph multiscale WME model was developed to characterize various fault features of rolling bearings. Then, these features were input into a classification algorithm for diagnosing rolling bearing fault tasks. Multiple experiments were conducted using a real-world dataset to validate the proposed method’s efficacy. The experimental results demonstrate that the proposed method achieved the highest fault recognition accuracy under two specific operating conditions. Even with only 10% of the training dataset, the method exhibited excellent classification ability, with an average recognition accuracy of 98.64%. Therefore, these results validate the efficacy and feasibility of using WME in the graph domain for extracting fault features and performing rolling bearing fault diagnosis.

Suggested Citation

  • Li, Yongjian & Chen, Zhaoyang & Wu, Yuyuan & Gan, Yi & Lv, Qiuxia & Xiong, Qing, 2025. "Multiscale Weighted Motif Entropy based on Radius Constrained Arc-Limited Penetrable Visibility Graph: Concepts and applications," Chaos, Solitons & Fractals, Elsevier, vol. 200(P2).
  • Handle: RePEc:eee:chsofr:v:200:y:2025:i:p2:s0960077925010483
    DOI: 10.1016/j.chaos.2025.117035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077925010483
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2025.117035?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Feng, Deyue & Li, Meizhu & Zhang, Qi, 2025. "Node clustering in complex networks based on structural similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 658(C).
    2. J. Alberto Conejero & Andrei Velichko & Òscar Garibo-i-Orts & Yuriy Izotov & Viet-Thanh Pham, 2024. "Exploring the Entropy-Based Classification of Time Series Using Visibility Graphs from Chaotic Maps," Mathematics, MDPI, vol. 12(7), pages 1-22, March.
    3. Wang, Tao & Khoo, Shin Yee & Ong, Zhi Chao & Siow, Pei Yi & Wang, Teng, 2025. "Distance similarity entropy: A sensitive nonlinear feature extraction method for rolling bearing fault diagnosis," Reliability Engineering and System Safety, Elsevier, vol. 255(C).
    4. Feng, Deyue & Chen, Luyuan & Li, Meizhu & Zhang, Qi, 2025. "Node clustering in complex networks based on the euclidean distance of structural characteristics," Chaos, Solitons & Fractals, Elsevier, vol. 201(P1).
    5. Cao, Jie & Ding, Cuiling & Shi, Benyun, 2019. "Motif-based functional backbone extraction of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 526(C).
    Full references (including those not matched with items on IDEAS)

    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.
    1. Carlos Henrique Gomes Ferreira & Fabricio Murai & Ana P C Silva & Martino Trevisan & Luca Vassio & Idilio Drago & Marco Mellia & Jussara M Almeida, 2022. "On network backbone extraction for modeling online collective behavior," PLOS ONE, Public Library of Science, vol. 17(9), pages 1-36, September.
    2. Yunfang Ma & Jose M. Sallan & Oriol Lordan, 2024. "Rail Transit Networks and Network Motifs: A Review and Research Agenda," Sustainability, MDPI, vol. 16(9), pages 1-21, April.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:chsofr:v:200:y:2025:i:p2:s0960077925010483. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.