{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:51:39Z","timestamp":1778824299311,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T00:00:00Z","timestamp":1506297600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF)","doi-asserted-by":"crossref","award":["NRF No. 20152062051 and NRF No. 20155054624"],"award-info":[{"award-number":["NRF No. 20152062051 and NRF No. 20155054624"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00500-017-2820-3","type":"journal-article","created":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T10:54:33Z","timestamp":1506336873000},"page":"4267-4273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Performance and characteristic analysis of maximal frequent pattern mining methods using additional factors"],"prefix":"10.1007","volume":"22","author":[{"given":"Gangin","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,25]]},"reference":[{"key":"2820_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: 20th international conference on very large data bases, pp 487\u2013499"},{"issue":"1","key":"2820_CR2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.14400\/JDC.2015.13.7.9","volume":"6","author":"Y Cho","year":"2015","unstructured":"Cho Y, Moon S (2015) Recommender system using periodicity analysis via mining sequential patterns with time-series and FRAT analysis. J Converg 6(1):9\u201317","journal-title":"J Converg"},{"issue":"32","key":"2820_CR3","first-page":"32:1","volume":"5","author":"M Gaur","year":"2015","unstructured":"Gaur M, Pant B (2015) Trusted and secure clustering in mobile pervasive environment. Human-centric Comput Inf Sci 5(32):32:1\u201332:17","journal-title":"Human-centric Comput Inf Sci"},{"issue":"1","key":"2820_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s13721-015-0101-6","volume":"4","author":"A Goparaju","year":"2015","unstructured":"Goparaju A, Brazier T, Salem S (2015) Mining representative maximal dense cohesive subnetworks. Netw Model Anal Health Inform Bioinform 4(1):29","journal-title":"Netw Model Anal Health Inform Bioinform"},{"issue":"10","key":"2820_CR5","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu Z (2005) Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans Knowl Data Eng 17(10):1347\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"2820_CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"issue":"10","key":"2820_CR7","first-page":"10:1","volume":"6","author":"S Jeeva","year":"2016","unstructured":"Jeeva S, Rajsingh E (2016) Intelligent phishing url detection using association rule mining. Human-centric Comput Inf Sci 6(10):10:1\u201310:19","journal-title":"Human-centric Comput Inf Sci"},{"key":"2820_CR8","doi-asserted-by":"crossref","unstructured":"Karim M, Rashid M, Jeong B, Choi H (2012) Privacy preserving mining maximal frequent patterns in transactional databases. In: 17th international conference on database systems for advanced applications, pp 303\u2013319","DOI":"10.1007\/978-3-642-29038-1_23"},{"issue":"6","key":"2820_CR9","first-page":"1650012:1","volume":"30","author":"G Lee","year":"2016","unstructured":"Lee G, Yun U, Ryang H, Kim D (2016) Approximate maximal frequent pattern mining with weight conditions and error tolerance. Int J Pattern Recognit Artif Intell 30(6):1650012:1\u20131650012:42","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"2820_CR10","doi-asserted-by":"crossref","unstructured":"Li H, Zhang N (2016) Probabilistic maximal frequent itemset mining over uncertain databases. In: 21st international conference on database systems for advanced applications, pp 149\u2013163","DOI":"10.1007\/978-3-319-32025-0_10"},{"issue":"2\/3","key":"2820_CR11","first-page":"201","volume":"14","author":"H Necir","year":"2015","unstructured":"Necir H, Drias H (2015) A distributed maximal frequent itemset mining with multi agents system on bitmap join indexes selection. Int J Inf Technol Manag 14(2\/3):201\u2013214","journal-title":"Int J Inf Technol Manag"},{"issue":"1","key":"2820_CR12","first-page":"13","volume":"8","author":"S Nikam","year":"2015","unstructured":"Nikam S (2015) A comparative study of classification techniques in data mining algorithms. Orient J Comput Sci Technol 8(1):13\u201319","journal-title":"Orient J Comput Sci Technol"},{"key":"2820_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.tcs.2016.01.020","volume":"618","author":"L Nourine","year":"2016","unstructured":"Nourine L, Petit J (2016) Extended dualization: application to maximal pattern mining. Theor Comput Sci 618:107\u2013121","journal-title":"Theor Comput Sci"},{"key":"2820_CR14","doi-asserted-by":"crossref","unstructured":"Salem S, Ozcaglar C (2013) MFMS: maximal frequent module set mining from multiple human gene expression data sets. in: 12th international workshop on data mining in bioinformatics, pp 51\u201357","DOI":"10.1145\/2500863.2500869"},{"issue":"2","key":"2820_CR15","first-page":"10","volume":"6","author":"G Sanna","year":"2015","unstructured":"Sanna G, Angius A, Concas G, Manca D, Eros F (2015) PCE: a knowledge base of semantically disambiguated contents. J Converg 6(2):10\u201318","journal-title":"J Converg"},{"issue":"23","key":"2820_CR16","first-page":"23:1","volume":"5","author":"A Sato","year":"2015","unstructured":"Sato A, Huang R, Yen N (2015) Design of fusion technique-based mining engine for smart business. Human-centric Comput Inf Sci 5(23):23:1\u201323:16","journal-title":"Human-centric Comput Inf Sci"},{"key":"2820_CR17","doi-asserted-by":"crossref","unstructured":"Stattner E, Collard M (2012) MAX-FLMin: an approach for mining maximal frequent links and generating semantical structures from social networks. In: 23rd international conference on database and expert systems applications, pp 468\u2013483","DOI":"10.1007\/978-3-642-32600-4_35"},{"issue":"8","key":"2820_CR18","doi-asserted-by":"crossref","first-page":"2005","DOI":"10.1007\/s00500-015-1899-7","volume":"21","author":"F Wang","year":"2017","unstructured":"Wang F, Hu L, Zhou J, Hu J, Zhao K (2017) A semantics-based approach to multi-source heterogeneous information fusion in the internet of things. Soft Comput 21(8):2005\u20132013","journal-title":"Soft Comput"},{"key":"2820_CR19","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.eswa.2016.01.049","volume":"54","author":"U Yun","year":"2016","unstructured":"Yun U, Lee G (2016) Incremental mining of weighted maximal frequent itemsets from dynamic databases. Expert Syst Appl 54:304\u2013327","journal-title":"Expert Syst Appl"},{"issue":"5","key":"2820_CR20","doi-asserted-by":"crossref","first-page":"917","DOI":"10.3233\/IDA-130612","volume":"17","author":"U Yun","year":"2013","unstructured":"Yun U, Ryu K (2013) Efficient mining of maximal correlated weight frequent patterns. Intell Data Anal 17(5):917\u2013939","journal-title":"Intell Data Anal"},{"key":"2820_CR21","doi-asserted-by":"crossref","unstructured":"Yun U, Lee G, Lee K (2016) Efficient representative pattern mining based on weight and maximality conditions. Expert Syst 33(5):439\u2013462","DOI":"10.1111\/exsy.12158"},{"key":"2820_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00500-016-2270-3","volume":"1","author":"D Zhang","year":"2016","unstructured":"Zhang D, Niu H, Liu S (2016) Novel PEECR-based clustering routing approach. Soft Comput 1:1\u201311. doi: 10.1007\/s00500-016-2270-3","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2820-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2820-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2820-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T19:11:43Z","timestamp":1570129903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2820-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,25]]},"references-count":22,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["2820"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2820-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,25]]}}}