---
title: Area-Based Hypograph Index (ABHI)
url: https://www.emergentmind.com/topics/area-based-hypograph-index-abhi
type: topic
---

# Area-Based Hypograph Index (ABHI)

Searching arXiv for the cited ABHI-related papers to ground the article in the current preprint record.
Area-Based Hypograph Index (ABHI) denotes an area-based construction centered on the hypograph of a function or curve. In the recent functional-data literature, the term is used for indices that rank curves by integrating how often, or by how much, a reference curve lies above a sample; these formulations support clustering of multivariate functional data and functional outlier detection [2307.16720]. In a separate dependence-measure literature, the same acronym is associated with an area-under-the-Kendall-curve quantity used to measure joint dependence of a random vector [2011.12268]. This suggests that ABHI is not a single universally fixed formula, but a label attached to closely related “area-under-a-hypograph” ideas in different statistical settings.

## 1. Terminological scope and principal formulations

The term ABHI appears in at least three closely connected but non-identical formulations. In the multivariate functional-data clustering setting, the index is defined through indicator functions and measures the fraction of the domain on which sample curves lie at or below a reference curve, with normalization to the unit interval [2307.16720]. In the functional outlier-detection setting, the index is defined through the positive part $(x(t)-x_i(t))_+$ and measures the accumulated area by which a target curve exceeds other curves [2507.05701]. In the AUK-based dependence setting, the relevant area is computed from a Kendall curve and an independence benchmark [2011.12268].

| Source | Object | Defining form |
|---|---|---|
| [2307.16720] | Functional depth / clustering | $\frac{1}{n\,\lambda(T)}\sum_{i=1}^n\int_T \mathbf{1}\{x_i(t)\le x(t)\}\,dt$ |
| [2507.05701] | Functional outlier detection | $\sum_{i=1}^n\int_{\mathcal I}(x(t)-x_i(t))_+\,dt$ |
| [2011.12268] | Joint dependence | $\int_0^1 K_d(t)\,dK_\Pi(t)$ |

A common misconception is that ABHI has a unique canonical formula. The published record instead shows that the acronym has been specialized to different inferential goals. The common element is hypograph-based area aggregation, but the operational meaning depends on whether the objective is curve ordering, outlier detection, or dependence measurement.

## 2. Indicator-based ABHI for functional data

For a univariate sample of continuous real-valued curves on a compact interval $T\subset\mathbb{R}$ with Lebesgue measure $\lambda(T)$, the area-based hypograph index of a reference curve $x(t)$ is defined as
\[
\mathrm{ABHI}_n\bigl(x\bigr) \;=\; \frac{1}{n\,\lambda(T)}\, \sum_{i=1}^n \int_{T} \mathbf{1}\bigl\{\,x_i(t)\le x(t)\bigr\} \;dt.
\]
Equivalently, for each $t$ one computes the fraction of sample curves below $x(t)$, then integrates in $t$ and normalizes by the total “time” $\lambda(T)$ [2307.16720].

At each time $t$, dividing by $n$ gives a pointwise “depth”
\[
h(t)=\tfrac1n\sum_i\mathbf1\{x_i(t)\le x(t)\}\in[0,1].
\]
Integrating $h(t)$ over $T$ measures the area of the hypograph-region “under” $x$ that is occupied by the sample curves. Dividing by $\lambda(T)$ rescales the index to $[0,1]$. A curve with $\mathrm{ABHI}_n(x)\approx1$ lies above most sample curves for most $t$ (very central or “high” curve), while $\mathrm{ABHI}_n(x)\approx0$ lies towards the bottom of the sample [2307.16720].

The same source gives an illustrative example on $T=[0,1]$ with
\[
x_1(t)=t,\qquad x_2(t)=2t,\qquad x_3(t)=1,
\]
and reference
\[
x(t)=1.5\,t.
\]
Using the three-point grid $t=\{0,0.5,1\}$, the pointwise fractions are $h(0)=1$, $h(0.5)=1/3$, and $h(1)=2/3$. A trapezoidal or simple-average approximation yields
\[
\mathrm{ABHI}_n(x)\approx 0.667.
\]
This example makes explicit that the indicator-based ABHI is an ordering device: it summarizes how often a reference curve dominates the sample in the pointwise partial order.

## 3. Multivariate extension, derivatives, and clustering

For multivariate functional data, each observation is a $p$-variate function
\[
\mathbf{x}_i(t)=(x_{i1}(t),\dots,x_{ip}(t)),\quad t\in T,
\]
and the reference is $\mathbf{x}(t)=(x_1(t),\dots,x_p(t))$. The multivariate ABHI is
\[
\mathrm{ABHI}_n\bigl(\mathbf{x}\bigr) \;=\; \frac{1}{n\,\lambda(T)} \sum_{i=1}^n \int_{T} \prod_{k=1}^p \mathbf{1}\bigl\{\,x_{ik}(t)\le x_k(t)\bigr\} \;dt.
\]
In words, at each $t$ one requires all $p$ components of $\mathbf{x}_i(t)$ to lie below the corresponding coordinates of $\mathbf{x}(t)$, then average and integrate [2307.16720].

This formulation was introduced together with a novel formulation of the epigraph and hypograph indices, along with their generalized expressions, specifically designed for multivariate functional data. The new definitions account for interrelationships between variables, enabling effective clustering of multivariate functional data based on the original data curves and their first two derivatives. The methodology was tested on simulated datasets and further illustrated with the Canadian weather dataset and a 2023 air quality study in Madrid [2307.16720].

The practical computation proceeds by smoothing each observed curve on $T$ via splines or basis expansion if desired, optionally computing first and second derivatives, discretizing the integral on a grid $t_1<\cdots<t_m$, evaluating
\[
I_{i,j}=\mathbf1\{x_i(t_j)\le x(t_j)\}
\]
or, in the multivariate case,
\[
I_{i,j}=\prod_{k=1}^p\mathbf1\{x_{ik}(t_j)\le x_k(t_j)\},
\]
averaging over $i$ to obtain $h(t_j)$, and approximating the integral by a Riemann sum [2307.16720]. The workflow is thus tightly aligned with standard FDA preprocessing, particularly spline smoothing and derivative estimation.

## 4. Area-gap ABHI and functional outlier detection

A later formulation extends the classical hypograph index by not only asking “on how much of the domain does a given curve lie above the others?” but also “by how much?” For curves $x_1,\ldots,x_n:\mathcal I\to\mathbb R$ on a compact interval $\mathcal I$, and any target curve $x\in C(\mathcal I,\mathbb R)$,
\[
\mathrm{ABHI}_n(x)=\sum_{i=1}^n \int_{\mathcal I} (x(t)-x_i(t))_+\,dt,
\]
where $(u)_+=\max\{u,0\}$ denotes the positive part [2507.05701].

If one prefers an average-per-curve normalization and/or a per-unit-length normalization, one can equivalently write
\[
\overline{ABHI}_n(x)
=\frac{1}{n\,|\mathcal I|}\sum_{i=1}^n\int_{\mathcal I}(x(t)-x_i(t))_+\,dt,
\]
which then takes values in $[0,\infty)$ and interprets ABHI as the average per-curve, per-unit-time hypograph-area. The original paper works with the unnormalized version [2507.05701].

This area-gap formulation is explicitly designed to capture both magnitude and shape deviations. A curve that is uniformly slightly above its peers over the entire domain still accumulates a large area, while a curve that “peaks” above the rest accumulates area in those peaks. The paper also states the decomposition
\[
\mathrm{ABEI}_n(x)+\mathrm{ABHI}_n(x)=\sum_{i=1}^n\int_{\mathcal I}|x_i(t)-x(t)|\,dt,
\]
where $\mathrm{ABEI}_n$ is the area-based epigraph index. Thus $\mathrm{ABHI}_n(x)$ measures exactly half, in a signed-area sense, of the total $L^1$-distance between $x$ and the sample [2507.05701].

Several theoretical properties are given. ABHI is nonnegative, and $\mathrm{ABHI}_n(x)=0$ precisely if $x(t)\le x_i(t)$ for all $t$ and all $i$. There is no finite upper bound. ABHI under process $X$ equals ABEI under process $-X$, that is,
\[
\mathrm{ABHI}_n^{X}(x)=\mathrm{ABEI}_n^{(-X)}(-x).
\]
Unlike the classical MEI/MHI, ABEI and ABHI enjoy no nontrivial linear relation, making them jointly informative. By integrating vertical deviations, ABHI is robust to small-scale fluctuations, yet sensitive to any persistent or high-amplitude deviation [2507.05701].

## 5. Algorithms, complexity, and relation to other functional depths

For the indicator-based formulation, practical computation on a grid uses pointwise indicators, averages them across curves, and approximates the integral by a Riemann sum. Its stated complexity is $O(n\,m)$ for univariate data or $O(n\,p\,m)$ for $p$-variate data, where $m$ is the number of grid points. The method therefore scales linearly in $n$ and $m$ [2307.16720].

For the area-gap formulation, the paper gives explicit pseudocode for computing ABHI for every curve in the sample on an equally spaced grid $t_1,\dots,t_m$ with spacing $\Delta t$. For each ordered pair of curves $(x_i,x_j)$ and each grid point, one computes
\[
\text{diff}\leftarrow x_i(t_\ell)-x_j(t_\ell),
\]
adds $\text{diff}$ whenever $\text{diff}>0$, and multiplies the accumulated sum by $\Delta t$ to approximate the integral. The stated complexity is $O(n^2 m)$ operations, with the additional remark that one can vectorize the inner loops or use matrix operations to reduce overhead [2507.05701]. This suggests that the differing complexity statements across the literature reflect different computational tasks: evaluating an index for a reference curve versus computing indices for all sample curves.

The 2023 clustering paper compares ABHI with Band Depth (BD) and Random Projection Depth (RPD). BD counts the fraction of time a curve lies within random bands formed by $k$ sample curves, with computational cost $O(n^k\cdot m)$ and combinatorial selection of $k$. RPD projects each curve onto random directions in the function space, applies a univariate depth on the projections, then averages, with cost $O(L\,n\,m)$ for $L$ random projections. By contrast, ABHI is presented as directly interpretable—one sees “how often the curve is above/below” the sample in each margin, or jointly for multivariate data—and as responsive to vertical shifts and to local crossings [2307.16720].

The 2025 outlier-detection paper sharpens that contrast by emphasizing that classical MEI and MHI rank functions by the fraction of the domain on which one curve lies above or below another, while ABEI and ABHI quantify the area between curves. A localized spike of height $\Delta$ on an interval $[a,b]$ yields $\mathrm{ABHI}\approx n\cdot \Delta\cdot(b-a)$, so an anomaly occupying a small fraction of the domain can still be prominent if its area is large [2507.05701].

## 6. EHyOut and the broader statistical role of ABHI

ABHI is a core component of EHyOut, the Area-Based Epigraph and Hypograph Outlier detection procedure. For each curve $x_i$, EHyOut constructs the six-dimensional representation
\[
(\mathrm{ABEI}(x_i), \mathrm{ABHI}(x_i), \mathrm{ABEI}(x_i'), \mathrm{ABHI}(x_i'), \mathrm{ABEI}(x_i''), \mathrm{ABHI}(x_i'')),
\]
where $x_i'$ and $x_i''$ are the first and second derivatives, typically estimated via spline smoothing. This feature matrix of size $n\times 6$ is then passed to a robust multivariate outlier algorithm, specifically the Comedian-based robust Mahalanobis distance [2507.05701].

The role of derivatives is explicit. Applying ABHI to $x'$ and $x''$ accentuates shape anomalies in slopes or curvature. A purely magnitude outlier may vanish under $x'$, whereas a pure shape outlier often peaks in these derivatives. The paper reports extensive simulation on 19 different data-generating processes and states that EHyOut has been shown to outperform or match specialized methods for magnitude, amplitude, and shape outliers, while remaining computationally competitive. Applications to Spanish weather data and United Nations world population data further illustrate the methodology [2507.05701].

In a different statistical direction, the dependence-measure literature uses an area-under-the-Kendall-curve construction that the supplied exposition labels ABHI. Let $X=(X_1,\ldots,X_d)^\top$ be a continuous $d$-variate random vector with joint cdf $F$, define $T=F(X)$, and let
\[
K_d(t)=P\{T\le t\},\qquad t\in[0,1].
\]
With $\Pi$ denoting the product-uniform benchmark, the relevant area quantity is
\[
AUK=\int_0^1 K_d(t)\,dK_\Pi(t)
=\int_0^1 K_d(t)\,k_\Pi(t)\,dt
=E[1-K_\Pi(T)]
=P\{T\le \Pi\}.
\]
The paper then forms a $2^d$-vector of AUK values over all sign-rotations and defines
\[
I=c_d\|D-\Delta\|_2,
\]
with a standardized version $I^*=\varphi_d(I)\in[0,1]$ [2011.12268]. This usage places the “hypograph” idea in a copula-based dependence framework rather than FDA.

Taken together, these strands show that ABHI serves as a bridge concept between ordering, deviation, and dependence. The precise mathematical object changes across settings, but the organizing principle remains the same: integrate a hypograph-based quantity so that geometric information accumulated over a domain becomes statistically actionable.

Source: https://www.emergentmind.com/topics/area-based-hypograph-index-abhi