.png){kind=icon}
返回
Transfer-Learning-Based Gaussian Mixture Model for Distributed Clustering
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2022.3177242.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distributed clustering based on the Gaussian mixture model (GMM) has exhibited excellent clustering capabilities in peer-to-peer (P2P) networks. However, more iterative numbers and communication overhead are required to achieve the consensus in existing distributed GMM clustering algorithms. In addition, the truth that it cannot find a closed form for the update of parameters in GMM causes the imprecise clustering accuracy. To solve these issues, by utilizing the transfer learning technique, a general transfer distributed GMM clustering framework is exploited to promote the clustering performance and accelerate the clustering convergence. In this work, each node is treated as both the source domain and the target domain, and these nodes can learn from each other to complete the clustering task in distributed P2P networks. Based on this framework, the transfer distributed expectation-maximization algorithm with the fixed learning rate is first presented for data clustering. Then, an improved version is designed to obtain the stable clustering accuracy, in which an adaptive transfer learning strategy is adopted to adjust the learning rate automatically instead of a fixed value. To demonstrate the extensibility of the proposed framework, a representative GMM clustering method, the entropy-type classification maximum-likelihood algorithm, is further extended to the transfer distributed counterpart. Experimental results verify the effectiveness of the presented algorithms in contrast with the existing GMM clustering approaches.
Keyword:
Clustering algorithms
Distributed databases
Peer-to-peer computing
Transfer learning
Clustering methods
Maximum likelihood estimation
Gaussian mixture model
Distributed clustering
Gaussian mixture model (GMM)
peer-to-peer networks
transfer learning
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Fully Homomorphic based Privacy-Preserving Distributed Expectation Maximization on Cloud云上基于完全同态的隐私保护分布式期望最大化
PREAI
分享收藏分享收藏
Dental radiography segmentation using expectation-maximization clustering and grasshopper optimizer
PREAI
分享收藏
查看更多内容