{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:24:48Z","timestamp":1777695888572,"version":"3.51.4"},"reference-count":45,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2020,5,21]]},"DOI":"10.3233\/ida-194601","type":"journal-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T11:12:03Z","timestamp":1590491523000},"page":"495-513","source":"Crossref","is-referenced-by-count":6,"title":["Distributed frequent subgraph mining on evolving graph using SPARK"],"prefix":"10.1177","volume":"24","author":[{"given":"N.","family":"Senthilselvan","sequence":"first","affiliation":[{"name":"School of Computing, SASTRA Deemed University, Thanjavur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Subramaniyaswamy","sequence":"additional","affiliation":[{"name":"School of Computing, SASTRA Deemed University, Thanjavur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Vijayakumar","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, University of New South Wales, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid Reza","family":"Karimi","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, Politecnico di Milano, Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Aswin","sequence":"additional","affiliation":[{"name":"School of Computing, SASTRA Deemed University, Thanjavur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Logesh","family":"Ravi","sequence":"additional","affiliation":[{"name":"Sri Ramachandra Faculty of Engineering and Technology, Sri Ramachandra Institute of Higher Education and Research, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"12","key":"10.3233\/IDA-194601_ref1","doi-asserted-by":"crossref","first-page":"2710","DOI":"10.1109\/TKDE.2017.2743075","article-title":"Incremental frequent subgraph mining on large evolving graphs","volume":"29","author":"Abdelhamid","year":"2017","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-194601_ref2","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.knosys.2016.07.003","article-title":"A new algorithm for approximate pattern mining in multi-graph collections","volume":"109","author":"Acosta-Mendoza","year":"2016","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-194601_ref3","unstructured":"A. Rakesh and R. Srikant, Fast algorithms for mining association rules, in: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, 1994."},{"key":"10.3233\/IDA-194601_ref4","unstructured":"B. Nisha and A. John, A distributed approach to weighted frequent Subgraph mining, Emerging Technological Trends (ICETT), in: International Conference on IEEE, 2016."},{"key":"10.3233\/IDA-194601_ref5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.eswa.2018.04.010","article-title":"Ap-FSM: A parallel algorithm for approximate frequent subgraph mining using Pregel","volume":"106","author":"Bhatia","year":"2018","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"10.3233\/IDA-194601_ref6","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/TKDE.2014.2345408","article-title":"An iterative MapReduce based frequent subgraph mining algorithm","volume":"27","author":"Bhuiyan","year":"2015","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-194601_ref8","doi-asserted-by":"crossref","unstructured":"M. Borgwardt Karsten, H.P. Kriegel and P. Wackersreuther, Pattern mining in frequent dynamic subgraphs, in: Data Mining ICDM\u201906 Sixth International Conference on IEEE, 2006.","DOI":"10.1109\/ICDM.2006.124"},{"key":"10.3233\/IDA-194601_ref9","unstructured":"B. Bj\u00f6rn and S. Nijssen, What is frequent in a single graph? in: Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer, Berlin, Heidelberg, 2008."},{"key":"10.3233\/IDA-194601_ref10","unstructured":"Y. Chi, H. Wang, P.S. Yu and R.R. Muntz, Moment: Maintaining closed frequent itemsets over a stream sliding window, in: Data Mining ICDM\u201904 Fourth IEEE International Conference, 2004, pp. 59\u201366."},{"issue":"1","key":"10.3233\/IDA-194601_ref11","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/TITB.2009.2028234","article-title":"Predicting protein function by frequent functional association pattern mining in protein interaction networks","volume":"14","author":"Rae","year":"2010","journal-title":"IEEE Transactions on Information Technology in Biomedicine"},{"key":"10.3233\/IDA-194601_ref12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.is.2017.05.006","article-title":"MR-SimLab: Scalable subgraph selection with label similarity for big data","volume":"69","author":"Dhifli","year":"2017","journal-title":"Information Systems"},{"key":"10.3233\/IDA-194601_ref13","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.procs.2016.06.085","article-title":"Optimizing frequent subgraph mining for single large graph","volume":"89","author":"Aarzoo","year":"2016","journal-title":"Procedia Computer Science"},{"issue":"7","key":"10.3233\/IDA-194601_ref15","doi-asserted-by":"crossref","first-page":"517","DOI":"10.14778\/2732286.2732289","article-title":"Grami: Frequent subgraph and pattern mining in a single large graph","volume":"7","author":"Elseidy","year":"2014","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"10.3233\/IDA-194601_ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2489791","article-title":"Incremental graph pattern matching","volume":"38","author":"Wenfei","year":"2013","journal-title":"ACM Transactions on Database Systems"},{"key":"10.3233\/IDA-194601_ref17","unstructured":"F. Mathias and C. Borgelt, Subgraph support in a single large graph,in: Data Mining Workshops, Seventh IEEE International Conference, 2007."},{"key":"10.3233\/IDA-194601_ref18","first-page":"191","article-title":"Mining frequent patterns in data streams at multiple time granularities","volume":"212","author":"Chris","year":"2003","journal-title":"Next Generation Data Mining"},{"key":"10.3233\/IDA-194601_ref19","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.eswa.2016.10.033","article-title":"Supergraph based periodic pattern mining in dynamic social networks","volume":"72","author":"Halder","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-194601_ref20","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.cose.2016.06.004","article-title":"Minimal contrast frequent pattern mining for malware detection","volume":"62","author":"Hellal","year":"2016","journal-title":"Computers and Security"},{"key":"10.3233\/IDA-194601_ref21","unstructured":"H. Hsun-Ping and C. Li, Mining temporal subgraph patterns in heterogeneous information networks, in: Social Computing IEEE Second International Conference, 2010."},{"key":"10.3233\/IDA-194601_ref25","unstructured":"H. Jun et al., Spin: mining maximal frequent subgraphs from graph databases, in: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004."},{"key":"10.3233\/IDA-194601_ref26","unstructured":"H. Jun, W. Wang and J. Prins, Efficient mining of frequent subgraphs in the presence of isomorphism, in: Data Mining Third IEEE International Conference, 2003."},{"key":"10.3233\/IDA-194601_ref27","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.ins.2015.08.047","article-title":"Integrating frequent pattern clustering and branch-and-bound approaches for data partitioning","volume":"328","author":"Huang","year":"2016","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-194601_ref28","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.ins.2018.04.001","article-title":"Mining frequent subgraphs in multigraphs","volume":"451","author":"Ingalalli","year":"2018","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-194601_ref29","unstructured":"I. Akihiro, T. Washio and H. Motoda, An apriori-based algorithm for mining frequent substructures from graph data, in: European Conference on Principles of Data Mining and Knowledge Discovery, 2000."},{"issue":"3","key":"10.3233\/IDA-194601_ref30","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1021726221443","article-title":"Complete mining of frequent patterns from graphs: Mining graph data","volume":"50","author":"Akihiro","year":"2003","journal-title":"Machine Learning"},{"issue":"3","key":"10.3233\/IDA-194601_ref31","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","article-title":"Finding frequent patterns in a large sparse graph","volume":"11","author":"Michihiro","year":"2005","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-194601_ref32","unstructured":"K. Michihiro and G. Karypis, Frequent subgraph discovery, in: Data Mining Proceedings IEEE International Conference, 2001."},{"key":"10.3233\/IDA-194601_ref33","unstructured":"K. Michihiro and G. Karypis, Grew \u2013 A scalable frequent subgraph discovery algorithm, in: Data Mining Fourth IEEE International Conference, 2004."},{"issue":"2","key":"10.3233\/IDA-194601_ref34","doi-asserted-by":"crossref","first-page":"2451","DOI":"10.1016\/j.eswa.2007.12.054","article-title":"Incremental updates of closed frequent itemsets over continuous data streams","volume":"36","author":"Hua-Fu","year":"2009","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-194601_ref35","doi-asserted-by":"crossref","unstructured":"W. Lin, X. Xiao and G. Ghinita, Large-scale frequent subgraph mining in MapReduce, in: IEEE 30th International Conference on Data Engineering, 2014, pp. 844\u2013855.","DOI":"10.1109\/ICDE.2014.6816705"},{"issue":"6","key":"10.3233\/IDA-194601_ref36","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.camwa.2008.10.060","article-title":"Mining frequent closed itemsets from a landmark window over online data streams","volume":"57","author":"Xuejun","year":"2009","journal-title":"Computers and Mathematics with Applications"},{"key":"10.3233\/IDA-194601_ref37","unstructured":"N. Siegfried and N. Joost Kok, A quickstart in frequent structure mining can make a difference, in: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ACM, 2004."},{"issue":"1","key":"10.3233\/IDA-194601_ref38","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","article-title":"The gaston tool for frequent subgraph mining","volume":"127","author":"Siegfried","year":"2005","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.3233\/IDA-194601_ref40","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.procs.2015.03.198","article-title":"Frequent subgraph mining algorithms \u2013 A Survey","volume":"47","author":"Ramraj","year":"2015","journal-title":"Procedia Computer Science"},{"key":"10.3233\/IDA-194601_ref41","unstructured":"R. Sayan and A. Singh, Graphsig: A scalable approach to mining significant subgraphs in large graph databases, in: Data Engineering IEEE 25th International Conference, 2009."},{"key":"10.3233\/IDA-194601_ref42","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ins.2016.06.036","article-title":"Dependable large scale behavioral patterns mining from sensor data using Hadoop platform","volume":"379","author":"Rashid","year":"2017","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-194601_ref43","unstructured":"S. Madeleine et al., Online structural graph clustering using frequent subgraph mining, in: Joint European Conference on Machine Learning and Knowledge Discovery in Databases Springer, Berlin, Heidelberg, 2010."},{"issue":"5","key":"10.3233\/IDA-194601_ref44","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1007\/s10618-016-0466-x","article-title":"A distributed approach for graph mining in massive networks","volume":"30","author":"Nilothpal","year":"2016","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-194601_ref46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.datak.2017.08.004","article-title":"Frequent patterns in ETL workflows: An empirical approach","volume":"112","author":"Theodorou","year":"2017","journal-title":"Data & Knowledge Engineering"},{"issue":"10","key":"10.3233\/IDA-194601_ref47","doi-asserted-by":"crossref","first-page":"6968","DOI":"10.1016\/j.eswa.2010.03.023","article-title":"Mining top-k frequent closed itemsets over data streams using the sliding window model","volume":"37","author":"Tsai Pauray","year":"2010","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.3233\/IDA-194601_ref48","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/959242.959249","article-title":"State of the art of graph-based data mining","volume":"5","author":"Takashi","year":"2003","journal-title":"Acm Sigkdd Explorations Newsletter"},{"key":"10.3233\/IDA-194601_ref49","unstructured":"Y. Xifeng and J. Han, CloseGraph: mining closed frequent graph patterns, in: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2003."},{"key":"10.3233\/IDA-194601_ref50","unstructured":"Y. Xifeng and J. Han, gspan: Graph-based substructure pattern mining, in: Proceedings IEEE International Conference, 2002."},{"key":"10.3233\/IDA-194601_ref51","unstructured":"Y. Xifeng, X. Zhou and J. Han, Mining closed relational graphs with connectivity constraints, in: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining ACM, 2005."},{"key":"10.3233\/IDA-194601_ref52","unstructured":"Y. Jiong and W. Jin, Br-index: An indexing structure for subgraph matching in very large dynamic graphs, in: International Conference on Scientific and Statistical Database Management, Springer, Berlin, Heidelberg, 2011."}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-194601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:43Z","timestamp":1777454323000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-194601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,21]]},"references-count":45,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/ida-194601","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,21]]}}}