Signal2Symbol: 神经符号时序推理用于可解释的生理时间序列异常检测
摘要
本文介绍了Signal2Symbol,这是一个神经符号框架,用于在类似ECG和EEG的生理时间序列数据中进行可解释的异常检测,利用符号化分词和时序推理,以产生对异常模式的可解释说明。
arXiv:2609.26820v1 Announce Type: new
Abstract: Physiological time series such as electrocardiograms (ECG) and electroencephalograms (EEG) exhibit complex temporal structure, substantial acquisition variability, and a strong need for transparent decision-making. Although deep models can achieve high detection performance, they often provide limited insight into why a segment is anomalous, how local anomalies relate over time, and whether a detection belongs to a broader recurring pattern. We propose Signal2Symbol, a neuro-symbolic framework for explainable biosignal anomaly detection. The method first converts ECG/EEG signals into symbolic sequences using either a learned VQ-VAE (Vector Quantized Variational Autoencoder) codebook or a SAX (Symbolic Aggregate approXimation) baseline. It then constructs bigram enriched token-window transactions and scores anomalies through rare itemset evidence derived from minimal rare itemset mining. Detected anomalous windows are merged into intervals and related using Allen interval algebra, enabling composite temporal explanations such as escalation chains, artifact overlap, and cross-channel synchrony. Finally, we introduce a rare temporal concept lattice based on Formal Concept Analysis (FCA), which groups anomalous intervals by shared rare symbolic evidence, Allen temporal relations, channel context, and robustness attributes. The resulting Galois lattice compresses many local detections into interpretable families of temporal-symbolic anomalies. We evaluate on three public benchmarks: MIT-BIH Arrhythmia (beat-level ECG), PTB-XL (record-level ECG), and the Bonn EEG dataset (segment-level EEG). We stress-test robustness under additive noise and baseline-wander perturbations. The results highlight the value of neuro-symbolic tokenization for temporal anomaly analysis and show that Allen/FCA reasoning provides compact, interpretable summaries of local detections.
查看缓存全文
缓存时间: 2026/09/24 09:32
# Signal2Symbol: Neuro-Symbolic Temporal Reasoning for Explainable Physiological Time-Series Anomaly Detection
Source: [https://arxiv.org/html/2609.26820](https://arxiv.org/html/2609.26820)
Naser Mansour1, Sidahmed Benabderrahmane1\*, Ameer Rahwan2Affiliation:Affiliation:1New York University, NYUAD, Computer Science Department, Division of Science\.Affiliation:2Koc University, Faculty of Medicine, Turkey\.Affiliation:\{nmd9736@nyu\.edu; sidahmed\.benabderrahmane@gmail\.com; arahwan24@ku\.edu\.tr\}
###### Abstract
Physiological time series such as electrocardiograms \(ECG\) and electroencephalograms \(EEG\) exhibit complex temporal structure, substantial acquisition variability, and a strong need for transparent decision\-making\. Although deep models can achieve high detection performance, they often provide limited insight into*why*a segment is anomalous,*how*local anomalies relate over time, and*whether*a detection belongs to a broader recurring pattern\. We proposeSignal2Symbol, a neuro\-symbolic framework for explainable biosignal anomaly detection\. The method first converts ECG/EEG signals into symbolic sequences using either a learned VQ\-VAE \(Vector Quantized Variational Autoencoder\) codebook or a SAX \(Symbolic Aggregate approXimation\) baseline\. It then constructs bigram\-enriched token\-window transactions and scores anomalies through rare itemset evidence derived from minimal rare itemset mining\. Detected anomalous windows are merged into intervals and related using Allen interval algebra, enabling composite temporal explanations such as escalation chains, artifact overlap, and cross\-channel synchrony\. Finally, we introduce arare temporal concept latticebased on Formal Concept Analysis \(FCA\), which groups anomalous intervals by shared rare symbolic evidence, Allen temporal relations, channel context, and robustness attributes\. The resulting Galois lattice compresses many local detections into interpretable families of temporal\-symbolic anomalies\. We evaluate on three public benchmarks—MIT\-BIH Arrhythmia \(beat\-level ECG\), PTB\-XL \(record\-level ECG\), and the Bonn EEG dataset \(segment\-level EEG\)—and stress\-test robustness under additive noise and baseline\-wander perturbations\. The results highlight the value of neuro\-symbolic tokenization for temporal anomaly analysis and show that Allen/FCA reasoning provides compact, interpretable summaries of local detections\.
###### Index Terms:
Physiological Time Series, Anomaly Detection, Allen Algebra, Formal Concept Analysis, Galois lattice, XAI\.
## IIntroduction
Physiological time\-series anomaly detection is central to e\-health, clinical monitoring, and biomedical decision support\[[1](https://arxiv.org/html/2609.26820#bib.bib1),[2](https://arxiv.org/html/2609.26820#bib.bib2)\]\. Signals such as ECG and EEG contain subtle temporal structures that may indicate arrhythmias, ischemic changes, seizures, abnormal brain dynamics, or acquisition artifacts\[[3](https://arxiv.org/html/2609.26820#bib.bib3),[4](https://arxiv.org/html/2609.26820#bib.bib4)\]\. In practice, physiological signals are affected by sensor noise, baseline wander, device differences, missing channels, and population shift\. A useful anomaly detector must therefore be robust to drift while also providing interpretable evidence\.
Most modern machine learning methods output a numerical anomaly score or a saliency heatmap\. Such outputs may be useful for ranking, but they often fail to answer three questions that matter to analysts and clinicians:*What symbolic pattern made this segment unusual?**How does this anomaly relate to nearby events over time?**Does this interval belong to a recurring family of anomalies?*
Key idea\.We convert continuous physiological signals into symbolic sequences, detect rare symbolic co\-occurrences, lift local detections into temporal intervals, and organize the resulting intervals into interpretable concept lattices\. The pipeline follows:
signal\\displaystyle\\text\{signal\}→tokens→transactions→rare patterns\\displaystyle\\rightarrow\\text\{tokens\}\\rightarrow\\text\{transactions\}\\rightarrow\\text\{rare patterns\}→intervals→Allen relations→FCA concepts\.\\displaystyle\\rightarrow\\text\{intervals\}\\rightarrow\\text\{Allen relations\}\\rightarrow\\text\{FCA concepts\}\.This design combines neural representation learning, symbolic rarity mining, temporal reasoning, and concept\-based explanation\.
Contributions\.This paper makes four main contributions:
- •Symbolization for biosignals:We compare learnedVQ\-VAE tokenizationagainstSAXas a transparent symbolic baseline for ECG/EEG signals\.
- •Rare\-pattern anomaly scoring:We propose a rarity\-based scoring function that aggregates evidence from minimal rare itemsets over bigram\-enriched sliding symbolic windows, and connect the weighting to an information\-theoretic surprisal interpretation\.
- •Temporal interval reasoning:We transform high\-scoring windows into anomaly intervals and use Allen interval algebra to detect temporal configurations such as escalation, artifact overlap, staged onset, and cross\-channel synchrony\.
- •Rare temporal concept lattices:We introduce an FCA/Galois\-lattice layer that groups anomalous intervals according to shared rare motifs, Allen relations, channel context, reconstruction fidelity, and robustness attributes, yielding compact visual explanations\.
## IIRelated Work
Symbolic representations of time series\.Symbolic Aggregate approXimation \(SAX\)\[[9](https://arxiv.org/html/2609.26820#bib.bib9)\]and related discretization methods transform continuous time series into symbolic strings, enabling motif discovery, rule mining, indexing, and interpretable analysis\[[16](https://arxiv.org/html/2609.26820#bib.bib16)\]\. SAX is attractive because it is simple, fast, and transparent, but its quantization is based mainly on amplitude discretization and may miss morphology\-level differences in ECG or EEG waveforms\[[17](https://arxiv.org/html/2609.26820#bib.bib17)\]\.
Discrete neural tokenizers\.Vector\-Quantized VAEs \(VQ\-VAE\)\[[10](https://arxiv.org/html/2609.26820#bib.bib10)\]learn a discrete codebook in a latent space\. Each signal window is encoded, assigned to the nearest codebook vector, and decoded for reconstruction\. The code index can be interpreted as a learned symbol\. Compared with fixed discretization, VQ\-VAE learn prototypes to capture recurring waveform shapes, for a suitable biosignal tokenization\.
Anomaly detection and explainability in biosignals\.ECG/EEG anomaly detection spans feature\-based models, density estimators, isolation\-based methods, autoencoders, CNNs, transformers, and hybrid pipelines\[[5](https://arxiv.org/html/2609.26820#bib.bib5),[1](https://arxiv.org/html/2609.26820#bib.bib1),[2](https://arxiv.org/html/2609.26820#bib.bib2),[3](https://arxiv.org/html/2609.26820#bib.bib3),[4](https://arxiv.org/html/2609.26820#bib.bib4)\]\. Explainability is often provided through saliency maps or reconstruction errors\. In contrast, symbolic approaches can provide direct evidence in the form of motifs, co\-occurrences, and rules\[[6](https://arxiv.org/html/2609.26820#bib.bib6)\]\.
Temporal reasoning\.Allen interval algebra\[[8](https://arxiv.org/html/2609.26820#bib.bib8)\]defines qualitative relations between time intervals, includingbefore,meets,overlaps,starts,during, andfinishes\. In clinical monitoring, interval\-level reasoning helps convert local detections into higher\-level temporal patterns such as escalation, repeated bursts, or artifact\-contaminated detections\.
Formal Concept Analysis\.Formal Concept Analysis \(FCA\)\[[11](https://arxiv.org/html/2609.26820#bib.bib11)\]derives a concept lattice from a binary relation between objects and attributes\. Each formal concept groups a set of objects sharing a maximal set of attributes\. FCA has been used for interpretable knowledge discovery because it organizes patterns in a lattice structure rather than as an unstructured list of rules\. In this work, we use FCA as an explanation layer over detected anomaly intervals: objects are anomalies, and attributes are rare symbolic evidence, Allen relations, and signal\-context predicates\.
## IIIProblem Formulation and Overview
### III\-AProblem Statement
Letx\(t\)∈ℝCx\(t\)\\in\\mathbb\{R\}^\{C\}denote a multichannel physiological time series of lengthTTwithCCchannels, corresponding to ECG leads or EEG sensors\. We segmentx\(t\)x\(t\)intoNNunits:
\{\(xi,\[tis,tie\]\)\}i=1N,\\\{\(x\_\{i\},\[t\_\{i\}^\{s\},t\_\{i\}^\{e\}\]\)\\\}\_\{i=1\}^\{N\},where eachxix\_\{i\}is either an ECG beat\-centered window or a fixed\-length EEG window\.
The objective is to produce:
1. 1\.a record\-level anomaly scoreSrec\(x\)S\_\{\\text\{rec\}\}\(x\);
2. 2\.a sequence of window\-level scores\{Swin\(wj\)\}\\\{S\_\{\\text\{win\}\}\(w\_\{j\}\)\\\};
3. 3\.anomaly intervalsℐ\(x\)=\{\(ajs,aje,confj\)\}\\mathcal\{I\}\(x\)=\\\{\(a\_\{j\}^\{s\},a\_\{j\}^\{e\},\\text\{conf\}\_\{j\}\)\\\};
4. 4\.local explanations through rare symbolic patterns;
5. 5\.temporal explanations through Allen relations;
6. 6\.concept\-level explanations through an FCA lattice\.
### III\-BPipeline Overview
Figure[1](https://arxiv.org/html/2609.26820#S3.F1)summarizes the complete pipeline\. Raw signals are first symbolized using SAX or VQ\-VAE\. The resulting token stream is converted into bigram\-enriched sliding\-window transactions\. Rare itemsets define a symbolic anomaly score\. High\-scoring windows are merged into anomaly intervals\. Allen relations are computed between intervals\. Finally, FCA organizes anomalous intervals into a rare temporal concept lattice\.
Fig\. 1:Signal2Symbol pipeline\. Raw ECG/EEG signals are tokenized using SAX or VQ\-VAE, transformed into bigram\-enriched symbolic transactions, scored by rare\-pattern evidence, merged into intervals, related through Allen algebra, and organized into FCA/Galois lattices for visual explanation\.
## IVSymbolization of Time Series
### IV\-ASAX Baseline
Given a univariate seriesy\(t\)y\(t\), SAX\[[9](https://arxiv.org/html/2609.26820#bib.bib9)\]applies z\-normalization, Piecewise Aggregate Approximation \(PAA\), and discretization into an alphabet of sizeAA\. For multichannel data, we apply SAX per channel or per selected channel group and concatenate the resulting symbols\. SAX provides a simple and transparent baseline for symbolic anomaly detection\.
Hyperparameters\.We vary alphabet sizeA∈\{4,5,6\}A\\in\\\{4,5,6\\\}and PAA resolution\. These parameters control the trade\-off between coarse robustness and fine symbolic resolution\.
### IV\-BVQ\-VAE Tokenization
VQ\-VAE\[[10](https://arxiv.org/html/2609.26820#bib.bib10)\]learns a dictionary of prototypical signal shapes\. For each segmentxix\_\{i\}, the encoder produces a latent vector:hi=Eθ\(xi\)∈ℝdh\_\{i\}=E\_\{\\theta\}\(x\_\{i\}\)\\in\\mathbb\{R\}^\{d\}\. The vector is mapped to the nearest codebook entry:zi=argmink∈\{1,…,K\}‖hi−ek‖2z\_\{i\}=\\arg\\min\_\{k\\in\\\{1,\\ldots,K\\\}\}\\\|h\_\{i\}\-e\_\{k\}\\\|\_\{2\}, where\{ek\}k=1K\\\{e\_\{k\}\\\}\_\{k=1\}^\{K\}is the learned codebook\. The selected entry is decoded:x^i=Dϕ\(ezi\)\\hat\{x\}\_\{i\}=D\_\{\\phi\}\(e\_\{z\_\{i\}\}\)\. The discrete indexziz\_\{i\}is converted into a categorical symbolic token:BziB\_\{z\_\{i\}\}for an ECG beat\-centered segment andEziE\_\{z\_\{i\}\}for an EEG window\. Thus, an ECG segment assigned to codebook entry1717becomesB\_17, while an EEG segment assigned to entry4242becomesE\_42\. Because each token inherits the timestamp interval\[tis,tie\]\[t\_\{i\}^\{s\},t\_\{i\}^\{e\}\]of its source segment, the tokenizer outputs a time\-aligned symbolic sequence\.
Training\.We train VQ\-VAE exclusively on*normal*signal segments\. The codebook therefore learns prototypes of typical waveform morphologies\. When an anomalous segment is presented at test time, it is mapped to its nearest normal prototype; the anomaly signal arises from unusual*combinations*of these prototypes across sliding windows\. This relational design means that codebook granularity and utilization directly affect sensitivity: dead codes reduce effective resolution, motivating the use of exponential moving average \(EMA\) codebook updates and codebook utilization monitoring\.
Reconstruction fidelity\.We also record the per\-segment reconstruction errorri=‖xi−x^i‖2r\_\{i\}=\\\|x\_\{i\}\-\\hat\{x\}\_\{i\}\\\|\_\{2\}, which provides a complementary anomaly signal\. Segments that are poorly represented by any codebook prototype yield high reconstruction error and are flagged via a dedicated FCA attribute \(Section[VIII](https://arxiv.org/html/2609.26820#S8)\)\.
Segmentation\.ECG signals are represented using either R\-peak\-centered beat windows or complete record\-level segments, depending on the evaluation granularity\. EEG signals are divided into fixed\-length windows with overlap\.
Ablations\.We study codebook sizesK∈\{128,256,512\}K\\in\\\{128,256,512\\\}and analyze the impact of dead codes, reconstruction quality, and token entropy\.
Fig\. 2:VQ\-VAE tokenization\. Each ECG beat or EEG window is encoded, assigned to the nearest codebook prototype, reconstructed through a decoder, and represented as a symbolic token aligned with timestamps\.The output of this section is a timestamped symbolic sequence:
S\(x\)=\{\(si,\[tis,tie\]\)\}i=1N,si∈\{1,…,K\}orΣ\.S\(x\)=\\\{\(s\_\{i\},\[t\_\{i\}^\{s\},t\_\{i\}^\{e\}\]\)\\\}\_\{i=1\}^\{N\},\\quad s\_\{i\}\\in\\\{1,\\ldots,K\\\}\\ \\text\{or\}\\ \\Sigma\.
## VTransaction Construction and Rare Pattern Mining
### V\-AWindow\-to\-Transaction Mapping
We slide a symbolic window of lengthWWtokens overS\(x\)S\(x\)\. Each symbolic window is transformed into a transaction:
wj=\{si:i∈windowj\}\.w\_\{j\}=\\\{s\_\{i\}:i\\in\\text\{window \}j\\\}\.
Bigram enrichment\.Converting a symbolic window to a set discards sequential order, which may cause the method to miss ordering\-sensitive anomalies \(e\.g\., ST\-elevation*followed by*T\-wave inversion in ECG\)\. To partially recover ordering information while remaining within the itemset mining framework, we augment each transaction with consecutive token bigrams:
wj\+=wj∪\{\(si→si\+1\):i,i\+1∈windowj\}\.w\_\{j\}^\{\+\}=w\_\{j\}\\;\\cup\\;\\\{\(s\_\{i\}\\\!\\to\\\!s\_\{i\+1\}\):i,i\\\!\+\\\!1\\in\\text\{window \}j\\\}\.For example, the token sequence\[A,B,C\]\[A,B,C\]yields the enriched transaction\{A,B,C,A→B,B→C\}\\\{A,B,C,A\{\\to\}B,B\{\\to\}C\\\}\. Bigrams add lightweight order sensitivity without requiring a full sequential pattern miner\. The corresponding transaction database is:
𝒯=\{\(wj\+,\[τjs,τje\]\)\}j=1M\.\\mathcal\{T\}=\\\{\(w\_\{j\}^\{\+\},\[\\tau\_\{j\}^\{s\},\\tau\_\{j\}^\{e\}\]\)\\\}\_\{j=1\}^\{M\}\.where \(τjs\\tau\_\{j\}^\{s\},τje\\tau\_\{j\}^\{e\}\) is the time interval spanned by the tokens inside transaction \(wj\+w\_\{j\}^\{\+\}\)\.
### V\-BRare Itemsets and Rare Rules
LetIIbe an itemset\. Its support on the normal training transaction database is:
supp\(I\)=1\|𝒯train\|∑w∈𝒯train𝟏\[I⊆w\]\.\\text\{supp\}\(I\)=\\frac\{1\}\{\|\\mathcal\{T\}\_\{\\text\{train\}\}\|\}\\sum\_\{w\\in\\mathcal\{T\}\_\{\\text\{train\}\}\}\\mathbf\{1\}\[I\\subseteq w\]\.An itemset is rare ifsupp\(I\)≤τ\\text\{supp\}\(I\)\\leq\\tau\. We denote the family of mined rare itemsets asℛ\\mathcal\{R\}\.
Monotonicity of rarity\.Ifsupp\(I\)≤τ\\text\{supp\}\(I\)\\leq\\tau, then for any supersetI′⊃II^\{\\prime\}\\supset I,supp\(I′\)≤supp\(I\)≤τ\\text\{supp\}\(I^\{\\prime\}\)\\leq\\text\{supp\}\(I\)\\leq\\tau\. Therefore the family of rare itemsets is*upward\-closed*, andminimal rare itemsets\(MRIs\) serve as generators of the entire rare family\. Mining only MRIs avoids redundancy: we identify the boundary between frequent and rare without enumerating exponentially many supersets\[[7](https://arxiv.org/html/2609.26820#bib.bib7)\]\.
Mining backend\.We use a level\-wise BtB \(Break\-the\-Barrier\) algorithm that extends Apriori with a rarity boundary: frequent itemsets at levelkkgenerate candidates at levelk\+1k\\\!\+\\\!1; candidates whose support falls belowτ\\tauare recorded as MRIs and excluded from further expansion\. This yields the complete set of MRIs efficiently\.
## VIRare\-Pattern Anomaly Scoring
### VI\-AWindow\-Level Score
For a transaction windowwjw\_\{j\}, we define:
Swin\(wj\)=∑I∈ℛ:I⊆wjα\(I\),S\_\{\\text\{win\}\}\(w\_\{j\}\)=\\sum\_\{I\\in\\mathcal\{R\}:\\;I\\subseteq w\_\{j\}\}\\alpha\(I\),\(1\)where:
α\(I\)=g\(\|I\|\)supp\(I\)\+ε\.\\alpha\(I\)=\\frac\{g\(\|I\|\)\}\{\\text\{supp\}\(I\)\+\\varepsilon\}\.\(2\)Hereg\(\|I\|\)=log\(1\+\|I\|\)g\(\|I\|\)=\\log\(1\+\|I\|\)andε\\varepsilonis a small constant for numerical stability\.
Information\-theoretic interpretation\.The weightα\(I\)\\alpha\(I\)is inspired by surprisal: rarer itemsets should receive larger weights\. Instead of using the logarithmic term−logsupp\(I\)\-\\log\\mathrm\{supp\}\(I\), we use the inverse\-frequency factor1/\(supp\(I\)\+ϵ\)1/\(\\mathrm\{supp\}\(I\)\+\\epsilon\)as a stronger rarity amplifier, since it grows faster as support approaches zero\. The length factorg\(\|I\|\)=log\(1\+\|I\|\)g\(\|I\|\)=\\log\(1\+\|I\|\)mildly favors structured multi\-token co\-occurrences over rare singletons\.
### VI\-BRecord\-Level Score
A record\-level anomaly score aggregates the most suspicious windows:
Srec\(x\)=TopKMean\(\{Swin\(wj\)\}j=1M\)\.S\_\{\\text\{rec\}\}\(x\)=\\operatorname\{TopKMean\}\\left\(\\\{S\_\{\\text\{win\}\}\(w\_\{j\}\)\\\}\_\{j=1\}^\{M\}\\right\)\.\(3\)Top\-KKaggregation is robust to isolated noise while preserving localized abnormal bursts\.
### VI\-CInterval Extraction
Window scores are transformed into anomaly intervals through thresholding and merging:
1. 1\.markwjw\_\{j\}anomalous ifSwin\(wj\)\>γS\_\{\\text\{win\}\}\(w\_\{j\}\)\>\\gamma;
2. 2\.merge consecutive anomalous windows within a gap tolerance;
3. 3\.assign each interval a confidence using the max or mean score;
4. 4\.attach top\-KKtriggered rare itemsets as local evidence\.
For each detected intervalaa, we define:
Evidence\(a\)=TopK\{\(I,α\(I\)\):I∈ℛ,I⊆wj,wj⊆a\}\.\\text\{Evidence\}\(a\)=\\operatorname\{TopK\}\\\{\(I,\\alpha\(I\)\):I\\in\\mathcal\{R\},\\;I\\subseteq w\_\{j\},\\;w\_\{j\}\\subseteq a\\\}\.
## VIIAllen Temporal Reasoning
### VII\-AAllen Relations
Given two intervalsA=\(as,ae\)A=\(a^\{s\},a^\{e\}\)andB=\(bs,be\)B=\(b^\{s\},b^\{e\}\), Allen interval algebra\[[8](https://arxiv.org/html/2609.26820#bib.bib8)\]defines 13 mutually exclusive qualitative relations:before,after,meets,met\-by,overlaps,overlapped\-by,starts,started\-by,during,contains,finishes,finished\-by, andequals\(see Figure[1](https://arxiv.org/html/2609.26820#S3.F1), step 9\)\. We use these relations to describe how anomaly intervals interact with other anomalies, artifacts, and contextual events\.
### VII\-BComposite Event Library
We define a compact temporal rule library:
- •Escalation:repeated anomaly intervals thatmeetor stronglyoverlap, e\.g\.,A1meetsA2meetsA3A\_\{1\}\\ \\texttt\{meets\}\\ A\_\{2\}\\ \\texttt\{meets\}\\ A\_\{3\}\. In ECG, this captures PVC couplets and triplets; in EEG, seizure buildup\.
- •Artifact overlap:an anomaly intervaloverlapsa known artifact interval, suggesting reduced detection confidence\.
- •Staged onset:an anomalystartsshortly after another event within a toleranceΔt\\Delta t, capturing pre\-ictal to ictal transitions\.
- •Cross\-channel synchrony:anomaly intervals on different channelsoverlaporstarttogether, indicating a spatially distributed event\.
### VII\-CTemporal Relation Graph
We build a graphℰ=\(V,E\)\\mathcal\{E\}=\(V,E\)where nodes are intervals and edges carry labeled Allen relations:
\(ai,ρ,aj\),ρ∈\{meets,overlaps,…\}\.\(a\_\{i\},\\rho,a\_\{j\}\),\\quad\\rho\\in\\\{\\texttt\{meets\},\\texttt\{overlaps\},\\ldots\\\}\.Composite events are obtained by matching small patterns in this graph\.
Confidence refinement\.Allen relations also enable post\-hoc confidence adjustment: intervals participating in anartifact\-overlaprelation have their confidence discounted, while intervals forming anescalationchain have their confidence reinforced\. This mechanism provides a principled way for temporal reasoning to influence final anomaly reporting beyond pure explanation\.
## VIIIRare Temporal Concept Lattices
This section introduces the main explanation layer of the paper\. Allen reasoning produces labeled temporal relations, but a record or cohort may still contain many intervals and many local explanations\. To summarize them, we build an FCA formal context in which objects are detected anomaly intervals and attributes describe their symbolic, temporal, and signal\-context properties\.
### VIII\-AFormal Context
A formal context\[[11](https://arxiv.org/html/2609.26820#bib.bib11)\]is a triple:𝕂=\(𝒢,ℳ,𝒥\)\\mathbb\{K\}=\(\\mathcal\{G\},\\mathcal\{M\},\\mathcal\{J\}\), where𝒢\\mathcal\{G\}is the set of detected anomaly intervals,ℳ\\mathcal\{M\}is the set of binary attributes, and𝒥⊆𝒢×ℳ\\mathcal\{J\}\\subseteq\\mathcal\{G\}\\times\\mathcal\{M\}is the incidence relation\.\(a,m\)∈𝒥\(a,m\)\\in\\mathcal\{J\}means that intervalaahas propertymm\.
### VIII\-BAttribute Construction
We define five families of attributes\.
1\. Rare symbolic attributes\.For each rare itemsetI∈ℛI\\in\\mathcal\{R\}, we create:mI=fires\(I\)m\_\{I\}=\\operatorname\{fires\}\(I\)\. An intervalaasatisfiesmIm\_\{I\}if at least one transaction insideaacontainsII\.
2\. Temporal attributes\.For each Allen\-derived composite, we create predicates such as:overlaps\-artifact\\operatorname\{overlaps\\mbox\{\-\}artifact\},meets\-anomaly\\operatorname\{meets\\mbox\{\-\}anomaly\},escalation\-member\\operatorname\{escalation\\mbox\{\-\}member\},starts\-after\-event\\operatorname\{starts\\mbox\{\-\}after\\mbox\{\-\}event\}\.
3\. Signal\-context attributes\.These include channel/lead information and duration bins:lead\-V5\\operatorname\{lead\\mbox\{\-\}V5\},frontal\-EEG\\operatorname\{frontal\\mbox\{\-\}EEG\},duration\-short\\operatorname\{duration\\mbox\{\-\}short\},duration\-long\\operatorname\{duration\\mbox\{\-\}long\}\.
4\. Reconstruction fidelity attributes\.When VQ\-VAE tokenization is used, we record the mean reconstruction error per interval\. Intervals with error above the 90th percentile of normal training errors are assigned:high\-recon\-error\\operatorname\{high\\mbox\{\-\}recon\\mbox\{\-\}error\}\. This attribute flags intervals that are poorly represented by*any*normal codebook prototype, complementing the rare co\-occurrence signal\.
5\. Robustness attributes\.During robustness tests, intervals may be labeled:stable\-under\-noise\\operatorname\{stable\\mbox\{\-\}under\\mbox\{\-\}noise\},stable\-under\-wander\\operatorname\{stable\\mbox\{\-\}under\\mbox\{\-\}wander\}, orunstable\-under\-perturbation\\operatorname\{unstable\\mbox\{\-\}under\\mbox\{\-\}perturbation\}\. Additional attributes can be added when further perturbations are evaluated\.
### VIII\-CFormal Concepts
ForA⊆𝒢A\\subseteq\\mathcal\{G\}, defineA′=\{m∈ℳ:∀a∈A,\(a,m\)∈𝒥\}A^\{\\prime\}=\\\{m\\in\\mathcal\{M\}:\\forall a\\in A,\\;\(a,m\)\\in\\mathcal\{J\}\\\}\. ForB⊆ℳB\\subseteq\\mathcal\{M\}, defineB′=\{a∈𝒢:∀m∈B,\(a,m\)∈𝒥\}B^\{\\prime\}=\\\{a\\in\\mathcal\{G\}:\\forall m\\in B,\\;\(a,m\)\\in\\mathcal\{J\}\\\}\. A formal concept is a pair\(A,B\)\(A,B\)such thatA′=BA^\{\\prime\}=BandB′=AB^\{\\prime\}=A\. HereAAis theextent\(anomaly intervals\) andBBis theintent\(maximal shared properties\)\.
Thus, a concept may be interpreted as:
\{a1,a2,a7\}⏟similar anomalies⟺\{fires\(\{B42,B91\}\),meets\-anomaly,lead\-II\}⏟shared explanation\.\\underbrace\{\\\{a\_\{1\},a\_\{2\},a\_\{7\}\\\}\}\_\{\\text\{similar anomalies\}\}\\;\\Longleftrightarrow\\;\\underbrace\{\\\{\\operatorname\{fires\}\(\\\{B\_\{42\},B\_\{91\}\\\}\),\\;\\operatorname\{meets\\mbox\{\-\}anomaly\},\\;\\operatorname\{lead\\mbox\{\-\}II\}\\\}\}\_\{\\text\{shared explanation\}\}\.
### VIII\-DToy Example
To illustrate the construction, consider a simplified dataset with five anomaly intervals𝒢=\{A1,…,A5\}\\mathcal\{G\}=\\\{A\_\{1\},\\dots,A\_\{5\}\\\}and five representative attributesℳ=\{R1,R2,long\-duration,escalation,overlap\-artifact\}\\mathcal\{M\}=\\\{R\_\{1\},R\_\{2\},\\text\{long\-duration\},\\text\{escalation\},\\text\{overlap\-artifact\}\\\}, whereR1R\_\{1\}andR2R\_\{2\}represent distinct rare symbolic patterns\. The formal context is represented as a binary cross\-table \(Table[I](https://arxiv.org/html/2609.26820#S8.T1)\)\.
Applying FCA to this context generates the concept lattice shown in Figure[3](https://arxiv.org/html/2609.26820#S8.F3)\. The lattice organizes the intervals hierarchically based on shared attributes\. The top node \(⊤\\top\) covers all intervals, while deeper nodes represent more specific concepts \(more attributes, fewer intervals\)\. For example, the concept\{R1,long\-duration\}\\\{R\_\{1\},\\text\{long\-duration\}\\\}groups intervals\{A1,A2,A5\}\\\{A\_\{1\},A\_\{2\},A\_\{5\}\\\}, while its sub\-concept\{R1,long\-duration,overlap\-artifact\}\\\{R\_\{1\},\\text\{long\-duration\},\\text\{overlap\-artifact\}\\\}specifically isolates\{A2\}\\\{A\_\{2\}\\\}\.
TABLE I:Toy Formal Context mapping anomaly intervals to attributes\.Fig\. 3:Concept lattice of the toy formal context in Table[I](https://arxiv.org/html/2609.26820#S8.T1)\.
### VIII\-EIceberg Lattice and Explanation Compression
Full concept lattices may be exponentially large in\|ℳ\|\|\\mathcal\{M\}\|\. We therefore compute aniceberg latticeby retaining only concepts whose extent satisfies\|A\|≥σ\|A\|\\geq\\sigma, and restrict attributes to the top\-KKmost discriminative rare patterns and the most informative Allen/context predicates\.
Complexity\.Standard algorithms such as NextClosure\[[11](https://arxiv.org/html/2609.26820#bib.bib11)\]enumerate concepts inO\(\|𝒢\|⋅\|ℳ\|⋅\|concepts\|\)O\(\|\\mathcal\{G\}\|\\cdot\|\\mathcal\{M\}\|\\cdot\|\\text\{concepts\}\|\)time\. The iceberg thresholdσ\\sigmaand attribute filtering to top\-KKtogether bound the effective number of concepts, keeping computation tractable for typical anomaly counts \(tens to low hundreds of intervals per record or cohort\)\.
The concept lattice acts as an explanation\-compression mechanism\. Instead of reporting all local interval explanations independently, we report concept summaries:Conceptc=\(Ac,Bc\):\|Ac\|intervals shareBc\\text\{Concept \}c=\(A\_\{c\},B\_\{c\}\):\\;\|A\_\{c\}\|\\text\{ intervals share \}B\_\{c\}\.
Algorithm[1](https://arxiv.org/html/2609.26820#alg1)provides the full pseudo\-code of the proposed Signal2Symbol pipeline\.
### VIII\-FExample Interpretation
A concept with intentBc=\{fires\(\{B42,B91\}\),overlaps\-artifact,lead\-V5\}B\_\{c\}=\\\{\\operatorname\{fires\}\(\\\{B\_\{42\},B\_\{91\}\\\}\),\\;\\operatorname\{overlaps\\mbox\{\-\}artifact\},\\;\\operatorname\{lead\\mbox\{\-\}V5\}\\\}may be summarized as:*“A family of V5 anomaly intervals is driven by the rare token co\-occurrence\{B42,B91\}\\\{B\_\{42\},B\_\{91\}\\\}but overlaps artifact intervals; these detections should be interpreted with reduced confidence\.”*
A concept with intentBc=\{fires\(\{B17,B91\}\),escalation\-member,duration\-long\}B\_\{c\}=\\\{\\operatorname\{fires\}\(\\\{B\_\{17\},B\_\{91\}\\\}\),\\;\\operatorname\{escalation\\mbox\{\-\}member\},\\;\\operatorname\{duration\\mbox\{\-\}long\}\\\}may be summarized as:*“A repeated long\-duration anomaly type appears as an escalation chain, suggesting a sustained arrhythmic episode or seizure buildup\.”*
Algorithm 1Signal2Symbol with Rare Temporal Concept Lattice1:Signal record
x\(t\)x\(t\), tokenizer type, window length
WW, rarity threshold
τ\\tau, score threshold
γ\\gamma, support
σ\\sigma
2:Record score, anomaly intervals, rare evidence, Allen graph, concept lattice
3:Segment
x\(t\)x\(t\)into windows or beats
\{xi\}i=1N\\\{x\_\{i\}\\\}\_\{i=1\}^\{N\}
4:Convert segments into tokens via SAX or VQ\-VAE
5:Build bigram\-enriched transactions
𝒯=\{wj\+\}j=1M\\mathcal\{T\}=\\\{w\_\{j\}^\{\+\}\\\}\_\{j=1\}^\{M\}
6:Mine MRI rare itemsets
ℛ\\mathcal\{R\}on normal training transactions
7:foreach transaction
wj\+w\_\{j\}^\{\+\}do
8:Compute
Swin\(wj\)S\_\{\\text\{win\}\}\(w\_\{j\}\)via Eq\. \([1](https://arxiv.org/html/2609.26820#S6.E1)\)
9:endfor
10:Aggregate
Srec\(x\)S\_\{\\text\{rec\}\}\(x\)via Eq\. \([3](https://arxiv.org/html/2609.26820#S6.E3)\)
11:Extract anomaly intervals
ℐ\(x\)\\mathcal\{I\}\(x\)
12:Attach top\-
KKrare symbolic evidence to each interval
13:Compute Allen relations among anomaly and context intervals
14:Refine interval confidence via Allen\-based adjustment
15:Construct FCA context
𝕂=\(𝒢,ℳ,𝒥\)\\mathbb\{K\}=\(\\mathcal\{G\},\\mathcal\{M\},\\mathcal\{J\}\)with five attribute families
16:Generate iceberg concept lattice with support
σ\\sigma
17:returnscores, intervals, evidence, Allen graph, concept lattice
## IXExperiments
### IX\-ADatasets
We evaluate on two ECG benchmarks and one EEG benchmark, chosen to cover beat\-level, record\-level, and segment\-level granularities across two signal modalities\.
- •MIT\-BIH Arrhythmia Database\[[12](https://arxiv.org/html/2609.26820#bib.bib12)\]: 48 half\-hour, two\-channel ambulatory ECG recordings at 360 Hz with∼\{\\sim\}110,000 beat\-level annotations spanning normal \(N\) and arrhythmic types \(PVC, APC, LBBB, RBBB, Paced\)\. We segment by R\-peak and use beat\-centered windows\. Normal beats form the training set; arrhythmic beats are anomalies\. Patient\-wise splits prevent leakage\. This dataset is our primary benchmark: beat\-level annotations permit full evaluation of interval detection, Allen reasoning, and FCA concept formation across distinct arrhythmia families\. Here, each beat is represented by a 216\-sample R\-peak\-centered window, corresponding to 600 ms at 360 Hz\.
- •PTB\-XL\[[13](https://arxiv.org/html/2609.26820#bib.bib13)\]: 21,837 twelve\-lead, 10\-second ECG records at 100 Hz with record\-level diagnostic labels \(NORM, MI, STTC, CD, HYP\)\. We use NORM records for training and pathological records as anomalies\. Patient\-wise stratified splits follow the recommended folds\. PTB\-XL tests scalability to a large modern benchmark at record\-level granularity\. Here, we use the complete 10\-s lead\-II record, with 1,000 samples at 100 Hz\.
- •Bonn EEG Dataset\[[14](https://arxiv.org/html/2609.26820#bib.bib14)\]: 500 single\-channel EEG segments \(23\.6 s each, 173\.61 Hz\) across five classes: eyes\-open \(A\), eyes\-closed \(B\), interictal hippocampal \(C\), interictal epileptogenic \(D\), and ictal/seizure \(E\)\. We use classes A–B as normal and C–E as varying degrees of abnormality\. Here, each recording is divided into 512\-sample windows, corresponding to approximately 2\.95 s at 173\.61 Hz, with50%50\\%overlap\.
### IX\-BBaselines
We compare five scoring backbones:IF\(Isolation Forest, 200 trees\) andLOF\(k=20k\\\!=\\\!20\) applied to flattened time\-domain features;USAD\[[15](https://arxiv.org/html/2609.26820#bib.bib15)\], a deep learning baseline of two adversarially\-trained autoencoders whose combined reconstruction error serves as the anomaly score;SAX\+RareScore, using SAX tokens with rare\-pattern scoring; andSignal2Symbol\(VQ\-VAE\+RareScore\), our full neuro\-symbolic backbone\. Detection metrics are reported for all scoring backbones; robustness is evaluated under signal perturbations, while Allen/FCA are assessed through explanation\-compression and case\-study analyses\.
### IX\-CMetrics
For detection we report AUROC and AUPRC\. Explanation quality is assessed via: \(i\)*rule sparsity*\(average evidence patterns per interval\); \(ii\)*concept compression ratio*\(local explanations divided by retained lattice concepts\); \(iii\)*concept stability*\(Jaccard overlap of concept intents across bootstrap samples\); and \(iv\)*mean intent length*\(average attributes per concept\)\. Robustness is measured asΔ\\DeltaAUROC under Gaussian noise injection \(SNR∈\{5,10,20\}\\in\\\{5,10,20\\\}dB\) and sinusoidal baseline wander \(amplitudes∈\{0\.1,0\.3,0\.5\}\\in\\\{0\.1,0\.3,0\.5\\\}mV\)\.
### IX\-DImplementation Details
The VQ\-VAE encoder consists of three Conv1d layers \(32, 64, 128 filters\) with a linear projection toℝ64\\mathbb\{R\}^\{64\}; the codebook \(K=128K\\\!=\\\!128\) uses EMA updates with commitment weightβ=0\.25\\beta\\\!=\\\!0\.25and is trained for 100 epochs on normal segments with MSE loss\. USAD shares the same encoder architecture with two decoders trained adversarially for 100 epochs\. For SAX, we use alphabet sizeA=5A\\\!=\\\!5and PAA reduction to 16 segments per window\. The rare itemset miner usesτ=0\.02\\tau\\\!=\\\!0\.02and max itemset length 5, with bigram\-enriched transactions of window sizeW=8W\\\!=\\\!8and step size 1\. Anomaly scoring usesε=10−6\\varepsilon\\\!=\\\!10^\{\-6\}, Top\-KKaggregation \(K=5K\\\!=\\\!5\), and score thresholdγ\\gammaat the 95th percentile of normal validation scores\. The FCA iceberg lattice retains concepts with supportσ≥2\\sigma\\\!\\geq\\\!2and top\-50 attributes\.
### IX\-EMain Detection Results
Table[II](https://arxiv.org/html/2609.26820#S9.T2)reports detection performance across all three datasets\. The results show that learned symbolic tokenization consistently improves rare\-pattern anomaly ranking over SAX\. VQ\-VAE\+Rare achieves the best AUROC and AUPRC on all three datasets, with particularly large gains on PTB\-XL and MIT\-BIH, suggesting that learned codebook prototypes capture morphology\-level variations that fixed SAX discretization misses\. On Bonn EEG, all symbolic methods obtain high AUPRC, while VQ\-VAE\+Rare further improves AUROC, indicating better separation between normal and abnormal EEG segments\. IF and LOF provide competitive classical baselines, while USAD offers a deep reconstruction baseline; nevertheless, Signal2Symbol achieves the best AUROC and AUPRC across all three datasets\. These results support the use of VQ\-VAE tokens as a stronger symbolic substrate for the subsequent Allen/FCA explanation layers\.
TABLE II:Detection results across ECG and EEG datasets\. MIT\-BIH is evaluated at beat\-level, PTB\-XL at record\-level \(lead II only\), and Bonn at segment\-level\.
### IX\-FAblation Study
Table[III](https://arxiv.org/html/2609.26820#S9.T3)ablates key design choices on the Bonn EEG dataset\. The ablation confirms that learned VQ\-VAE tokens provide a stronger symbolic representation than SAX on Bonn EEG, with performance saturating already atK=128K=128\. Increasing the SAX alphabet or PAA resolution does not improve detection, suggesting that finer fixed discretization may fragment useful motifs\.
TABLE III:Ablation study: effect of tokenizer, alphabet size, and PAA resolution on Bonn EEG\.
### IX\-GSensitivity to Support Threshold
The pipeline involves interacting thresholds, notably the rarity thresholdτ\\tauused during mining\. To evaluate the robustness of our models to this hyperparameter, we performed a grid search overτ∈\[0\.01,0\.40\]\\tau\\in\[0\.01,0\.40\]on the Bonn EEG dataset \(Figure[4](https://arxiv.org/html/2609.26820#S9.F4)\)\.
Fig\. 4:Sensitivity of AUROC and AUPRC to the support thresholdτ\\tauon the Bonn EEG dataset\. The VQ\-VAE model exhibits remarkable stability across lower thresholds\.The VQ\-VAE \(K=128K\\\!=\\\!128\) model demonstrates remarkable stability, maintaining its peak AUROC of 0\.710 across allτ≤0\.05\\tau\\leq 0\.05\. This occurs because the model extracts a highly specific, robust set of 21 Minimal Rare Itemsets \(MRIs\) that capture the dominant anomalous symbolic configurations\. In contrast, the SAX tokenizer is much more sensitive to thresholding, requiring the mining of over 4,000 dense MRIs atτ=0\.01\\tau\\\!=\\\!0\.01to marginally improve from 0\.601 to 0\.631 AUROC, sacrificing explainability\. These results confirm that our neuro\-symbolic approach is highly robust to hyperparameter selection and does not require aggressive grid searching to achieve peak anomaly detection performance\. Preliminary sensitivity checks on the remaining datasets showed the same trend\.
### IX\-HExplanation Quality
Table[IV](https://arxiv.org/html/2609.26820#S9.T4)reports explanation metrics on Bonn EEG, PTB\-XL and MIT\-BIH\.
TABLE IV:Explanation quality across datasets\. Compression is the ratio of detected anomaly intervals to retained iceberg\-lattice concepts; Intent is the mean number of attributes per retained concept\.As illustrated, our full pipeline achieves significant explanation compression across all three primary datasets\. For Bonn EEG, the FCA layer systematically groups 2,061 individual anomaly intervals into just 40 distinct formal concepts, achieving a51\.5×51\.5\\timescompression ratio\. On the much larger MIT\-BIH dataset, the compression is even stronger at67\.3×67\.3\\times, collapsing 2,154 raw anomaly intervals into 32 high\-level prototypes\. Even on PTB\-XL’s complex, multi\-pathology ECG records, the lattice compresses 585 raw anomalous intervals down to 144 formal concepts \(a4\.1×4\.1\\timesreduction\)\. This allows domain experts to review a manageable handful of anomaly prototypes rather than thousands of isolated events\. Furthermore, the average concept intent across all datasets consists of roughly 3 to 4 attributes, meaning each anomaly group is concisely described by a small, interpretable set of temporal and symbolic properties\.
### IX\-IRobustness
Table[V](https://arxiv.org/html/2609.26820#S9.T5)reportsΔ\\DeltaAUROC under perturbation on Bonn EEG\. The VQ\-VAE tokenizer shows no observable AUROC degradation under the tested perturbation settings, maintaining the same measured AUROC of 0\.710 within the reported precision \(Δ=0\.000\\Delta=0\.000\) across all tested noise levels \(up to 5 dB SNR\) and baseline wander amplitudes\. In contrast, the SAX baseline suffers minor degradation under noise and a more noticeable performance drop \(Δ=−0\.024\\Delta=\-0\.024\) when subjected to baseline wander\. The neural codebook’s ability to smoothly map corrupted continuous segments to the same discrete latent prototypes makes it highly resilient to common clinical artifacts\.
TABLE V:Robustness \(Δ\\DeltaAUROC vs\. clean\) on Bonn EEG\. Noise column reports worst\-caseΔ\\Deltaacross SNR∈\{5,10,20\}\\in\\\{5,10,20\\\}dB; Wander column across amplitudes∈\{0\.1,0\.3,0\.5\}\\in\\\{0\.1,0\.3,0\.5\\\}\.
### IX\-JCase Study: Explainability via Concept Lattices
We present a qualitative case study on the Bonn EEG dataset \(Set E, seizure recordings\) to demonstrate how Formal Concept Analysis \(FCA\) provides structured explainability\. Figure[5](https://arxiv.org/html/2609.26820#S9.F5)visualizes a concept lattice built from 30 detected anomaly intervals during a seizure event\.
Local Symbolic Evidence\.The symbolic tokenizer and rare pattern miner identify specific rare transitions and co\-occurrences \(e\.g\.,R1,R2R\_\{1\},R\_\{2\}\) that flag these windows as anomalous against the background normal activity\.
Temporal Reasoning\.The Allen temporal graph connects these intervals\. The reasoner identifies that these anomalies are contiguous and overlapping, forming extended periods of abnormal activity, leading to the*long\-duration*attribute\.
Concept Lattice\.Rather than presenting the clinician with 30 independent alarms, the FCA lattice \(Figure[5](https://arxiv.org/html/2609.26820#S9.F5)\) organizes them hierarchically\. The top concept \(⊤\\top\) encompasses all 30 intervals, establishing that they all share the*long\-duration*temporal characteristic\. Sub\-concepts then branch out based on specific subsets of rare patterns that fired within those intervals\. For instance, the lattice groups sets of intervals that co\-exhibit specific rare patterns, effectively compressing 30 distinct anomalies into 14 interpretable, rule\-based families\.
Fig\. 5:Rare Temporal Concept Lattice generated from 30 anomaly intervals on Bonn EEG \(Set E, Seizure\)\. The FCA lattice compresses individual detections into a hierarchy of concepts based on shared temporal attributes \(e\.g\.,*long\-duration*\) and rare symbolic patterns \(RiR\_\{i\}\)\. Deeper nodes represent more specific anomaly signatures\.
## XDiscussion
Signal2Symbol is designed to make physiological anomaly detection explainable at three levels\. First, rare itemsets providelocal symbolic evidence: they identify the unusual token co\-occurrences that caused a window to be scored as anomalous\. Second, Allen relations providetemporal structure: they describe how intervals meet, overlap, or follow one another, and enable confidence refinement\. Third, FCA providesconceptual compression: it groups intervals into shared temporal\-symbolic anomaly families\. This combination is important because physiological time series often contain many local irregularities, not all of which are clinically meaningful\. A list of isolated detections is difficult to interpret\. A concept lattice, however, can reveal that several intervals share the same rare motif and the same temporal behavior\. For example, artifact\-overlap concepts can be separated from escalation concepts, and cross\-channel concepts can be distinguished from single\-channel events\.
Why VQ\-VAE helps\.SAX is transparent and efficient, but it discretizes mostly amplitude patterns\. VQ\-VAE can learn recurring waveform morphologies, making token co\-occurrences more semantically meaningful\. This is especially relevant for ECG beat morphology \(e\.g\., distinguishing PVC from LBBB shapes\) and EEG transient patterns\.
Why bigrams help\.Pure set\-valued transactions lose all sequential structure\. Bigram enrichment recovers pairwise ordering at negligible cost, enabling the detection of anomalies that depend on transition patterns \(e\.g\., normal\-to\-PVC transitions\) without requiring a full sequential pattern miner\.
Why FCA helps\.Rare patterns alone may produce many fragmented explanations\. FCA organizes them into a lattice of shared attributes, enabling visual inspection and explanation compression\. This makes the method suitable as an AI reasoning and knowledge\-discovery tool\.
Hyperparameter sensitivity\.The pipeline involves several interacting thresholds: rarity thresholdτ\\tau, window sizeWW, codebook sizeKK, score thresholdγ\\gamma, and concept supportσ\\sigma\. We note a qualitative interaction: largerWWincreases token co\-occurrence within transactions, raising support values and requiring a correspondingly higherτ\\tauto identify rare patterns\. The ablation study varies these parameters individually; a full factorial analysis is left to future work\.
Limitations\.First, bigram enrichment recovers only pairwise order; longer sequential dependencies require n\-gram or sequential rule mining\. Second, the lattice can become large if too many attributes are included; we address this with iceberg support thresholds and top\-KKattribute filtering\. Third, VQ\-VAE may suffer from dead codes without careful training \(EMA updates and utilization tracking help\)\. Fourth, the Allen/FCA explanation quality depends on reliable interval extraction; noisy thresholds can fragment or merge intervals incorrectly\.
Per\-dataset analysis\.On the Bonn EEG dataset, Signal2Symbol \(VQ\-VAE\+Rare\) achieves 0\.71 AUROC, substantially outperforming Isolation Forest \(0\.46\) and SAX\+Rare \(0\.57\)\. EEG seizure activity produces distinctive temporal patterns that are well captured by learned codebook prototypes\. On MIT\-BIH, IF operates directly on the 216\-dimensional beat morphology and achieves 0\.79 AUROC, while our symbolic methods reach 0\.81 \(VQ\-VAE\) and 0\.60 \(SAX\)\. On PTB\-XL, IF achieves near\-random performance \(0\.54 AUROC\), while our approach reaches a score of 0\.74\.
## XIConclusion and Future Work
We presented Signal2Symbol, a neuro\-symbolic pipeline for explainable ECG/EEG anomaly detection\. The method combines VQ\-VAE/SAX tokenization, bigram\-enriched rare\-pattern anomaly scoring, Allen interval reasoning with confidence refinement, and FCA\-based rare temporal concept lattices\. Evaluation on MIT\-BIH, PTB\-XL, and Bonn EEG demonstrates the framework across beat\-level, record\-level, and segment\-level granularities in two signal modalities\. The resulting framework produces not only anomaly scores, but also symbolic evidence, temporal relations, and concept\-level visual explanations\. Future work will extend the current framework with order\-aware sequence mining \(n\-grams and sequential rules\), masked token modeling over learned biosignal tokens, larger cross\-dataset evaluation including CHB\-MIT seizure detection, and human\-in\-the\-loop assessment of explanation usefulness in clinical workflows\.
## Declarations
The authors declare no competing interests\. Public datasets were used; code and processed data are available upon request\.
## References
- \[1\]Zamanzadeh Darban, Z\.,*et al\.*\(2024\)\. Deep learning for time series anomaly detection: A survey\. ACM Computing Surveys, 57\(1\), 1\-42\.
- \[2\]Liu, Q\.,*et al\.*\(2024\)\. Time\-series anomaly detection: Overview and new trends\. Proc\. of the VLDB Endowment \(PVLDB\), 17\(12\), 4229\-4232\.
- \[3\]Tabassum, M\.,*et al\.*\(2024\)\. Anomaly\-based threat detection in smart health using machine learning\. BMC Medical Informatics and Decision Making, 24\(1\), 347\.
- \[4\]Niu, Y\.,*et al\.*\(2025\)\. Explainable machine learning model based on EEG, ECG, and clinical features for predicting neurological outcomes in cardiac arrest patient\. Scientific Reports, 15\(1\), 11498\.
- \[5\]Arulmurugan, V\. S\.,*et al\.*\(2026\)\. Federated learning\-enabled privacy\-preserving framework for seizure forecasting and affective state analysis using multi\-modal EEG\-ECG data\. Scientific Reports\.
- \[6\]Liang, J\.,*et al\.*\(2026\)\. Generative Adversarial Networks for Modeling Bio\-Electric Fields in Medicine: A Review of EEG, ECG, EMG, and EOG Applications\. Bioengineering, 13\(1\), 84\.
- \[7\]Szathmary, L\.,*et al\.*\. \(2007, October\)\. Towards rare itemset mining\. In 19th IEEE international conference on tools with artificial intelligence \(ICTAI 2007\) \(Vol\. 1, pp\. 305\-312\)\. IEEE\.
- \[8\]J\. F\. Allen, “Maintaining knowledge about temporal intervals,”*Commun\. ACM*, vol\. 26, no\. 11, pp\. 832–843, 1983\.
- \[9\]J\. Lin,*et al\.*, “A symbolic representation of time series, with implications for streaming algorithms,” in*Proc\. SIGMOD DMKD Workshop*, 2003\.
- \[10\]A\. van den Oord,*et al\.*, “Neural discrete representation learning,” in*Advances in Neural Information Processing Systems*, 2017\.
- \[11\]B\. Ganter and R\. Wille,*Formal Concept Analysis: Mathematical Foundations*\. Berlin: Springer, 1999\.
- \[12\]G\. B\. Moody and R\. G\. Mark, “The impact of the MIT\-BIH arrhythmia database,”*IEEE Eng\. Med\. Biol\. Mag\.*, vol\. 20, no\. 3, pp\. 45–50, 2001\.
- \[13\]P\. Wagner,*et al\.*, “PTB\-XL, a large publicly available electrocardiography dataset,”*Scientific Data*, vol\. 7, no\. 1, p\. 154, 2020\.
- \[14\]R\. G\. Andrzejak,*et al\.*\. “Indications of nonlinear deterministic and finite\-dimensional structures in time series of brain electrical activity: Dependence on recording region and brain state,”*Physical Review E*, vol\. 64, no\. 6, p\. 061907, 2001\.
- \[15\]Audibert, J\.,*et al\.*\. \(2020, August\)\. Usad: Unsupervised anomaly detection on multivariate time series\. In Proc, of the 26th ACM SIGKDD conference \(pp\. 3395\-3404\)\.
- \[16\]Benabderrahmane, S\., Mellouli, N\., Lamolle, M\., Mimouni, N\. \(2017, November\)\. When deep neural networks meet job offers recommendation\. In 2017 IEEE 29th International Conference on Tools with Artificial Intelligence \(ICTAI\) \(pp\. 223\-230\)\. IEEE\.
- \[17\]Benabderrahmane, S\., Quiniou, R\., Guyet, T\. \(2014, August\)\. Evaluating distance measures and times series clustering for temporal patterns retrieval\. In Proceedings of the 2014 IEEE 15th International Conference on Information Reuse and Integration \(IEEE IRI 2014\) \(pp\. 434\-441\)\. IEEE\.相似文章
PACE: 一种用于生成合理且可操作的反事实解释的神经符号框架
本文介绍了PACE,这是一个模块化的神经符号框架,结合了神经预测模型和符号推理,以生成符合领域特定可行性约束的反事实解释。在Adult Income数据集上的案例研究表明,结合符号规则能够产生更合理且可操作的解释。
利用谱熵量化可解释AI在ECG数据中引入的信号噪声
该论文提出使用谱熵作为衡量可解释性技术在ECG心律失常分类中引入噪声的指标,有助于区分模型真实信号与XAI生成的人为伪影。
Peak-Detector:基于指令微调大语言模型的生理信号可解释峰值检测
介绍了Peak-Detector框架,该框架利用指令微调的大语言模型对心电(ECG)、光电容积脉搏波(PPG)、心冲击图(BCG)和体震图(BSG)等生理信号进行鲁棒、跨模态且可解释的峰值检测。该方法将时间序列数据转换为压缩的“峰值表示”格式,并通过监督微调及后续多目标奖励的强化学习进行优化。
小巧但可信:高效视觉语言推理用于时间序列异常检测
本文提出 VisAnomReasoner,一个参数高效的视觉语言模型,在带自然语言解释的新基准 VisAnomBench 上微调,在时间序列异常检测中精度和 F1 提升超过 21 个百分点,并展现出强大的跨基准泛化能力。
人工神经网络中符号模式涌现的数学原理与实验发现
本文证明,在广泛的人工神经网络类别中,推理逻辑可以被重新表述为稀疏符号交互,并得到数学判据和大量实验的支持,为可解释性和泛化性提供了新颖的见解。