# Can the curse of dimensionality be solved by changing the metric tensor?

My (not too deep) understanding of the curse of dimensionality that affects a classification algorithm, such as k-Nearest Neighbor, is that at higher dimensions the 'sparsity' of euclidean space kicks in (this can be seen, for example by comparing the volume/content/measure of the unit ball with respect to the unit box)

I wanted to know if researchers have considered working on riemannian manifolds other than euclidean space (or spaces with other $L_p$ norms ($p \neq 2$)$^1$), say with metric tensor $\sum g_{ij} dx^i \otimes dx^j$ where the coefficients $g_{ij}$ are non-constant or maybe even dependent on the data?

1.Aggarwal C. C., Hinneburg A., Keim, D. A. (2001), ”On the Surprising Behavior of Distance Metrics in High Dimensional Space”

-