Fetching the paper…
Reading the bibliography…
We propose a new clustering method based on optimal transportation.
On the translocation of masses
Kantorovich, L.V.: · 1942
Earlier work this paper cites.
Cluster analysis of multivariate data: efficiency versus interpretability of classifications
Forgy, E.W.: · 1965
Earlier work this paper cites.
Least squares quantization in pcm
Lloyd, S.: · 1982
Earlier work this paper cites.
A class of wasserstein metrics for probability distributions
Givens, C.R., Shortt, R.M., et al.: · 1984
Earlier work this paper cites.
Power diagrams: properties, algorithms and applications
Aurenhammer, F.: · 1987
Earlier work this paper cites.
Polar factorization and monotone rearrangement of vector-valued functions
Brenier, Y.: · 1991
Earlier work this paper cites.
Brain atrophy progression measured from registered serial mri: validation and application to alzheimer’s disease
Fox, N.C., Freeborough, P.A.: · 1997
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Rubner, Y., Tomasi, C., Guibas, L.J.: · 2000
Earlier work this paper cites.
On choosing and bounding probability metrics
Gibbs, A.L., Su, F.E.: · 2002
Earlier work this paper cites.
Delaunay refinement algorithms for triangular mesh generation
Shewchuk, J.R.: · 2002
Earlier work this paper cites.
Topics in optimal transportation
Villani, C.: · 2003
Earlier work this paper cites.
Volumetric harmonic brain mapping
Wang, Y., Gu, X., Chan, T.F., Thompson, P.M., Yau, S.T.: · 2004
Earlier work this paper cites.
Convex polyhedra
Alexandrov, A.D.: · 2005
Earlier work this paper cites.
A quality tetrahedral mesh generator and three-dimensional delaunay triangulator
Si, H., TetGen, A.: · 2006
Cited alongside, same era.
Foundations of quantization for probability distributions
Graf, S., Luschgy, H.: · 2007
Cited alongside, same era.
An efficient earth mover’s distance algorithm for robust histogram comparison
Ling, H., Okada, K.: · 2007
Cited alongside, same era.
k-means++: The advantages of careful seeding
Arthur, D., Vassilvitskii, S.: · 2007
Cited alongside, same era.
Computational conformal geometry
Gu, X.D., Yau, S.T.: · 2008
Cited alongside, same era.
Voro++: A three-dimensional voronoi cell library in c++
Rycroft, C.: · 2009
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M.: · 2013
Later among the works it cites.
Fast computation of wasserstein barycenters
Cuturi, M., Doucet, A.: · 2014
Later among the works it cites.
Domain adaptation with regularized optimal transport
Courty, N., Flamary, R., Tuia, D.: · 2014
Later among the works it cites.
Weighted triangulations for geometry processing
Goes, F.d., Memari, P., Mullen, P., Desbrun, M.: · 2014
Later among the works it cites.
Convolutional wasserstein distances: Efficient optimal transportation on geometric domains
Solomon, J., De Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., Guibas, L.: · 2015
Later among the works it cites.
A numerical algorithm for l2 semi-discrete optimal transport in 3d
Lévy, B.: · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cgal: The computational geometry algorithms library
Fabri, A., Pion, S.: · 2009
Cited alongside, same era.
Barycenters in the Wasserstein space
Agueh, M., Carlier, G.: · 2011
Cited alongside, same era.
A multiscale approach to optimal transport
Mérigot, Q.: · 2011
Cited alongside, same era.
Unsupervised clustering of multidimensional distributions using earth mover distance
Applegate, D., Dasu, T., Krishnan, S., Urbanek, S.: · 2011
Cited alongside, same era.
Freesurfer
Fischl, B.: · 2012
Cited alongside, same era.
Gu, X., Luo, F., Sun, J., Yau, S.T.: · 2013
Cited alongside, same era.
Fast discrete distribution clustering using Wasserstein barycenter with sparse support
Ye, J., Wu, P., Wang, J.Z., Li, J.: · 2017
Later among the works it cites.
Multilevel clustering via wasserstein means
Ho, N., Nguyen, X., Yurochkin, M., Bui, H.H., Huynh, V., Phung, D.: · 2017
Later among the works it cites.
Joint distribution optimal transportation for domain adaptation
Courty, N., Flamary, R., Habrard, A., Rakotomamonjy, A.: · 2017
Later among the works it cites.
Wasserstein generative adversarial networks
Arjovsky, M., Chintala, S., Bottou, L.: · 2017
Later among the works it cites.
Wasserstein introspective neural networks
Lee, K., Xu, W., Fan, F., Tu, Z.: · 2018
Closest in time.
Learning with a wasserstein loss
Frogner, C., Zhang, C., Mobahi, H., Araya, M., Poggio, T.A.: · 2061
Closest in time.