References

Albert, R. and A.L. Barabasi, 2002. Statistical mechanics of complex networks. Rev. Modern Phys., 74: 47-97.
CrossRef  |  Direct Link  |  

Alexandrescu, A., C. Mitica and A. Ioan, 2011. Determining the best mutation probabilities of a genetic algorithm for mapping tasks. Buletinul Institutului Politehnic din Iasi, Iowa. http://www.ace.tuiasi.ro/users/103/f2_2011_2_(21_30)Alexandrescu.pdf

Ashok, S. and M. Judy, 2016. Exploring key gene interactions using particle swarm optimization. Intl. J. Pharma Bio Sci., 7: 734-741.
Direct Link  |  

Ashok, S. and M.V. Judy, 2015. A novel iterative partitioning approach for building prime clusters. Intl. J. Adv. Intell. Paradigms, 7: 313-325.
Direct Link  |  

Biedl, T.C., B. Brejova and T. Vinar, 2000. Simplifying flow networks. In: Proceedings of the International Symposium on Mathematical Foundations of Computer Science, Nielsen, M. and B. Rovan (Eds.). Springer, Berlin, Germany, pp: 192-201.

Bodenhofer, U., 2003. Genetic Algorithms: Theory and Applications. 3rd Edn., Fuzzy Logic Laboratorium Linz Hagenberg, Linz, Austria, Pages: 126.

Chapela, V., R. Criado, S. Moral and M. Romance, 2015. Mathematical Foundations: Complex Networks and Graphs (A Review). In: Intentional Risk Management Through Complex Networks Analysis, Victor, C., C. Regino, M. Santiago and R. Miguel (Eds.). Springer, Berlin, Germany, ISBN:978-3-319-26421-9, pp: 9-36.

Elsner, U., 1997. Graph Partitioning: A Survey. Chemnitz University of Technology, Chemnitz, Germany, Pages: 58.

Enright, J. and M. Kitty, 2015. Deleting edges to restrict the size of an epidemic: A new application for treewidth. Prceedings of the 9th International Conference on Combinatorial Optimization and Applications, December 18-20, 2015, Springer, Houston, Texas, ISBN:978-3-319-26625-1, pp: 574-585.

Eubank, S., H. Guclu, V.S.A. Kumar, M.V. Marathe, A. Srinivasan, Z. Toroczkai and N. Wang, 2004. Modeling disease outbreaks in realistic urban social networks. Nature, 429: 180-184.
PubMed  |  

Hadj, T.K. and H. Belbachir, 2014. Comparative study of quality measures of sequential rules for the clustering of web data. Models Optimisation Math. Anal. J., 2: 29-35.
Direct Link  |  

Leena, A.M., P. Surya, A. Sreeja and M.V. Judy, 2016. Application of ant colony optimization in identifying the key gene interactions.q Intl. J. Control Theory Appl., 9: 4211-4219.

Li, Z. and J. Liu, 2016. A multi-agent genetic algorithm for community detection in complex networks. Phys. A: Stat. Mech. Appl., 449: 336-347.
Direct Link  |  

Liu, G. and W. Limsoon, 2008. Effective pruning techniques for mining quasi-cliques. Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases, September 15-19, 2008, Springer, Antwerp, Belgium, pp: 33-49.

Lumley, T., 2011. Complex Surveys: A Guide to Analysis using R. John Wiley & Sons, Hoboken, New Jersey, ISBN:978-0-470-28430-8, Pages: 67.

Ma, K.L., 1999. Image graphs: A novel approach to visual data exploration. Proceedings of the Conference on Visualization'99 Celebrating Ten Years, October 22, 1999, IEEE, San Francisco, California, ISBN:0-7803-5897-X, pp: 81-88.

Misiołek, E. and D.Z. Chen, 2006. Two flow network simplification algorithms. Inf. Process. Lett., 97: 197-202.
Direct Link  |  

Pramanik, S., U.N. Chowdhury, B.K. Pramanik and N. Huda, 2010. A comparative study of bagging, boosting and C4.5: The recent improvements in decision tree learning algorithm. Asian J. Inform. Technol., 9: 300-306.
Direct Link  |  

Soni, N. and T. Kumar, 2014. Study of various mutation operators in genetic algorithms. Int. J. Comput. Sci. Inform. Technol., 5: 4519-4521.
Direct Link  |  

Sreeja, A. and U. Krishnakumar, 2017. Gene ontology based functional analysis and graph theory for partitioning gene interaction networks. Intl. J. Pharma Bio Sci., 8: 183-192.
Direct Link  |  

Sumathi-Punitha, C.P. and T. Santhanam, 2007. A combination of genetic algorithm and ART neural network for breast cancer diagnosis. Asia J. Inform. Technol., 6: 112-117.
CrossRef  |  Direct Link  |  

Toivonen, H., S. Mahler and F. Zhou, 2010. A framework for path-oriented network simplification. Proceedings of the 9th International Symposium on Intelligent Data Analysis (IDA 2010), Springer, Tucson, Arizona, May 19-21, 2010, pp: 220-231.

Toussaint, G.T., 1980. The relative neighbourhood graph of a finite planar set. Pattern Recognit., 12: 261-268.
Direct Link  |  

Wang, K., B. Wang and L. Peng, 2009. CVAP: Validation for cluster analyses. Data Sci. J., 8: 88-93.
Direct Link  |  

Zhou, F., 2012. Methods for Network Abstraction. University of Helsinki, Helsinki, Finland, ISBN:978-952-10-8157-6, Pages: 56.

Zhou, F., S. Mahler and H. Toivonen, 2012. Simplification of Networks by Edge Pruning. In: Bisociative Knowledge Discovery, Michael, R.B. (Ed.). Springer, Berlin, Germany, ISBN:978-3-642-31829-0, pp: 179-198.