Mining Network Motif Discovery by Learning Techniques

Properties of complex networks represent a powerful set of tools that can be used to study the complex behaviour of these systems of interconnections. They can vary from properties represented as simplistic metrics (number of edges and nodes) to properties that reflect complex information of the connection between entities part of the network (assortativity degree, density or clustering coefficient). Such a topological property that has valuable implications on the study of the networks dynamics are network motifs - patterns of interconnections found in real-world networks. Knowing that one of the biggest issue with network motifs discovery is its algorithmic NP-complete nature, this paper intends to present a method to detect if a network is prone or not to generate motifs by making use of its topological properties while training various classification models. This approach wants to serve as a time saving pre-processing step for the state-of-the-art solutions used to detect motifs in Complex networks.

[1]  Tianqi Chen,et al.  XGBoost: A Scalable Tree Boosting System , 2016, KDD.

[2]  Laura Diosan,et al.  Study of Connection between articulation Points and Network motifs in Complex Networks , 2019, ECIS.

[3]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[4]  Pontus Svenson,et al.  Complex networks and social network analysis in information fusion , 2006, 2006 9th International Conference on Information Fusion.

[5]  S. Shen-Orr,et al.  Network motifs in the transcriptional regulation network of Escherichia coli , 2002, Nature Genetics.

[6]  Taghi M. Khoshgoftaar,et al.  Experimental perspectives on learning from imbalanced data , 2007, ICML '07.

[7]  Xuequn Shang,et al.  Detection of Network Motif Based on a Novel Graph Canonization Algorithm from Transcriptional Regulation Networks , 2017, Molecules.

[8]  Sebastian Wernicke,et al.  A Faster Algorithm for Detecting Network Motifs , 2005, WABI.

[9]  Jérôme Kunegis,et al.  Fairness on the web: alternatives to the power law , 2012, WebSci '12.

[10]  Sahar Asadi,et al.  Kavosh: a new algorithm for finding network motifs , 2009, BMC Bioinformatics.

[11]  K. G. Srinivasa,et al.  Basics of Graph Theory , 2018 .

[12]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[13]  Mark Johnston,et al.  Developing New Fitness Functions in Genetic Programming for Classification With Unbalanced Data , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[14]  Lei Zhang,et al.  Online Social Networks Based on Complex Network Theory and Simulation Analysis , 2015 .

[15]  Uri Alon,et al.  Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs , 2004, Bioinform..

[16]  Senén Barro,et al.  Do we need hundreds of classifiers to solve real world classification problems? , 2014, J. Mach. Learn. Res..

[17]  F. Schreiber,et al.  MODA: an efficient algorithm for network motif discovery in biological networks. , 2009, Genes & genetic systems.

[18]  A. Barab'asi,et al.  The Network Behind the Cosmic Web , 2016, 1604.03236.

[19]  Piet Van Mieghem,et al.  Assortativity in complex networks , 2015, J. Complex Networks.

[20]  Laura Diosan,et al.  Parallel Acceleration of Subgraph Enumeration in the Process of Network Motif Detection , 2018, 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).

[21]  Joshua A. Grochow,et al.  Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking , 2007, RECOMB.

[22]  Laura Diosan,et al.  An empirical analysis of the correlation between the motifs frequency and the topological properties of complex networks , 2019, KES.