Privacy-preserving Continual Federated Clustering via Adaptive Resonance Theory

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Masuyama, Naoki, Nojima, Yusuke, Toda, Yuichiro, Loo, Chu Kiong, Ishibuchi, Hisao, Kubota, Naoyuki
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910629816696832
author Masuyama, Naoki
Nojima, Yusuke
Toda, Yuichiro
Loo, Chu Kiong
Ishibuchi, Hisao
Kubota, Naoyuki
author_facet Masuyama, Naoki
Nojima, Yusuke
Toda, Yuichiro
Loo, Chu Kiong
Ishibuchi, Hisao
Kubota, Naoyuki
contents With the increasing importance of data privacy protection, various privacy-preserving machine learning methods have been proposed. In the clustering domain, various algorithms with a federated learning framework (i.e., federated clustering) have been actively studied and showed high clustering performance while preserving data privacy. However, most of the base clusterers (i.e., clustering algorithms) used in existing federated clustering algorithms need to specify the number of clusters in advance. These algorithms, therefore, are unable to deal with data whose distributions are unknown or continually changing. To tackle this problem, this paper proposes a privacy-preserving continual federated clustering algorithm. In the proposed algorithm, an adaptive resonance theory-based clustering algorithm capable of continual learning is used as a base clusterer. Therefore, the proposed algorithm inherits the ability of continual learning. Experimental results with synthetic and real-world datasets show that the proposed algorithm has superior clustering performance to state-of-the-art federated clustering algorithms while realizing data privacy protection and continual learning ability. The source code is available at \url{https://github.com/Masuyama-lab/FCAC}.
format Preprint
id arxiv_https___arxiv_org_abs_2309_03487
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Privacy-preserving Continual Federated Clustering via Adaptive Resonance Theory
Masuyama, Naoki
Nojima, Yusuke
Toda, Yuichiro
Loo, Chu Kiong
Ishibuchi, Hisao
Kubota, Naoyuki
Machine Learning
Cryptography and Security
Neural and Evolutionary Computing
With the increasing importance of data privacy protection, various privacy-preserving machine learning methods have been proposed. In the clustering domain, various algorithms with a federated learning framework (i.e., federated clustering) have been actively studied and showed high clustering performance while preserving data privacy. However, most of the base clusterers (i.e., clustering algorithms) used in existing federated clustering algorithms need to specify the number of clusters in advance. These algorithms, therefore, are unable to deal with data whose distributions are unknown or continually changing. To tackle this problem, this paper proposes a privacy-preserving continual federated clustering algorithm. In the proposed algorithm, an adaptive resonance theory-based clustering algorithm capable of continual learning is used as a base clusterer. Therefore, the proposed algorithm inherits the ability of continual learning. Experimental results with synthetic and real-world datasets show that the proposed algorithm has superior clustering performance to state-of-the-art federated clustering algorithms while realizing data privacy protection and continual learning ability. The source code is available at \url{https://github.com/Masuyama-lab/FCAC}.
title Privacy-preserving Continual Federated Clustering via Adaptive Resonance Theory
topic Machine Learning
Cryptography and Security
Neural and Evolutionary Computing
url https://arxiv.org/abs/2309.03487