Distributed frequent subgraph mining on evolving graph using SPARK

[1]  Joost N. Kok,et al.  A quickstart in frequent structure mining can make a difference , 2004, KDD.

[2]  Wajdi Dhifli,et al.  MR-SimLab: Scalable subgraph selection with label similarity for big data , 2013, Inf. Syst..

[3]  Young-Koo Lee,et al.  Supergraph based periodic pattern mining in dynamic social networks , 2017, Expert Syst. Appl..

[4]  George Karypis,et al.  Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[5]  Philip S. Yu,et al.  Moment: maintaining closed frequent itemsets over a stream sliding window , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[6]  Ansamma John,et al.  A distributed approach to weighted frequent Subgraph mining , 2016, 2016 International Conference on Emerging Technological Trends (ICETT).

[7]  Mohammad Al Hasan,et al.  An Iterative MapReduce Based Frequent Subgraph Mining Algorithm , 2013, IEEE Transactions on Knowledge and Data Engineering.

[8]  Aidong Zhang,et al.  Predicting Protein Function by Frequent Functional Association Pattern Mining in Protein Interaction Networks , 2010, IEEE Transactions on Information Technology in Biomedicine.

[9]  Stefan Kramer,et al.  Online Structural Graph Clustering Using Frequent Subgraph Mining , 2010, ECML/PKDD.

[10]  R. Prabhakar,et al.  Frequent Subgraph Mining Algorithms – A Survey , 2015 .

[11]  Siegfried Nijssen,et al.  What Is Frequent in a Single Graph? , 2007, PAKDD.

[12]  Wolfgang Lehner,et al.  Frequent patterns in ETL workflows: An empirical approach , 2017, Data Knowl. Eng..

[13]  Jiawei Han,et al.  CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.

[14]  Jiong Yang,et al.  SPIN: mining maximal frequent subgraphs from graph databases , 2004, KDD.

[15]  Panos Kalnis,et al.  Incremental Frequent Subgraph Mining on Large Evolving Graphs , 2017, IEEE Transactions on Knowledge and Data Engineering.

[16]  Mohammed J. Zaki,et al.  A distributed approach for graph mining in massive networks , 2016, Data Mining and Knowledge Discovery.

[17]  Suh-Yin Lee,et al.  Incremental updates of closed frequent itemsets over continuous data streams , 2009, Expert Syst. Appl..

[18]  Takashi Washio,et al.  State of the art of graph-based data mining , 2003, SKDD.

[19]  Ambuj K. Singh,et al.  GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[20]  Dino Ienco,et al.  Mining frequent subgraphs in multigraphs , 2018, Inf. Sci..

[21]  Jiawei Han,et al.  Mining closed relational graphs with connectivity constraints , 2005, 21st International Conference on Data Engineering (ICDE'05).

[22]  Yin-Fu Huang,et al.  Integrating frequent pattern clustering and branch-and-bound approaches for data partitioning , 2016, Inf. Sci..

[23]  José Francisco Martínez Trinidad,et al.  A new algorithm for approximate pattern mining in multi-graph collections , 2016, Knowl. Based Syst..

[24]  Xiaokui Xiao,et al.  Large-scale frequent subgraph mining in MapReduce , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[25]  Joost N. Kok,et al.  The Gaston Tool for Frequent Subgraph Mining , 2005, GraBaTs.

[26]  Wei Wang,et al.  Efficient mining of frequent subgraphs in the presence of isomorphism , 2003, Third IEEE International Conference on Data Mining.

[27]  Xuejun Liu,et al.  Mining frequent closed itemsets from a landmark window over online data streams , 2009, Comput. Math. Appl..

[28]  Rinkle Rani,et al.  Ap-FSM: A parallel algorithm for approximate frequent subgraph mining using Pregel , 2018, Expert Syst. Appl..

[29]  Vassilis Christophides,et al.  High-level change detection in RDF(S) KBs , 2013, TODS.

[30]  Pauray S. M. Tsai,et al.  Mining top-k frequent closed itemsets over data streams using the sliding window model , 2010, Expert Syst. Appl..

[31]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[32]  Takashi Washio,et al.  Complete Mining of Frequent Patterns from Graphs: Mining Graph Data , 2003, Machine Learning.

[33]  George Karypis,et al.  Finding Frequent Patterns in a Large Sparse Graph* , 2005, Data Mining and Knowledge Discovery.

[34]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[35]  Aarzoo Dhiman,et al.  Optimizing Frequent Subgraph Mining for Single Large Graph , 2016 .

[36]  Wei Jin,et al.  BR-Index: An Indexing Structure for Subgraph Matching in Very Large Dynamic Graphs , 2011, SSDBM.

[37]  Christian Borgelt,et al.  Subgraph Support in a Single Large Graph , 2007 .

[38]  Cheng-Te Li,et al.  Mining Temporal Subgraph Patterns in Heterogeneous Information Networks , 2010, 2010 IEEE Second International Conference on Social Computing.

[39]  Lotfi Ben Romdhane,et al.  Minimal contrast frequent pattern mining for malware detection , 2016, Comput. Secur..

[40]  Iqbal Gondal,et al.  Dependable large scale behavioral patterns mining from sensor data using Hadoop platform , 2017, Inf. Sci..

[41]  Panos Kalnis,et al.  GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph , 2014, Proc. VLDB Endow..

[42]  George Karypis,et al.  GREW - a scalable frequent subgraph discovery algorithm , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[43]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[44]  Hans-Peter Kriegel,et al.  Pattern Mining in Frequent Dynamic Subgraphs , 2006, Sixth International Conference on Data Mining (ICDM'06).