Automatic heart sound classification from segmented/unsegmented phonocardiogram signals using time and frequency features
Bibliographic record
Abstract
OBJECTIVE: Heart abnormality detection using heart sound signals (phonocardiogram (PCG)) has been an active research area for the last few decades. In this paper, automatic heart sound classification using segmented and unsegmented PCG signals is presented. APPROACH: In this paper: (i) we perform an in-depth analysis of various time and frequency domain features, followed by experimental determination of effective feature subsets for improved classification performance; (ii) both segmented and unsegmented PCG signals are studied and important results concerning the respective feature subsets and their classification performances are reported; and (iii) different classification algorithms, including the support vector machine, kth nearest neighbor, decision tree, ensemble classifier, artificial neural network and long short-term memory network (LSTMs), are employed to evaluate the performance of the proposed feature subsets and their comparison with other established features and methods is presented. MAIN RESULTS: It is observed that LSTM performs better on mel-frequency cepstral coefficient (MFCC) features extracted from unsegmented PCG data, with an area under curve (AUC) score of 91.39%, however, the MFCC features do not show a consistent performance with other classifiers (the second highest AUC score is 62.08% with the decision tree classifier). In contrast, in the case of time-frequency features from segmented data, the performance of all the classifiers is appreciable with AUC scores over 70%. In particular, the conventional machine learning techniques shows consistency in achieving over 80% in AUC scores. Significanc e: The results of this study highlight the importance of time and frequency domain features. Thus it is necessary to employ both the time and frequency features of segmented PCG signals to achieve improved classification.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".