Naoki Masuyama

Dr. Naoki Masuyama

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 June 2019 in IEEE Access
Verified
Journal Article
Open access
NMNaoki Masuyama
Naoki Masuyama
CLChu Kiong Loo
Chu Kiong Loo
HIHisao Ishibuchi
Hisao Ishibuchi
NKNaoyuki Kubota
Naoyuki Kubota
YNYusuke Nojima
Yusuke Nojima
YLYiping Liu
Yiping Liu
This paper proposes a topological clustering algorithm by integrating topological structure and information theoretic learning, i.e., correntropy, into adaptive resonance theory (ART). Specifically, the proposed algorithm utilizes the correntropy induced metric (CIM) for defining a similarity measure, a node insertion criterion, and an edge creation criterion. Other types of the ART-based topological clustering algorithms have been developed, however, these algorithms have various drawbacks such as a large number of parameters, sensitivity to noisy data. Moreover, generated topological networks cannot represent the distribution of data. In contrast, the proposed algorithm realizes a stable computation and reduces the number of parameters compared to existing algorithms. Furthermore, improving the ability to express the data structure more appropriately by the topological network, a mechanism that adaptively controls the node insertion criterion is introduced to the proposed algorithm. The experimental results showed that the proposed algorithm has superior performance with respect to the self-organizing and the classification abilities compared with the state-of-the-art topological clustering algorithms.

19 December 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
NMNaoki Masuyama
Naoki Masuyama
YNYusuke Nojima
Yusuke Nojima
CLChu Kiong Loo
Chu Kiong Loo
HIHisao Ishibuchi
Hisao Ishibuchi
This paper proposes a multi-label classification algorithm capable of continual learning by applying an Adaptive Resonance Theory (ART)-based clustering algorithm and the Bayesian approach for label probability computation. The ART-based clustering algorithm adaptively and continually generates prototype nodes corresponding to given data, and the generated nodes are used as classifiers. The label probability computation independently counts the number of label appearances for each class and calculates the Bayesian probabilities. Thus, the label probability computation can cope with an increase in the number of labels. Experimental results with synthetic and real-world multi-label datasets show that the proposed algorithm has competitive classification performance to other well-known algorithms while realizing continual learning.

27 June 2022 in IEEE Access
Verified
Journal Article
Open access
NMNaoki Masuyama
Naoki Masuyama
NANarito Amako
Narito Amako
YYYuna Yamada
Yuna Yamada
YNYusuke Nojima
Yusuke Nojima
HIHisao Ishibuchi
Hisao Ishibuchi
Adaptive Resonance Theory (ART) is considered as an effective approach for realizing continual learning thanks to its ability to handle the plasticity-stability dilemma. In general, however, the clustering performance of ART-based algorithms strongly depends on the specification of a similarity threshold, i.e., a vigilance parameter, which is data-dependent and specified by hand. This paper proposes an ART-based topological clustering algorithm with a mechanism that automatically estimates a similarity threshold from the distribution of data points. In addition, for improving information extraction performance, a divisive hierarchical clustering algorithm capable of continual learning is proposed by introducing a hierarchical structure to the proposed algorithm. Experimental results demonstrate that the proposed algorithm has high clustering performance comparable with recently-proposed state-of-the-art hierarchical clustering algorithms.

3 February 2017 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
NMNaoki Masuyama
Naoki Masuyama
CLChu Kiong Loo
Chu Kiong Loo
MSManjeevan Seera
Manjeevan Seera
NKNaoyuki Kubota
Naoyuki Kubota
Quantum-inspired computing is an emerging research area, which has significantly improved the capabilities of conventional algorithms. In general, quantum-inspired hop-field associative memory (QHAM) has demonstrated quantum information processing in neural structures. This has resulted in an exponential increase in storage capacity while explaining the extensive memory, and it has the potential to illustrate the dynamics of neurons in the human brain when viewed from quantum mechanics perspective although the application of QHAM is limited as an autoassociation. We introduce a quantum-inspired multidirectional associative memory (QMAM) with a one-shot learning model, and QMAM with a self-convergent iterative learning model (IQMAM) based on QHAM in this paper. The self-convergent iterative learning enables the network to progressively develop a resonance state, from inputs to outputs. The simulation experiments demonstrate the advantages of QMAM and IQMAM, especially the stability to recall reliability.

12 August 2024 in IEEE Access
Verified
Journal Article
Open access
YTYuichiro Toda
Yuichiro Toda
NMNaoki Masuyama
Naoki Masuyama
3D space perception is one of the key technologies for autonomous mobile robots that perform tasks in unknown environments. Among these, building global topological maps for autonomous mobile robots is a challenging task. In this study, we propose a method for learning topological structures from unknown data distributions based on competitive learning, a type of unsupervised learning. For this purpose, adaptive resonance theory-based Topological Clustering (ATC), which can avoid catastrophic forgetting of previously measured point clouds, is applied as a learning method. Furthermore, by extending ATC with Different Topologies (ATC-DT) with multiple topological structures for extracting the traversable information of terrain environments, a path planning method is realized that can reach target points set in an unknown environment. Path planning experiments in unknown environments show that, compared to other methods, ATC-DT can build a global topology map with high accuracy and stability using only measured 3D point cloud and robot position information.

24 September 2024 in IEEE Access
Verified
Journal Article
Open access
NMNaoki Masuyama
Naoki Masuyama
YNYusuke Nojima
Yusuke Nojima
YTYuichiro Toda
Yuichiro Toda
CLChu Kiong Loo
Chu Kiong Loo
HIHisao Ishibuchi
Hisao Ishibuchi
NKNaoyuki Kubota
Naoyuki Kubota
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 showthat 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 https://github.com/Masuyama-lab/FCAC.