Abstract
An important property of the competitive neural models for data clustering is autonomous discovery of the data structure without a need of a priori knowledge. Growing Neural Gas (GNG) is one of the commonly used incremental clustering models that aims at preserving the topology and the distribution of the input data. Keeping the data distribution unchanged has already been recognized as a problem leading to bias sampling of input data. This is undesired for the use cases such as mobile network management and troubleshooting where is important to capture all the relevant network states uniformly. In this paper we propose a novel incremental clustering approach called Fixed Resolution GNG (FRGNG) that keeps the input data representation at the fixed resolution avoiding the oversampling and undersampling problems of original GNG algorithm. Furthermore, FRGNG introduces a native stopping criteria by terminating the run once the input data is represented with the desired fixed resolution. Additionally, the FRGNG has a potential of the algorithm acceleration which is especially important when large input data set is applied. We apply the FRGNG model to analyze the mobile network performance data and evaluate its benefits compared to GNG approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kohonen, T.: Self-organized formation of topologically correct feature maps. Biological Cybernetics 69, 43–59 (1982)
Fritzke, B.: A growing neural gas network learns topologies. In: Advances in Neural Information Processing Systems, vol. 6, no. 3, pp. 625–632. MIT Press, Cambridge (1995)
GNG R package. https://github.com/kudkudak/Growing-Neural-Gas
Satizábal, H.F., Pérez-Uribe, A., Tomassini, M.: Prototype proliferation in the growing neural gas algorithm. In: Kůrková, V., Neruda, R., Koutník, J. (eds.) ICANN 2008, Part II. LNCS, vol. 5164, pp. 793–802. Springer, Heidelberg (2008)
Cselenyi, Z.: Mapping the dimensionality, density and topology of data: The growing adaptive neural gas. Computer Methods and Programs in Biomedicine, 141–156 (2005)
Villmann, T., Claussen, J.C.: Magnification Control in Self-Organizing Maps and Neural Gas. Neural Computation, 446–449 (2006)
Marsland, S., Shapiro, J., Nehmzow, U.: A self-organizing network that grows when required. Neural Networks, 1041–1058 (2002)
Quintana-Pacheco, Y., Ruiz-Fernández, D., Magrans-Rico, A.: Growing Neural Gas approach for obtaining homogeneous maps by restricting the insertion of new nodes. Neural Networks (2014). http://dx.doi.org/10.1016/j.neunet.2014.01.005
Canales, F., Chacón, M.: Modification of the growing neural gas algorithm for cluster analysis. In: Rueda, L., Mery, D., Kittler, J. (eds.) CIARP 2007. LNCS, vol. 4756, pp. 684–693. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Nováczki, S., Gajic, B. (2015). Fixed-Resolution Growing Neural Gas for Clustering the Mobile Networks Data. In: Iliadis, L., Jayne, C. (eds) Engineering Applications of Neural Networks. EANN 2015. Communications in Computer and Information Science, vol 517. Springer, Cham. https://doi.org/10.1007/978-3-319-23983-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-23983-5_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23981-1
Online ISBN: 978-3-319-23983-5
eBook Packages: Computer ScienceComputer Science (R0)