Multivariate multiscale dispersion Lempel–Ziv complexity for fault diagnosis of machinery with multiple channels
Bibliographic record
Abstract
Lempel–Ziv complexity (LZC), as a nonlinear feature in information science, has shown great promise in detecting correlations and capturing dynamic changes in single-channel time series. However, its application to multichannel data has been largely unexplored, while the complexity of real-world systems demands the utilization of data collected from multiple sensors or channels so as to extract distinguishable fault features for fault diagnosis. This paper proposes a novel method called multivariate multiscale dispersion Lempel–Ziv complexity (mvMDLZC) to extract the fault features hidden in multi-source information. First, multivariate embedding theory is applied to obtain multivariate embedded vectors and multivariate dispersion patterns, which can reflect the inherent relationships in the multichannel series. Second, by assigning labels to these patterns, the original multichannel time series can be transformed into a symbolic sequence with multiple symbols instead of the original binary conversion, enabling the accurate recovery of the system dynamics . Finally, the complexity counter value and normalized LZC are calculated for the complexity measure. Experimental results using synthetic and real-world datasets demonstrate that mvMDLZC outperforms existing LZC-based methods and multivariate dispersion entropy in recognizing different states of mechanical systems . Additionally, mvMDLZC exhibits robustness in handling challenges such as small sample datasets and noise interference, making it suitable for real industrial applications. These findings highlight the potential of mvMDLZC as a valuable approach for dissecting multichannel systems across various real-world scenarios.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".