IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v174y2023ics0960077923007300.html
   My bibliography  Save this article

Indices from visibility graph complexity of spontaneous speech signal: An efficient nonlinear tool for Alzheimer's disease diagnosis

Author

Listed:
  • Nasrolahzadeh, Mahda
  • Mohammadpoory, Zeynab
  • Haddadnia, Javad

Abstract

Interest in dynamical data analytics of human speech related to the diagnosis of Alzheimer's disease (AD) has recently risen. This study aims to scrutinize the dynamic variations in AD speech based on concepts called complexity and fractality. Towards this goal, the visibility graph (VG) of the spontaneous speech time series as a quantitative approach is proposed to distinguish healthy subjects from those with Alzheimer's. The dynamical patterns of the speech signals are analyzed between three stages of AD and healthy subjects by examining some specific kinds of these measures, known as graph index complexity (GIC) and power of scale-freeness (PS) in VG. The results show the practical ability of the GIC and PS to detect the underlying pathological mechanism of Alzheimer's disease. In addition, it is found that all speech series have visibility graphs with a power-law topology, and fractality in them is reflected by a mechanism related to the brain system pathology, which affects the language skills of people.

Suggested Citation

  • Nasrolahzadeh, Mahda & Mohammadpoory, Zeynab & Haddadnia, Javad, 2023. "Indices from visibility graph complexity of spontaneous speech signal: An efficient nonlinear tool for Alzheimer's disease diagnosis," Chaos, Solitons & Fractals, Elsevier, vol. 174(C).
    • Handle: RePEc:eee:chsofr:v:174:y:2023:i:c:s0960077923007300
    DOI: 10.1016/j.chaos.2023.113829
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077923007300
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2023.113829?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Kim, Jongkwang & Wilhelm, Thomas, 2008. "What is a complex graph?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(11), pages 2637-2652.
    2. Rudolf Hanel & Bernat Corominas-Murtra & Bo Liu & Stefan Thurner, 2017. "Fitting power-laws in empirical data with estimators that work for all exponents," PLOS ONE, Public Library of Science, vol. 12(2), pages 1-15, February.
    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. Mehmet N. Aydin & N. Ziya Perdahci, 2019. "Dynamic network analysis of online interactive platform," Information Systems Frontiers, Springer, vol. 21(2), pages 229-240, April.
    2. Mahmoud Saleh & Yusef Esa & Ahmed Mohamed, 2018. "Applications of Complex Network Analysis in Electric Power Systems," Energies, MDPI, vol. 11(6), pages 1-16, May.
    3. Tuğal, İhsan & Karcı, Ali, 2019. "Comparisons of Karcı and Shannon entropies and their effects on centrality of social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 352-363.
    4. da Cunha, Éverton Fernandes & da Fontoura Costa, Luciano, 2022. "On hypercomplex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    5. Lavanya Sivakumar & Matthias Dehmer, 2012. "Towards Information Inequalities for Generalized Graph Entropies," PLOS ONE, Public Library of Science, vol. 7(6), pages 1-14, June.
    6. Glover, Fred & Lewis, Mark & Kochenberger, Gary, 2018. "Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems," European Journal of Operational Research, Elsevier, vol. 265(3), pages 829-842.
    7. Aguilar-Velázquez, D. & Guzmán-Vargas, L., 2017. "Synchronization and 1/f signals in interacting small-world networks," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 418-425.
    8. Zenil, Hector & Soler-Toscano, Fernando & Dingle, Kamaludin & Louis, Ard A., 2014. "Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 341-358.
    9. Wang, Jiang & Yang, Chen & Wang, Ruofan & Yu, Haitao & Cao, Yibin & Liu, Jing, 2016. "Functional brain networks in Alzheimer’s disease: EEG analysis based on limited penetrable visibility graph and phase space method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 460(C), pages 174-187.
    10. Raducha, Tomasz & Gubiec, Tomasz, 2017. "Coevolving complex networks in the model of social interactions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 427-435.
    11. Wang, Jiqiang, 2019. "Disturbance attenuation of complex dynamical systems through interaction topology design," Applied Mathematics and Computation, Elsevier, vol. 355(C), pages 576-584.
    12. Wim Ectors & Bruno Kochan & Davy Janssens & Tom Bellemans & Geert Wets, 2019. "Exploratory analysis of Zipf’s universal power law in activity schedules," Transportation, Springer, vol. 46(5), pages 1689-1712, October.
    13. Nelson, Kenric P., 2022. "Independent Approximates enable closed-form estimation of heavy-tailed distributions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 601(C).
    14. Frank Emmert-Streib, 2013. "Structural Properties and Complexity of a New Network Class: Collatz Step Graphs," PLOS ONE, Public Library of Science, vol. 8(2), pages 1-14, February.
    15. Wei Zhu & Ding Ma & Zhigang Zhao & Renzhong Guo, 2020. "Investigating the Complexity of Spatial Interactions between Different Administrative Units in China Using Flickr Data," Sustainability, MDPI, vol. 12(22), pages 1-12, November.
    16. Mikołaj Morzy & Tomasz Kajdanowicz & Przemysław Kazienko, 2017. "On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy," Complexity, Hindawi, vol. 2017, pages 1-12, November.
    17. Lin, Yun Hui & Wang, Yuan & Lee, Loo Hay & Chew, Ek Peng, 2021. "Consistency matters: Revisiting the structural complexity for supply chain networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    18. Mehmet N. Aydin & N. Ziya Perdahci, 0. "Dynamic network analysis of online interactive platform," Information Systems Frontiers, Springer, vol. 0, pages 1-12.

    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:174:y:2023:i:c:s0960077923007300. 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.