ArticleScientific reports2025
Semantic ECG hash similarity graph.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
Graph-based methods have made significant progress in addressing the dependent correlations among ECG time series variables. However, most existing graph structures primarily focus on local similarity while overlooking global semantic correlation. Additionally, the adjacency matrix is highly susceptible to noise interference, leading to unreliable node connections. In this paper, we present a novel graph generation learning framework that incorporates semantic hash coding to capture the intricate associations both within and between ECG signals, thereby significantly enhancing the retrieval efficiency of subsequent graph-based deep learning models. Specifically, the Semantic Hash Similarity Graph (SHSG) initially leverages the similarity within the label space to generate a hash representation for the supervised signal. Subsequently, a lightweight linear hash function is utilized to produce a hash representation for the unseen signal. Thereafter, a comprehensive global hash dictionary is systematically constructed. Finally, the graph topology is meticulously assembled by leveraging Hamming similarity. Additionally, to ensure the maintenance of semantic similarity, we propose an iterative optimization approach in the orthogonal domain for generating hash representations. To validate the efficacy of the generated graph, we utilized a fast Graph Convolutional Network (GCN) for ECG recognition. The experimental outcomes on multiple publicly available ECG datasets corroborate the robustness and effectiveness of our proposed method.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.