Mean field models for large data-clustering problems
From MaRDI portal
Publication:828467
DOI10.3934/NHM.2020027zbMATH Open1451.82045arXiv1907.03585OpenAlexW3084688668MaRDI QIDQ828467FDOQ828467
Authors: Michael Herty, Lorenzo Pareschi, Giuseppe Visconti 
Publication date: 8 January 2021
Published in: Networks and Heterogeneous Media (Search for Journal in Brave)
Abstract: We consider mean-field models for data--clustering problems starting from a generalization of the bounded confidence model for opinion dynamics. The microscopic model includes information on the position as well as on additional features of the particles in order to develop specific clustering effects. The corresponding mean--field limit is derived and properties of the model are investigated analytically. In particular, the mean--field formulation allows the use of a random subsets algorithm for efficient computations of the clusters. Applications to shape detection and image segmentation on standard test images are presented and discussed.
Full work available at URL: https://arxiv.org/abs/1907.03585
Recommendations
- Clustering with constraints: a mean-field approximation perspective
- A mean field games approach to cluster analysis
- Bayesian nonparametric clustering for large data sets
- Large-sample results for optimization-based clustering methods
- Clustering of big data: consistency of a nonlocal Ginzburg-Landau type model
- A PROBABILISTIC ℓ1 METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA
- Phase transitions for high dimensional clustering and related problems
- Model-based clustering of probability density functions
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Kinetic theory of gases in time-dependent statistical mechanics (82C40)
Cites Work
- Title not available (Why is that?)
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Continuous-time average-preserving opinion dynamics with opinion-dependent communications
- Particle, kinetic, and hydrodynamic models of swarming
- Emergent Behavior in Flocks
- Modeling of self-organized systems interacting with a few individuals: from microscopic to macroscopic dynamics
- Interacting multiagent systems. Kinetic equations and Monte Carlo methods
- Heterophilious dynamics enhances consensus
- Boltzmann and Fokker-Planck equations modelling opinion formation in the presence of strong leaders
- Binary Interaction Algorithms for the Simulation of Flocking and Swarming Dynamics
- Title not available (Why is that?)
- A new model for self-organized dynamics and its flocking behavior
- An Eulerian approach to the analysis of Krause's consensus models
- A well-posedness theory in measures for some kinetic models of collective motion
- On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity
- Modelling opinion formation by means of kinetic equations
- Opinion dynamics over complex networks: kinetic modelling and numerical methods
- A macroscopic model for a system of swarming agents using curvature control
- Kinetic models for traffic flow resulting in a reduced space of microscopic velocities
- Clustering and asymptotic behavior in opinion formation
- A consensus-based model for global optimization and its mean-field limit
- Opinion dynamics: kinetic modelling with mass media, application to the Scottish independence referendum
- Vehicular traffic, crowds, and swarms: from kinetic theory and multiscale methods to applications and research perspectives
- Consensus formation under bounded confidence.
- Asymptotic analysis of continuous opinion dynamics models under bounded confidence
- An analytical framework for consensus-based global optimization method
Cited In (8)
- Title not available (Why is that?)
- Clustering of big data: consistency of a nonlocal Ginzburg-Landau type model
- A mean field games approach to cluster analysis
- A mean field games model for finite mixtures of Bernoulli and categorical distributions
- Replica analysis of Bayesian data clustering
- Binary interaction methods for high dimensional global optimization and machine learning
- Reproducing kernel Hilbert spaces in the mean field limit
- Reduced variance random batch methods for nonlocal PDEs
Uses Software
This page was built for publication: Mean field models for large data-clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828467)
