{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:30:21Z","timestamp":1767007821043,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T00:00:00Z","timestamp":1435276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Frequent graph pattern mining is one of the most interesting areas in data mining, and many researchers have developed a variety of approaches by suggesting efficient, useful mining techniques by integration of fundamental graph mining with other advanced mining works. However, previous graph mining approaches have faced fatal problems that cannot consider important characteristics in the real world because they cannot process both (1) different element importance and (2) multiple minimum support thresholds suitable for each graph element. In other words, graph elements in the real world have not only frequency factors but also their own importance; in addition, various elements composing graphs may require different thresholds according to their characteristics. However, traditional ones do not consider such features. To overcome these issues, we propose a new frequent graph pattern mining method, which can deal with both different element importance and multiple minimum support thresholds. Through the devised algorithm, we can obtain more meaningful graph pattern results with higher importance. We also demonstrate that the proposed algorithm has more outstanding performance compared to previous state-of-the-art approaches in terms of graph pattern generation, runtime, and memory usage.<\/jats:p>","DOI":"10.3390\/sym7031151","type":"journal-article","created":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T10:24:46Z","timestamp":1435314286000},"page":"1151-1163","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements"],"prefix":"10.3390","volume":"7","author":[{"given":"Gangin","family":"Lee","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Sejong University, 209 Neungdong-ro, Gwangjin-gu,  Seoul 143-747, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sejong University, 209 Neungdong-ro, Gwangjin-gu,  Seoul 143-747, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heungmo","family":"Ryang","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sejong University, 209 Neungdong-ro, Gwangjin-gu,  Seoul 143-747, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donggyu","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sejong University, 209 Neungdong-ro, Gwangjin-gu,  Seoul 143-747, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2015,6,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"395","DOI":"10.3745\/JIPS.2013.9.3.395","article-title":"Classifying Malicious Web Pages by Using an Adaptive Support Vector Machine","volume":"9","author":"Hwang","year":"2013","journal-title":"J. Inf. Process. Syst."},{"key":"ref_2","first-page":"29","article-title":"Mining Consumer Attitude and Behavior","volume":"4","author":"Ihm","year":"2013","journal-title":"J. Converg."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/2192-1962-3-3","article-title":"Artificial neuro fuzzy logic system for detecting human emotions","volume":"3","author":"Malkawi","year":"2013","journal-title":"Hum. Cent. Comput. Inf. Sci."},{"key":"ref_4","first-page":"15","article-title":"Texture Feature Extraction Techniques for Fault Diagnosis of Induction Motors","volume":"5","author":"Uddin","year":"2014","journal-title":"J. Converg."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3745\/JIPS.2013.9.1.001","article-title":"Dynamic knowledge mapping guided by data mining: Application on Healthcare","volume":"9","author":"Brahami","year":"2013","journal-title":"J. Inf. Process. Syst."},{"key":"ref_6","first-page":"36","article-title":"Weighted Mining Frequent Pattern based Customer\u2019s RFM Score for Personalized u-Commerce Recommendation System","volume":"4","author":"Cho","year":"2013","journal-title":"J. Converg."},{"doi-asserted-by":"crossref","unstructured":"Holzinger, A., and Jurisica, I. (2014). Interactive Knowledge Discovery and Data Mining in Biomedical Informatics, Springer. Lecture Notes in Computer Science, Lncs 8401.","key":"ref_7","DOI":"10.1007\/978-3-662-43968-5"},{"unstructured":"Preuss, M., Dehmer, M., Pickl, S., and Holzinger, A. (2014). Brain Informatics and Health, Springer.","key":"ref_8"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.knosys.2013.10.011","article-title":"Mining Maximal Frequent Patterns by Considering Weight Conditions over Data Streams","volume":"55","author":"Yun","year":"2014","journal-title":"Knowl. Based Syst."},{"unstructured":"Agrawal, R., and Srikant, R. (1994, January 12\u201315). Fast Algorithms for Mining Association Rules. Proceedings of the 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile.","key":"ref_10"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.knosys.2013.10.013","article-title":"Efficient frequent pattern mining based on Linear Prefix Tree","volume":"55","author":"Pyun","year":"2014","journal-title":"Knowl. Based Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/s10489-013-0506-9","article-title":"Mining top-k frequent patterns with combination reducing techniques","volume":"41","author":"Pyun","year":"2014","journal-title":"Appl. Intell."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.3233\/IDA-140683","article-title":"Discovering High Utility Itemsets with Multiple Minimum Supports","volume":"18","author":"Ryang","year":"2014","journal-title":"Intell. Data Anal."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13673-014-0013-y","article-title":"All capacities modular cost survivable network design problem using genetic algorithm with completely connection encoding","volume":"4","author":"Binh","year":"2014","journal-title":"Hum. Cent. Comput. Inf. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"602","DOI":"10.3745\/JIPS.03.0019","article-title":"Traffic Analysis of a Cognitive Radio Network Based on the Concept of Medium Access Probability","volume":"10","author":"Khan","year":"2014","journal-title":"J. Inf. Process. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13673-014-0014-x","article-title":"Detecting misinformation in online social networks using cognitive psychology","volume":"4","author":"Kumar","year":"2014","journal-title":"Hum. Cent. Comput. Inf. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dss.2004.09.007","article-title":"Mining association rules with multiple minimum supports: A new mining algorithm and a support tuning mechanism","volume":"42","author":"Hu","year":"2006","journal-title":"Decis. Support Syst."},{"unstructured":"Lee, G., and Yun, U. (2013, January 4\u20136). Frequent Graph Mining Based on Multiple Minimum Support Constraints. Proceedings of the 4th International Conference on Mobile, Ubiquitous, and Intelligent Computing, Gwangju, Korea.","key":"ref_19"},{"doi-asserted-by":"crossref","unstructured":"Nijssen, S., and Kok, J.N. (2004, January 22\u201325). A quickstart in frequent structure mining can make a difference. Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA, USA.","key":"ref_20","DOI":"10.1145\/1014052.1014134"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1847","DOI":"10.1016\/j.eswa.2013.08.082","article-title":"Mining frequent correlated graphs with a new measure","volume":"41","author":"Samiullah","year":"2014","journal-title":"Expert Syst. Appl."},{"doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., and Ma, Y. (1999, January 15\u201318). Mining association rules with multiple minimum supports. Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA.","key":"ref_22","DOI":"10.1145\/312129.312274"},{"doi-asserted-by":"crossref","unstructured":"Kiran, R.U., and Reddy, P.K. (2011, January 21\u201325). Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms. Proceedings of the 14th International Conference on Extending Database Technology, Uppsala, Sweden.","key":"ref_23","DOI":"10.1145\/1951365.1951370"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.eswa.2013.07.094","article-title":"Sliding Window based Weighted Maximal Frequent Pattern Mining over Data Streams","volume":"41","author":"Lee","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","article-title":"A new method for mining Frequent Weighted Itemsets based on WIT-trees","volume":"40","author":"Vo","year":"2013","journal-title":"Expert Syst. Appl."},{"doi-asserted-by":"crossref","unstructured":"Yun, U., Pyun, G., and Yoon, E. (2015). Efficient mining of robust closed weighted sequential patterns without information loss. Int. J. Artif. Intell. Tools.","key":"ref_26","DOI":"10.1142\/S0218213015500074"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1016\/j.eswa.2014.08.037","article-title":"A Fast Perturbation Algorithm using Tree Structure for Privacy Preserving Utility Mining","volume":"42","author":"Yun","year":"2014","journal-title":"Expert Syst. Appl."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/7\/3\/1151\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:48:26Z","timestamp":1760215706000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/7\/3\/1151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,26]]},"references-count":27,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2015,9]]}},"alternative-id":["sym7031151"],"URL":"https:\/\/doi.org\/10.3390\/sym7031151","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2015,6,26]]}}}