# On the optimality of kernels for high-dimensional clustering

@article{Vankadara2019OnTO, title={On the optimality of kernels for high-dimensional clustering}, author={Leena Chennuru Vankadara and Debarghya Ghoshdastidar}, journal={ArXiv}, year={2019}, volume={abs/1912.00458} }

This paper studies the optimality of kernel methods in high-dimensional data clustering. Recent works have studied the large sample performance of kernel clustering in the high-dimensional regime, where Euclidean distance becomes less informative. However, it is unknown whether popular methods, such as kernel k-means, are optimal in this regime. We consider the problem of high-dimensional Gaussian clustering and show that, with the exponential kernel function, the sufficient conditions for… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 14 REFERENCES

## NP-hardness of Euclidean sum-of-squares clustering

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL