MinerLSD: Efficient Local Pattern Mining on Attributed Graphs

Local pattern mining on attributed graphs is an important and interesting research area combining ideas from network analysis and graph mining. In this paper, we present MinerLSD, a method for efficient local pattern mining on attributed graphs. In order to prevent the typical pattern explosion in pattern mining, we employ closed patterns for focusing pattern exploration. In addition, we exploit efficient techniques for pruning the pattern space: We adapt a local variant of the Modularity metric with optimistic estimates, and include graph abstractions. Our experiments on several standard datasets demonstrate the efficacy of our proposed novel method MinerLSD as an efficient method for local pattern mining on attributed graphs.

[1]  Henry Soldano,et al.  Local Knowledge Discovery in Attributed Graphs , 2015, 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI).

[2]  Johannes Fürnkranz,et al.  From Local Patterns to Global Models: The LeGo Approach to Data Mining , 2008 .

[3]  Martin Atzmüller,et al.  Description-oriented community detection using exhaustive subgroup discovery , 2016, Inf. Sci..

[4]  Henry Soldano,et al.  Graph abstraction for closed pattern mining in attributed networks , 2014, ECAI.

[5]  Florian Lemmerich,et al.  Generic Pattern Trees for Exhaustive Exceptional Model Mining , 2012, ECML/PKDD.

[6]  Martin Atzmüller,et al.  Detecting community patterns capturing exceptional link trails , 2016, 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[7]  Stefan Wrobel,et al.  An Algorithm for Multi-relational Discovery of Subgroups , 1997, PKDD.

[8]  Frank Puppe,et al.  Fast exhaustive subgroup discovery with numerical target concepts , 2016, Data Mining and Knowledge Discovery.

[9]  Aristides Gionis,et al.  Overlapping community detection in labeled graphs , 2014, Data Mining and Knowledge Discovery.

[10]  Francesco Bonchi,et al.  Description-Driven Community Detection , 2014, TIST.

[11]  P. D. Laat.  The collegial phenomenon. The social mechanisms of cooperation among peers in a corporate law partnership , 2003 .

[12]  Martin Atzmuller,et al.  Knowledge-Intensive Subgroup Mining: Techniques for Automatic and Interactive Discovery , 2007 .

[13]  Vladimir Batagelj,et al.  Fast algorithms for determining (generalized) core groups in social networks , 2011, Adv. Data Anal. Classif..

[14]  Gerd Stumme,et al.  Temporal evolution of contacts and communities in networks of face-to-face human interactions , 2014, Science China Information Sciences.

[15]  Martin Atzmüller,et al.  Efficient Descriptive Community Mining , 2011, FLAIRS.

[16]  Céline Robardet,et al.  Exceptional contextual subgraph mining , 2017, Machine Learning.

[17]  François Radvanyi,et al.  CoRegNet: reconstruction and integrated analysis of co-regulatory networks , 2015, Bioinform..

[18]  Florian Lemmerich,et al.  Exploratory pattern mining on social media using geo-references and social tagging information , 2013, Int. J. Web Sci..

[19]  Andreas Hotho,et al.  Analysis of Social Media and Ubiquitous Data , 2011, Lecture Notes in Computer Science.

[20]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

[21]  Florian Lemmerich,et al.  VIKAMINE - Open-Source Subgroup Discovery, Pattern Mining, and Analytics , 2012, ECML/PKDD.

[22]  Henry Soldano,et al.  Hub-Authority Cores and Attributed Directed Network Mining , 2017, 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI).

[23]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[24]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[25]  Nathalie Pernelle,et al.  ZooM: a nested Galois lattices-based system for conceptual clustering , 2002, J. Exp. Theor. Artif. Intell..

[26]  Mohammed J. Zaki,et al.  Mining Attribute-structure Correlated Patterns in Large Attributed Graphs , 2012, Proc. VLDB Endow..

[27]  Willi Klösgen,et al.  Explora: A Multipattern and Multistrategy Discovery Assistant , 1996, Advances in Knowledge Discovery and Data Mining.

[28]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[29]  Katharina Morik,et al.  Detecting Interesting Instances , 2002, Pattern Detection and Discovery.

[30]  Martin Ester,et al.  Mining Cohesive Patterns from Graphs with Feature Vectors , 2009, SDM.

[31]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[32]  Nicolas Pasquier,et al.  Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..

[33]  Tsvi Kuflik,et al.  Second workshop on information heterogeneity and fusion in recommender systems (HetRec2011) , 2011, RecSys '11.

[34]  M. Atzmueller.  Subgroup Discovery – Advanced Review , 2015 .

[35]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[36]  Andreas Hotho,et al.  The social distributional hypothesis: a pragmatic proxy for homophily in online social networks , 2014, Social Network Analysis and Mining.

[37]  Stefan Wrobel,et al.  Listing closed sets of strongly accessible set systems with applications to data , 2010, LWA.

[38]  Hiroki Arimura,et al.  An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases , 2004, Discovery Science.

[39]  Martin Atzmüller,et al.  Compositional Subgroup Discovery on Attributed Social Interaction Networks , 2018, DS.

[40]  Marc Plantevit,et al.  Unsupervised Exceptional Attributed Sub-Graph Mining in Urban Data , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).

[41]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[42]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[43]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[44]  Stefan Wrobel,et al.  Tight Optimistic Estimates for Fast Subgroup Discovery , 2008, ECML/PKDD.

[45]  Andreas Hotho,et al.  On the Semantics of User Interaction in Social Media , 2013, LWA.

[46]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[47]  Marc Plantevit,et al.  Mining Graph Topological Patterns: Finding Covariations among Vertex Descriptors , 2013, IEEE Transactions on Knowledge and Data Engineering.

[48]  Dominik Benz,et al.  Community Assessment Using Evidence Networks , 2010, MSM/MUSE.

[49]  Thomas Seidl,et al.  GAMer: a synthesis of subspace clustering and dense subgraph mining , 2013, Knowledge and Information Systems.

[50]  Martin Atzmüller,et al.  Data Mining on Social Interaction Networks , 2013, J. Data Min. Digit. Humanit..

[51]  Vladimir Batagelj,et al.  Generalized Cores , 2002, ArXiv.

[52]  Ravi Kumar,et al.  Structure and evolution of online social networks , 2006, KDD '06.

[53]  Juan A. Almendral,et al.  The network of scientific collaborations within the European framework programme , 2007, 0901.3375.

[54]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.