{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T06:03:55Z","timestamp":1780553035135,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811030222","type":"print"},{"value":"9789811030239","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,11,23]],"date-time":"2016-11-23T00:00:00Z","timestamp":1479859200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-3023-9_135","type":"book-chapter","created":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T20:27:38Z","timestamp":1570652858000},"page":"873-877","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Analysis of Recent Maximal Frequent Pattern Mining Approaches"],"prefix":"10.1007","author":[{"given":"Gangin","family":"Lee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,11,23]]},"reference":[{"key":"135_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: 20th International Conference on Very Large Data Bases, pp. 487\u2013499 (1994)"},{"issue":"1","key":"135_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s13721-015-0101-6","volume":"4","author":"A Goparaju","year":"2015","unstructured":"Goparaju, A., Brazier, T., Salem, S.: Mining representative maximal dense cohesive subnetworks. Netw. Model. Anal. Health Inf. Bioinform. 4(1), 29 (2015)","journal-title":"Netw. Model. Anal. Health Inf. Bioinform."},{"issue":"1","key":"135_CR3","doi-asserted-by":"publisher","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.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining Knowl. Discov. 8(1), 53\u201387 (2004)","journal-title":"Data Mining Knowl. Discov."},{"issue":"6","key":"135_CR4","doi-asserted-by":"publisher","first-page":"1650012:1","DOI":"10.1142\/S0218001416500129","volume":"30","author":"G Lee","year":"2016","unstructured":"Lee, G., Yun, U., Ryang, H., Kim, D.: Approximate maximal frequent pattern mining with weight conditions and error tolerance. Int. J. Pattern Recogn. Artif. Intell. 30(6), 1650012:1\u20131650012:42 (2016)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"135_CR5","doi-asserted-by":"crossref","unstructured":"Li, H., Zhang, N.: Probabilistic maximal frequent itemset mining over uncertain databases. In: 21st International Conference on Database Systems for Advanced Applications, pp. 149\u2013163 (2016)","DOI":"10.1007\/978-3-319-32025-0_10"},{"key":"135_CR6","doi-asserted-by":"crossref","unstructured":"Karim, M., Rashid, M., Jeong, B., Choi, H.: Privacy preserving mining maximal frequent patterns in transactional databases. In: 17th International Conference on Database Systems for Advanced Applications, pp. 303\u2013319 (2012)","DOI":"10.1007\/978-3-642-29038-1_23"},{"issue":"2\/3","key":"135_CR7","first-page":"201","volume":"14","author":"H Necir","year":"2015","unstructured":"Necir, H., Drias, H.: A distributed maximal frequent itemset mining with multi agents system on bitmap join indexes selection. Int. J. Inf. Technol. Manage. 14(2\/3), 201\u2013214 (2015)","journal-title":"Int. J. Inf. Technol. Manage."},{"key":"135_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.tcs.2016.01.020","volume":"618","author":"L Nourine","year":"2016","unstructured":"Nourine, L., Petit, J.: Extended dualization: application to maximal pattern mining. Theor. Comput. Sci. 618, 107\u2013121 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"135_CR9","doi-asserted-by":"crossref","unstructured":"Salem, S., Ozcaglar, C.: 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 (2013)","DOI":"10.1145\/2500863.2500869"},{"key":"135_CR10","doi-asserted-by":"crossref","unstructured":"Stattner, E., Collard, M.: 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 (2012)","DOI":"10.1007\/978-3-642-32600-4_35"},{"key":"135_CR11","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.eswa.2016.01.049","volume":"54","author":"U Yun","year":"2016","unstructured":"Yun, U., Lee, G.: Incremental mining of weighted maximal frequent itemsets from dynamic databases. Expert Syst. Appl. 54, 304\u2013327 (2016)","journal-title":"Expert Syst. Appl."},{"key":"135_CR12","doi-asserted-by":"crossref","unstructured":"Yun, U., Lee, G., Lee, K.: Efficient representative pattern mining based on weight and maximality conditions. Expert Syst. (2016). (in press)","DOI":"10.1111\/exsy.12158"}],"container-title":["Lecture Notes in Electrical Engineering","Advances in Computer Science and Ubiquitous Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3023-9_135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T20:37:36Z","timestamp":1570653456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3023-9_135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,23]]},"ISBN":["9789811030222","9789811030239"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3023-9_135","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"value":"1876-1100","type":"print"},{"value":"1876-1119","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,23]]},"assertion":[{"value":"23 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Science and its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csa2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/csa-conference.org\/2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}