This paper describes a method for finding the topology of a data distribution online using a new growing graph network architecture. Many growing neural networks for finding the topology of data online, such as the Growing Neural Gas, depend on the order and number of input data. For this reason, conventional methods have certain drawbacks: weakness to noise, generating redundant nodes, requiring a great deal of input data, and so on. The proposed method is robust with respect to these issues since it has been developed from the viewpoint of a generative model. This paper presents both the theory and an algorithm in this paper. Moreover, the effectiveness of the proposed method is shown by experiments comparing the proposed method with various growing graph networks. 
Growing topology representing network