From e5f634afdfdefbd5dffb3b9669fa35d5efcc1535 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Karahan=20Sar=C4=B1ta=C5=9F?=
 <44376034+KarahanS@users.noreply.github.com>
Date: Sat, 9 Dec 2023 13:30:00 +0100
Subject: [PATCH] fix doc for edge histogram

---
 doc/kernels/edge_histogram.rst | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/doc/kernels/edge_histogram.rst b/doc/kernels/edge_histogram.rst
index 73d24169..a7472577 100644
--- a/doc/kernels/edge_histogram.rst
+++ b/doc/kernels/edge_histogram.rst
@@ -6,7 +6,7 @@ Edge Histogram Kernel
 The edge histogram kernel is a basic linear kernel on edge label histograms.
 The kernel assumes edge-labeled graphs.
 Let :math:`\mathcal{G}` be a collection of graphs, and assume that each of their edges comes from an abstract edge space :math:`\mathcal{E}`.
-Given a set of node labels :math:`\mathcal{L}`, :math:`\ell : \mathcal{E} \rightarrow \mathcal{L}` is a function that assigns labels to the edges of the graphs.
+Given a set of edge labels :math:`\mathcal{L}`, :math:`\ell : \mathcal{E} \rightarrow \mathcal{L}` is a function that assigns labels to the edges of the graphs.
 Assume that there are :math:`d` labels in total, that is :math:`d = |\mathcal{L}|`.
 Then, the edge label histogram of a graph :math:`G=(V,E)` is a vector :math:`\mathbf{f} = (f_1, f_2, \ldots, f_d)`, such that :math:`f_i = |\{ (v,u) \in E : \ell(v,u) = i \}|` for each :math:`i \in \mathcal{L}`.
 Let :math:`\mathbf{f}, \mathbf{f}'` be the edge label histograms of two graphs :math:`G, G'`, respectively.