Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks
From MaRDI portal
Publication:1757674
DOI10.1007/s11424-018-7102-3zbMath1405.93096OpenAlexW2885546234WikidataQ129386018 ScholiaQ129386018MaRDI QIDQ1757674
Yiguang Hong, Peng Lin, Yinghui Wang, Hong-Sheng Qi
Publication date: 15 January 2019
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-018-7102-3
Decentralized systems (93A14) Software, source code, etc. for problems pertaining to systems and control theory (93-04) Agent technology and artificial intelligence (68T42)
Related Items (2)
Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate ⋮ Adaptive guaranteed-performance consensus control for multi-agent systems with an adjustable convergence speed
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Distributed finite-time calculation of node eccentricities, graph radius and graph diameter
- Target aggregation of second-order multi-agent systems with switching interconnection
- Leader-following consensus for discrete-time multi-agent systems with parameter uncertainties based on the event-triggered strategy
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- Constrained Clustering
- Least squares quantization in PCM
- Distributed Subgradient Methods for Multi-Agent Optimization
This page was built for publication: Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks