In this paper a statistical selection of relevant features is presented. An experiment was designed to select relevant and not redundant features or characterization functions, which allow quantitatively discriminating among different types of complex networks. As well there exist researchers given to the task of classifying some networks of the real world through characterization functions inside a type of complex network, they do not give enough evidences of detailed analysis of the functions that allow to determine if all are necessary to carry out an efficient discrimination or which are better functions for discriminating. Our results show that with a reduced number of characterization functions such as the shortest path length, standard deviation of the degree, and local efficiency of the network can discriminate efficiently among the types of complex networks treated here. © 2007 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Cruz Reyes, L., Meza Conde, E., Turrubiates López, T., Gómez Santillán, C. G., & Ortega Izaguirre, R. (2007). Statistical selection of relevant features to classify random, scale free and exponential networks. In Advances in Soft Computing (Vol. 44, pp. 454–461). https://doi.org/10.1007/978-3-540-74972-1_59
Mendeley helps you to discover research relevant for your work.