Schema matching using Gaussian mixture models with Wasserstein distance
Gaussian mixture models find their place as a powerful tool, mostly in the clustering problem, but with proper preparation also in feature extraction, pattern recognition, image segmentation and in general machine learning. When faced with the problem of schema matching, different mixture models computed on different pieces of data can maintain crucial information about the structure of the dataset. In order to measure or compare results from mixture models, the Wasserstein distance can be very useful, however it is not easy to calculate for mixture distributions. In this paper we derive one of possible approximations for the Wasserstein distance between Gaussian mixture models and reduce it to linear problem. Furthermore, application examples concerning real world data are shown.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringImage SegmentationSemantic SegmentationSimilar Papers 제목 키워드 기반
Gromov-Wasserstein-like Distances in the Gaussian Mixture Models Space
The Gromov-Wasserstein (GW) distance is frequently used in machine learning to compare distributions across distinct metric spaces. Despite its utility, it remains computationally intensive, especially for large-scale pr…
A Relaxed Wasserstein Distance Formulation for Mixtures of Radially Contoured Distributions
Recently, a Wasserstein-type distance for Gaussian mixture models has been proposed. However, that framework can only be generalized to identifiable mixtures of general elliptically contoured distributions whose componen…
Optimal Transport for Kernel Gaussian Mixture Models
The Wasserstein distance from optimal mass transport (OMT) is a powerful mathematical tool with numerous applications that provides a natural measure of the distance between two probability distributions. Several methods…
Slicing the Gaussian Mixture Wasserstein Distance
Gaussian mixture models (GMMs) are widely used in machine learning for tasks such as clustering, classification, image reconstruction, and generative modeling. A key challenge in working with GMMs is defining a computati…
ClusteringComputational EfficiencyDomain AdaptationImage Reconstructiondiscretize_distributions: Efficient Quantization of Gaussian Mixtures with Guarantees in Wasserstein Distance
We present discretize_distributions, a Python package that efficiently constructs discrete approximations of Gaussian mixture distributions and provides guarantees on the approximation error in Wasserstein distance. The …