Using Sequence Constraints for Modelling Network Interactions

This is an extension from a selected paper from JSAI2019. The ubiquitous nature of networks has led to a vast number of works dedicated to the study of capturing their information. Various graph-based techniques exist that report on the characteristics of nodes and edges, e.g., author-citation networks, social interactions, and so on. A significant amount of information can be extracted by summarizing the surrounding network structure of nodes, e.g., by capturing motives, or walk patterns. In this work, we present a new way of capturing the interaction between nodes in a network by making use of the sequence in which they occur. (1) The objective of this paper is to make use of behavioural constraint patterns; a concise but detailed report of node’s interactions can be constructed that can be used for various purposes. (2) It is shown how the constraint patterns can be mined form interaction data, and how they can be used for various applications. (3) A case study is presented which uses behavioural constraint patterns to profile user interactions in a communication network.

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

[2]  Jure Leskovec,et al.  node2vec: Scalable Feature Learning for Networks , 2016, KDD.

[3]  Massimo Mecella,et al.  A two-step fast algorithm for the automated discovery of declarative workflows , 2013, 2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM).

[4]  Jure Leskovec,et al.  Motifs in Temporal Networks , 2016, WSDM.

[5]  Hajo A. Reijers,et al.  UnconstrainedMiner: Efficient Discovery of Generalized Declarative Process Models , 2013 .

[6]  Jan Mendling,et al.  Efficient discovery of Target-Branched Declare constraints , 2016, Inf. Syst..

[7]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[8]  Johannes De Smedt,et al.  Behavioral Constraint Template-Based Sequence Classification , 2017, ECML/PKDD.

[9]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[10]  Graham Cormode,et al.  Node Classification in Social Networks , 2011, Social Network Data Analytics.

[11]  Chris H. Q. Ding,et al.  Link Analysis: Hubs and Authorities on the World Wide Web , 2004, SIAM Rev..

[12]  Wil M. P. van der Aalst,et al.  A Declarative Approach for Flexible Business Processes Management , 2006, Business Process Management Workshops.

[13]  Matthieu Latapy,et al.  Stream graphs and link streams for the modeling of interactions over time , 2017, Social Network Analysis and Mining.

[14]  Mohammad Hossein Namaki,et al.  Discovering Graph Temporal Association Rules , 2017, CIKM.

[15]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .