Statistical Selection of Relevant Features to Classify Random, Scale Free and Exponential Networks
- 1k Downloads
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.
KeywordsComplex Networks Internet Modeling Classification Variable Selection Experimental Design
Unable to display preview. Download preview PDF.
- 4.Costa, L., Rodrigues, F.A., Travieso, G., Villas, P.R. “Characterization of Complex Networks: A survey of measurements.” http://arxiv.org/PS_cache/cond-mat/pdf/0505/0505185v5.pdf (2007)Google Scholar
- 6.Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Nature. Vol. 506. (2000). 5234–5237.Google Scholar
- 10.Sen, P., Dasgupta, S., Chatterjee, A., Sreeram, P.A., Mukherjee, G., Manna, S. S.: Small-world properties of the Indian Railway network. Physical Review E. Vol. 67. (2003).Google Scholar
- 11.Barabási, A.L. Albert, R.: Emergence of Scaling in Random Networks. Science. (1999). 509–512Google Scholar
- 13.Montgomery, D.C.: Diseño y Análisis de Experimentos. Limusa Wiley. (2004)Google Scholar
- 14.Jonhson, D.E.: Métodos multivariados aplicados al análisis de datos. International Thomson Editores. (2000)Google Scholar
- 16.Singhi, S.K., Liu, H.: Feature Subset Selection Bias for Classification Learning. Proceedings of the 23rd ICML. ACM ICPS. Vol. 148. (2006). 849–856.Google Scholar
- 18.Middendorf, M., Ziv, E., Adams, C., Hom, J., Koytcheff, R., Levovitz, C., Woods G., Chen, L., Wiggins, C.: Discriminative Topological Features Reveal Biological Network Mechanisms. BMC Bioinformatics 2004. Vol 5, No. 181 (2004).Google Scholar
- 19.Ziv, E., Koytcheff, R., Middendrof, M., Wiggins, C.: Systematic Identification of statistically significant network measures. http://arxiv.org/PS_cache/cond-mat/pdf/0306/0306610v3.pdf (2005)Google Scholar
- 20.Ali, W., Mondragón, R.J., Alavi, F.: Extraction of topological features from communication network topological patterns using self-organizing feature maps.Google Scholar