Related Experiment Video
Updated: Aug 8, 2026

07:05
A Protocol for the Administration of Real-Time fMRI Neurofeedback Training
Published on: August 24, 2017
Network analysis of the tinnitus functional index (TFI)
Michael S Vitevitch1, Satori Guraedy1, Eilaf Narejo2
1University of Kansas, KS, USA.
International Journal of Audiology
|August 6, 2026
Summary
Network psychometrics revealed key Tinnitus Functional Index (TFI) items for tinnitus disorder interventions. The Auditory subscale emerged as a significant area for future tinnitus research.
Area of Science:
- Speech-language-hearing sciences
- Psychometrics
- Tinnitus research
Background:
- Tinnitus disorder significantly impacts daily life.
- The Tinnitus Functional Index (TFI) is a standard tool for assessing tinnitus-related disability.
- Understanding the interconnectedness of TFI items can refine assessment and intervention.
Purpose of the Study:
- To apply network psychometrics to the Tinnitus Functional Index (TFI).
- To identify critical items within the TFI for targeted interventions.
- To explore the network structure of tinnitus disorder symptoms.
Main Methods:
- Utilized network psychometrics on data from 931 individuals with tinnitus who completed the TFI.
- Analyzed item correlations to construct a network representing tinnitus disorder.
- Applied micro-level and meso-level network metrics.
Main Results:
- Identified 5 key TFI items with high centrality for potential intervention targets.
- Network analysis revealed item communities mirroring the original TFI subscales.
- The Auditory subscale was highlighted as a potentially crucial component for future tinnitus research.
Conclusions:
- Network psychometrics offers a novel approach to understanding tinnitus disorder.
- Specific TFI items can be prioritized for intervention based on network centrality.
- The Auditory subscale warrants further investigation in the context of tinnitus research.
Related Concept Videos
Discrete-Time Fourier Series
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
Fast Fourier Transform
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...

