z-logo
open-access-imgOpen Access
Mean field models for large data–clustering problems
Author(s) -
Michaël Herty,
Lorenzo Pareschi,
Giuseppe Visconti
Publication year - 2020
Publication title -
networks and heterogeneous media
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.732
H-Index - 34
eISSN - 1556-181X
pISSN - 1556-1801
DOI - 10.3934/nhm.2020027
Subject(s) - cluster analysis , generalization , bounded function , limit (mathematics) , mean shift , computer science , computation , field (mathematics) , segmentation , mean field theory , algorithm , mathematics , artificial intelligence , mathematical analysis , physics , quantum mechanics , pure mathematics
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom