{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T03:29:36Z","timestamp":1776914976662,"version":"3.51.2"},"reference-count":42,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2018,11,18]],"date-time":"2018-11-18T00:00:00Z","timestamp":1542499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>As graph stream data are continuously generated in Internet of Things (IoT) environments, many studies on the detection and analysis of changes in graphs have been conducted. In this paper, we propose a method that incrementally detects frequent subgraph patterns by using frequent subgraph pattern information generated in previous sliding window. To reduce the computation cost for subgraph patterns that occur consecutively in a graph stream, the proposed method determines whether subgraph patterns occur within a sliding window. In addition, subgraph patterns that are more meaningful can be detected by recognizing only the patterns that are connected to each other via edges as one pattern. In order to prove the superiority of the proposed method, various performance evaluations were conducted.<\/jats:p>","DOI":"10.3390\/s18114020","type":"journal-article","created":{"date-parts":[[2018,11,22]],"date-time":"2018-11-22T09:18:25Z","timestamp":1542878305000},"page":"4020","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Detecting Incremental Frequent Subgraph Patterns in IoT Environments"],"prefix":"10.3390","volume":"18","author":[{"given":"Kyoungsoo","family":"Bok","sequence":"first","affiliation":[{"name":"Department of Information and Communication Engineering, Chungbuk National University, Chungdae-ro 1, Seowon-Gu, Cheongju, Chungbuk 28644, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaeyun","family":"Jeong","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Engineering, Chungbuk National University, Chungdae-ro 1, Seowon-Gu, Cheongju, Chungbuk 28644, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dojin","family":"Choi","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Engineering, Chungbuk National University, Chungdae-ro 1, Seowon-Gu, Cheongju, Chungbuk 28644, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9926-9947","authenticated-orcid":false,"given":"Jaesoo","family":"Yoo","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Engineering, Chungbuk National University, Chungdae-ro 1, Seowon-Gu, Cheongju, Chungbuk 28644, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,11,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s11704-015-4515-1","article-title":"Big graph search: challenges and techniques","volume":"10","author":"Ma","year":"2016","journal-title":"Frontiers Comput. Sci."},{"key":"ref_2","first-page":"1","article-title":"Incremental graph pattern matching algorithm for big graph data","volume":"2018","author":"Zhang","year":"2018","journal-title":"Sci. Program."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10619-014-7140-3","article-title":"The G graph database: efficiently managing large distributed dynamic graphs","volume":"33","author":"Labouseur","year":"2015","journal-title":"Distrib. Parallel Databases"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/1900000056","article-title":"Big graph analytics platforms","volume":"7","author":"Yan","year":"2017","journal-title":"Found. Trends Databases"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Jiang, F., and Leung, C.K. (2014, January 2\u20134). Mining interesting \u201cfollowing\u201d patterns from social networks. Proceedings of the International Conference on Data Warehousing and Knowledge Discovery, Munich, Germany.","DOI":"10.1007\/978-3-319-10160-6_28"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","article-title":"SAGA: a subgraph matching tool for biological graphs","volume":"23","author":"Tian","year":"2017","journal-title":"Bioinformatics"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Fariha, A., Ahmed, C.F., Leung, C.K., Abdullah, S.M., and Cao, L. (2013, January 14\u201317). Mining frequent patterns from human interactions in meetings using directed acyclic graphs. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, Gold Coast, Australia.","DOI":"10.1007\/978-3-642-37453-1_4"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Li, P., Heo, L., Li, M., Ryu, K.H., and Pok, G. (2011, January 26\u201328). Protein function prediction using frequent patterns in protein-protein interaction networks. Proceedings of the International Conference on Fuzzy Systems and Knowledge Discovery, Shanghai, China.","DOI":"10.1109\/FSKD.2011.6019850"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Peng, J., Yang, L., Wang, J., Liu, Z., and Li, M. (2008, January 28\u201330). An efficient algorithm for detecting closed frequent subgraphs in biological networks. Proceedings of the International Conference on BioMedical Engineering and Informatics, Sanya, China.","DOI":"10.1109\/BMEI.2008.187"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13040-018-0181-9","article-title":"Grasping frequent subgraph mining for bioinformatics applications","volume":"11","author":"Mrzic","year":"2018","journal-title":"BioData Mining"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Namaki, M.H., Lin, P., and Wu, Y. (2017, January 11\u201314). Event pattern discovery by keywords in graph streams. Proceedings of the International Conference on Big Data, Boston, MA, USA.","DOI":"10.1109\/BigData.2017.8258019"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Manzoor, E.A., Milajerdi, S.M., and Akoglu, L. (2016, January 13\u201317). Fast memory-efficient anomaly detection in streaming heterogeneous graphs. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939783"},{"key":"ref_13","unstructured":"Choudhury, S., Holder, L.B., Chin, G., Agarwal, K., and Feo, J. (2015, January 23\u201327). A Selectivity based approach to continuous pattern detection in streaming graphs. Proceedings of the International Conference on Extending Database Technology, Brussels, Belgium."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Vlassopoulos, C., Kontopoulos, I., Apostolou, M., Artikis, A., and Vogiatzis, D. (2016, January 20\u201324). Dynamic graph management for streaming social media analytics. Proceedings of the ACM International Conference on Distributed and Event-based Systems, Irvine, CA, USA.","DOI":"10.1145\/2933267.2933515"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Edouard, A., Cabrio, E., Tonelli, S., and Thanh, N.L. (2017, January 2\u20138). Graph-based event extraction from twitter. Proceedings of the International Conference Recent Advances in Natural Language Processing, Varna, Bulgaria.","DOI":"10.26615\/978-954-452-049-6_031"},{"key":"ref_16","unstructured":"Eberle, W., and Holder, L. (2016, January 14). Identifying anomalies in graph streams using change detection. Proceedings of the KDD Workshop on Mining and Learning in Graphs, San Francisco, CA, USA."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/2627692.2627694","article-title":"Graph stream algorithms: A survey","volume":"43","author":"McGregor","year":"2014","journal-title":"SIGMOD Record"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.jpdc.2016.02.003","article-title":"Modeling, analysis, and experimental comparison of streaming graph-partitioning policies","volume":"108","author":"Guo","year":"2017","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.bdr.2017.05.003","article-title":"BLADYG: A graph processing framework for large dynamic graphs","volume":"9","author":"Aridhi","year":"2017","journal-title":"Big Data Res."},{"key":"ref_20","first-page":"975","article-title":"On dense pattern mining in graph streams","volume":"3","author":"Aggarwal","year":"2010","journal-title":"PVLDB"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Kim, K., Seo, I., Han, W., Lee, J., Hong, S., Chafi, H., Shin, H., and Jeong, G. (2018, January 10\u201315). TurboFlux: A fast continuous subgraph matching system for streaming graph data. Proceedings of the ACM SIGMOD International Conference on Management of Data, Houston, TX, USA.","DOI":"10.1145\/3183713.3196917"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Riedy, J. (2018, January 8\u201310). Streaming graph analysis: new models, new architectures. Proceedings of the ACM International Conference on Computing Frontiers, Ischia, Italy.","DOI":"10.1145\/3203217.3205343"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Yang, M., Rashidi, L., Rajasegarar, S., and Leckie, C. (2018, January 28\u201331). Graph stream mining based anomalous event analysis. Proceedings of the Pacific Rim International Conference on Artificial Intelligence, Nanjing, China.","DOI":"10.1007\/978-3-319-97304-3_68"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.asoc.2016.05.028","article-title":"Graph clustering using k-Neighbourhood Attribute Structural similarity","volume":"47","author":"Boobalan","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_25","unstructured":"Gao, J., Zhou, C., Zhou, J., and Yu, J.X. (April, January 31). Continuous pattern detection over billion-edge graph using distributed framework. Proceedings of the International Conference on Data Engineering, Chicago, IL, USA."},{"key":"ref_26","first-page":"788","article-title":"Efficient subgraph matching on billion node graphs","volume":"5","author":"Sun","year":"2012","journal-title":"PVLDB"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Valari, E., Kontaki, M., and Papadopoulos, A.N. (2012, January 25\u201327). Discovery of top-k dense subgraphs in dynamic graph collections. Proceedings of the International Conference on Scientific and Statistical Database Management, Chania, Crete, Greece.","DOI":"10.1007\/978-3-642-31235-9_14"},{"key":"ref_28","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 Trans. Knowl. Data Eng."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.procs.2015.03.198","article-title":"Frequent Subgraph Mining Algorithms\u2014A Survey","volume":"47","author":"Ramraja","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Leung, C.K., and Khan, Q.I. (2006, January 18\u201322). DSTree: A tree structure for the mining of frequent sets from data streams. Proceedings of the International Conference on Data Mining, Hong Kong, China.","DOI":"10.1109\/ICDM.2006.62"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Braun, P., Cameron, J.J., Cuzzocrea, A., Jiang, F., and Leung, C.K. (2014, January 15\u201317). Effectively and efficiently mining frequent patterns from dense graph streams on disk. Proceedings of the International Conference in Knowledge Based and Intelligent Information and Engineering Systems, Gdynia, Poland.","DOI":"10.1016\/j.procs.2014.08.114"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Cuzzocrea, A., Han, Z., Jiang, F., Leung, C.K., and Zhang, H. (2015, January 7\u20139). Edge-based mining of frequent subgraphs from graph streams. Proceedings of the International Conference in Knowledge Based and Intelligent Information and Engineering Systems, Singapore.","DOI":"10.1016\/j.procs.2015.08.184"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.future.2018.05.085","article-title":"Mining of productive periodic-frequent patterns for IoT data analytics","volume":"88","author":"Ismail","year":"2018","journal-title":"Future Gener. Comp. Syst."},{"key":"ref_34","first-page":"1","article-title":"Data mining for the internet of things: Literature review and challenges","volume":"11","author":"Chen","year":"2015","journal-title":"IJDSN"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/SURV.2013.103013.00206","article-title":"Data mining for internet of things: A survey","volume":"16","author":"Tsai","year":"2014","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_36","first-page":"517","article-title":"GRAMI: Frequent subgraph and pattern mining in a single large graph","volume":"7","author":"Elseidy","year":"2014","journal-title":"PVLDB"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1080\/10919392.2014.896715","article-title":"Interactive mining of strong friends from social networks and its applications in E-commerce","volume":"24","author":"Tanbeer","year":"2014","journal-title":"J. Org. Comput. E. Commerce."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Bifet, A., Holmes, G., Pfahringer, B., and Gavald\u00e0, R. (2011, January 21\u201324). Mining frequent closed graphs on evolving data streams. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA.","DOI":"10.1145\/2020408.2020501"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Shivraj, V.L., Rajan, M.A., and Balamuralidhar, P. (2017, January 17\u201320). A graph theory based generic risk assessment framework for internet of things (IoT). Proceedings of the International Conference on Advanced Networks and Telecommunications Systems, Bhubaneswar, India.","DOI":"10.1109\/ANTS.2017.8384121"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Almuammar, M., and Fasli, M. (2017, January 23\u201325). Pattern discovery from dynamic data streams using frequent pattern mining with multi-support thresholds. Proceedings of the International Conference on the Frontiers and Advances in Data Science, Xi\u2019an, China.","DOI":"10.1109\/FADS.2017.8253190"},{"key":"ref_41","unstructured":"(2018, July 20). Center for Applied Internet Data Analysis. Available online: http:\/\/www.caida.org."},{"key":"ref_42","unstructured":"(2018, July 20). Stanford Large Network Dataset Collection. Available online: https:\/\/snap.stanford.edu\/data\/."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/11\/4020\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:30:29Z","timestamp":1760196629000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/11\/4020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,18]]},"references-count":42,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2018,11]]}},"alternative-id":["s18114020"],"URL":"https:\/\/doi.org\/10.3390\/s18114020","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,18]]}}}