From d70e6d2782235817da05ff85d6b7d14e147b61c2 Mon Sep 17 00:00:00 2001 From: Claudio Ardagna Date: Mon, 13 May 2024 10:30:14 +0200 Subject: [PATCH] Sezione 5 - Claudio --- metrics.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/metrics.tex b/metrics.tex index a411c70..572b936 100644 --- a/metrics.tex +++ b/metrics.tex @@ -37,7 +37,7 @@ \subsubsection{Qualitative Metric} where X and Y are two distributions of the same size, and M$=$0.5*(X+Y) is the average distribution. JSD incorporates both the KL divergence from X to M and from Y to M. -To make JSD applicable to datasets, where each feature in the dataset has its own statistical distribution, metric $M_{JDS}$ applies JSD to each column of the dataset. The obtained results are then aggregated using a weighted average, thus enabling the prioritization of important features that can be lost during the policy-driven transformation in \cref{sec:heuristics}, as follows: \[M_{JDS} = 1 - \sum_{i=1}^n w_i \cdot \text{JSD}(x_i,y_i)\] +To make JSD applicable to datasets, where each feature in the dataset has its own statistical distribution, metric $M_{JDS}$ applies JSD to each column of the dataset. The obtained results are then aggregated using a weighted average, thus enabling the prioritization of important features that can be lost during the policy-driven transformation in \cref{sec:heuristics}, as follows: \[M_{JSD} = 1 - \sum_{i=1}^n w_i \cdot \text{JSD}(x_i,y_i)\] %where \(w_i = \frac{n_i}{N}\) represents the weight for the \(i\)-th column, with \(n_i\) being the number of distinct elements in the $i$-th feature and \(N\) the total number of elements in the dataset. where $\sum_{i=1}^n w_i$$=$1 and each \(\text{JSD}(x_i,y_i)\) accounts for the Jensen-Shannon Divergence computed for the \(i\)-th feature in datasets X and Y. It ranges from 0 to 1, with 0 indicating no similarity (minimum quality) and 1 indicating complete similarity (maximum quality) between the datasets. %Must be noted that the one minus has been added to the formula to transfrom the metric into a similarity metric, where 1 indicates complete similarity and 0 indicates no similarity.