{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:41:09Z","timestamp":1778272869764,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T00:00:00Z","timestamp":1390348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10489-013-0506-9","type":"journal-article","created":{"date-parts":[[2014,1,21]],"date-time":"2014-01-21T06:34:53Z","timestamp":1390286093000},"page":"76-98","source":"Crossref","is-referenced-by-count":46,"title":["Mining top-k frequent patterns with combination reducing techniques"],"prefix":"10.1007","volume":"41","author":[{"given":"Gwangbum","family":"Pyun","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":[[2014,1,22]]},"reference":[{"key":"506_CR1","first-page":"29","volume-title":"Knowledge discovery and data mining (KDD)","author":"CC Aggarwal","year":"2009","unstructured":"Aggarwal CC, Li Y, Wang J, Wang J (2009) Frequent pattern mining with uncertain data. In: Knowledge discovery and data mining (KDD), Jun 2009, pp 29\u201338"},{"key":"506_CR2","first-page":"487","volume-title":"Proc 20th int\u2019l conf very large databases (VLDB)","author":"R Agrawal","year":"1994","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proc 20th int\u2019l conf very large databases (VLDB), pp 487\u2013499"},{"issue":"2","key":"506_CR3","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1016\/j.eswa.2011.08.055","volume":"39","author":"K Amphawan","year":"2012","unstructured":"Amphawan K, Lenca P, Surarerks A (2012) Mining top-k regular-frequent itemset using database partitioning and support estimation. Expert Syst Appl 39(2):1924\u20131936","journal-title":"Expert Syst Appl"},{"key":"506_CR4","first-page":"83","volume-title":"International conference on data mining (ICDM)","author":"L Chang","year":"2008","unstructured":"Chang L, Wang T, Yang D, Luan H (2008) SeqStream: mining closed sequential patterns over stream sliding windows. In: International conference on data mining (ICDM), Dec 2008, pp 83\u201392"},{"key":"506_CR5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.datak.2008.08.003","volume":"68","author":"L Chang","year":"2009","unstructured":"Chang L, Wang T, Yang D, Luan H, Tang S (2009) Efficient algorithms for incremental maintenance of closed sequential patterns in large databases. Data Knowl Eng 68:68\u2013106","journal-title":"Data Knowl Eng"},{"issue":"6","key":"506_CR6","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1109\/TKDE.2004.44","volume":"16","author":"YL Cheung","year":"2004","unstructured":"Cheung YL, Fu AW (2004) Mining frequent itemsets without support threshold: with and without item constraints. IEEE Trans Knowl Data Eng 16(6):1052\u20131069","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"506_CR7","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1007\/s00778-007-0078-6","volume":"17","author":"KT Chuang","year":"2008","unstructured":"Chuang KT, Huang JL, Chen MS (2008) Mining top-k frequent patterns in the presence of the memory constraint. VLDB J 17(5):1321\u20131344","journal-title":"VLDB J"},{"issue":"1","key":"506_CR8","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":"1","key":"506_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"506_CR10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10489-009-0193-8","volume":"34","author":"R Hewett","year":"2011","unstructured":"Hewett R (2011) Mining software defect data to support software testing management. Appl Intell 34(2):245\u2013257","journal-title":"Appl Intell"},{"issue":"1","key":"506_CR11","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1016\/j.eswa.2011.07.113","volume":"39","author":"A Jim\u00e9nez","year":"2012","unstructured":"Jim\u00e9nez A, Galiano FB, Talavera JC (2012) Mining frequent patterns from XML data: efficient algorithms and design trade-offs. Expert Syst Appl 39(1):1134\u20131140","journal-title":"Expert Syst Appl"},{"key":"506_CR12","first-page":"283","volume-title":"International conference on knowledge discovery and data mining (KDD)","author":"HT Lam","year":"2010","unstructured":"Lam HT, Calders T (2010) Mining top-k frequent items in a data stream with flexible sliding windows. In: International conference on knowledge discovery and data mining (KDD), Jul 2010, pp 283\u2013292"},{"issue":"2","key":"506_CR13","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.eswa.2013.07.094","volume":"41","author":"G Lee","year":"2014","unstructured":"Lee G, Yun U, Ryu KH (2014) Sliding window based weighted maximal frequent pattern mining over data streams. Expert Syst Appl 41(2):694\u2013708","journal-title":"Expert Syst Appl"},{"issue":"6","key":"506_CR14","doi-asserted-by":"crossref","first-page":"1346","DOI":"10.1016\/j.jss.2012.01.024","volume":"85","author":"CW Li","year":"2012","unstructured":"Li CW, Jea KF, Lin RP, Yen SF, Hsu CW (2012) Mining frequent patterns from dynamic data streams with data load management. J Syst Softw 85(6):1346\u20131362","journal-title":"J Syst Softw"},{"key":"506_CR15","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/ICDM.2006.88","volume-title":"International conference on data mining (ICDM)","author":"G Li","year":"2006","unstructured":"Li G, Feng J, Wang J, Zhang Y, Zhou L (2006) Incremental mining of frequent query patterns from XML queries for caching. In: International conference on data mining (ICDM), Dec 2006, pp 350\u2013361"},{"issue":"3","key":"506_CR16","doi-asserted-by":"crossref","first-page":"4382","DOI":"10.1016\/j.eswa.2008.05.025","volume":"36","author":"H Li","year":"2008","unstructured":"Li H (2008) A sliding window method for finding top-k path traversal patterns over streaming web click-sequences. Expert Syst Appl 36(3):4382\u20134386","journal-title":"Expert Syst Appl"},{"issue":"7","key":"506_CR17","doi-asserted-by":"crossref","first-page":"10779","DOI":"10.1016\/j.eswa.2009.02.012","volume":"36","author":"H Li","year":"2009","unstructured":"Li H (2009) Interactive mining of top-k frequent closed itemsets from data streams. Expert Syst Appl 36(7):10779\u201310788","journal-title":"Expert Syst Appl"},{"key":"506_CR18","first-page":"447","volume-title":"Very large data bases (VLDB)","author":"X Li","year":"2007","unstructured":"Li X, Han J (2007) Mining approximate top-k subspace anomalies in multi-dimensional time-series data. In: Very large data bases (VLDB), Sep 2007, pp 447\u2013458"},{"key":"506_CR19","doi-asserted-by":"crossref","first-page":"2799","DOI":"10.1016\/j.eswa.2009.09.011","volume":"37","author":"KW Lin","year":"2010","unstructured":"Lin KW, Hsieh M, Tseng VS (2010) A novel prediction-based strategy for object tracking in sensor networks by mining seamless temporal movement patterns. Expert Syst Appl 37:2799\u20132807","journal-title":"Expert Syst Appl"},{"issue":"1","key":"506_CR20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.datak.2011.07.009","volume":"71","author":"YH Liu","year":"2012","unstructured":"Liu YH (2012) Mining frequent patterns from univariate uncertain data. Data Knowl Eng 71(1):47\u201368","journal-title":"Data Knowl Eng"},{"issue":"2","key":"506_CR21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10489-012-0415-3","volume":"39","author":"YH Liu","year":"2013","unstructured":"Liu YH (2013) Stream mining on univariate uncertain data. Appl Intell 39(2):315\u2013344","journal-title":"Appl Intell"},{"key":"506_CR22","first-page":"165","volume-title":"Proceedings of the SIAM international conference on data mining (SDM)","author":"C Lucchesea","year":"2010","unstructured":"Lucchesea C, Orlando S, Perego R (2010) Mining top-k patterns from binary datasets in presence of noise. In: Proceedings of the SIAM international conference on data mining (SDM), April 2010, pp 165\u2013176"},{"issue":"3","key":"506_CR23","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10489-012-0374-8","volume":"38","author":"C M\u00e1rquez-Vera","year":"2013","unstructured":"M\u00e1rquez-Vera C, Cano A, Romero C, Ventura S (2013) Predicting student failure at school using genetic programming and different data mining approaches with high dimensional and imbalanced data. Appl Intell 38(3):315\u2013330","journal-title":"Appl Intell"},{"key":"506_CR24","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/978-3-642-20847-8_18","volume-title":"Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD)","author":"M Muzammal","year":"2011","unstructured":"Muzammal M, Raman R (2011) Mining sequential patterns from probabilistic databases. In: Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD), May 2011, pp 210\u2013221"},{"key":"506_CR25","first-page":"21","volume-title":"Proc ACM SIGMOD workshop research issues in data mining and knowledge discovery","author":"J Pei","year":"2000","unstructured":"Pei J, Han J, Mao R (2000) Closet: an efficient algorithm for mining frequent closed itemsets. In: Proc ACM SIGMOD workshop research issues in data mining and knowledge discovery, May 2000, pp 21\u201330"},{"issue":"1","key":"506_CR26","doi-asserted-by":"crossref","first-page":"56","DOI":"10.4018\/jissc.2012010106","volume":"3","author":"RV Priya","year":"2012","unstructured":"Priya RV, Vadivel A, Thakur RS (2012) Maximal pattern mining using fast CP-tree for knowledge discovery. Int J Inf Syst Soc Change 3(1):56\u201374","journal-title":"Int J Inf Syst Soc Change"},{"issue":"1","key":"506_CR27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.knosys.2013.10.013","volume":"55","author":"G Pyun","year":"2014","unstructured":"Pyun G, Yun U, Ryu K (2014) Efficient frequent pattern mining based on linear prefix tree. Knowl-Based Syst 55(1):125\u2013129","journal-title":"Knowl-Based Syst"},{"issue":"5","key":"506_CR28","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.jbi.2011.04.002","volume":"44","author":"A Sallaberry","year":"2011","unstructured":"Sallaberry A, Pecheur N, Bringay S, Roche M, Teisseire M (2011) Sequential patterns mining and gene sequence visualization to discover novelty from microarray data. J Biomed Inform 44(5):760\u2013774","journal-title":"J Biomed Inform"},{"issue":"3","key":"506_CR29","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/s10489-012-0379-3","volume":"38","author":"BE Shie","year":"2013","unstructured":"Shie BE, Yu PS, Tseng VS (2013) Mining interesting user behavior patterns in mobile commerce environments. Appl Intell 38(3):418\u2013435","journal-title":"Appl Intell"},{"issue":"5","key":"506_CR30","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ins.2008.10.027","volume":"179","author":"SK Tanbeer","year":"2009","unstructured":"Tanbeer SK, Ahmed CF, Jeong BS, Lee YK (2009) Efficient single-pass frequent pattern mining using a prefix-tree. Inf Sci 179(5):559\u2013583","journal-title":"Inf Sci"},{"issue":"22","key":"506_CR31","doi-asserted-by":"crossref","first-page":"3843","DOI":"10.1016\/j.ins.2009.07.012","volume":"179","author":"SK Tanbeer","year":"2009","unstructured":"Tanbeer SK, Ahmed CF, Jeong BS, Lee YK (2009) Sliding window-based frequent pattern mining over data streams. Inf Sci 179(22):3843\u20133865","journal-title":"Inf Sci"},{"issue":"10","key":"506_CR32","doi-asserted-by":"crossref","first-page":"6968","DOI":"10.1016\/j.eswa.2010.03.023","volume":"37","author":"PS Tsai","year":"2010","unstructured":"Tsai PS (2010) Mining top-k frequent closed itemsets over data streams using the sliding window model. Expert Syst Appl 37(10):6968\u20136973","journal-title":"Expert Syst Appl"},{"key":"506_CR33","first-page":"253","volume-title":"Knowledge discovery and data mining (KDD)","author":"VS Tseng","year":"2010","unstructured":"Tseng VS, Wu CW, Shie BE, Yu PS (2010) UP-growth: an efficient algorithm for high utility itemset mining. In: Knowledge discovery and data mining (KDD), July 2010, pp 253\u2013262"},{"issue":"5","key":"506_CR34","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J Wang","year":"2005","unstructured":"Wang J, Han J, Lu Y, Tzvetkov P (2005) TFP: an efficient algorithm for mining top-k frequent closed itemsets. Data Knowl Eng 17(5):652\u2013664","journal-title":"Data Knowl Eng"},{"issue":"1","key":"506_CR35","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/s10489-009-0201-z","volume":"35","author":"YT Wang","year":"2011","unstructured":"Wang YT, Cheng JT (2011) Mining periodic movement patterns of mobile phone users based on an efficient sampling approach. Appl Intell 35(1):32\u201340","journal-title":"Appl Intell"},{"issue":"2","key":"506_CR36","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10618-006-0042-x","volume":"13","author":"RC Wong","year":"2006","unstructured":"Wong RC, Fu AW (2006) Mining top-k frequent itemsets from data streams. Data Min Knowl Discov 13(2):193\u2013217","journal-title":"Data Min Knowl Discov"},{"key":"506_CR37","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1109\/ICDM.2006.161","volume-title":"International conference on data mining (ICDM)","author":"H Xiong","year":"2006","unstructured":"Xiong H, Brodie M, Ma TOP-COP S (2006) Mining TOP-k strongly correlated pairs in large databases. In: International conference on data mining (ICDM), Dec 2006, pp 1162\u20131166"},{"issue":"4","key":"506_CR38","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s10489-013-0426-8","volume":"39","author":"SJ Yen","year":"2013","unstructured":"Yen SJ, Lee YS (2013) Mining non-redundant time-gap sequential patterns. Appl Intell 39(4):727\u2013738","journal-title":"Appl Intell"},{"key":"506_CR39","first-page":"100","volume-title":"IEEE international conference on spatial data mining and geographical knowledge services (ICSDM)","author":"JS Yoo","year":"2011","unstructured":"Yoo JS, Bow M (2011) Mining top-k closed co-location patterns. In: IEEE international conference on spatial data mining and geographical knowledge services (ICSDM), June 2011, pp 100\u2013105"},{"issue":"4","key":"506_CR40","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1142\/S0219622010003968","volume":"9","author":"U Yun","year":"2010","unstructured":"Yun U, Ryu KH (2010) Discovering important sequential patterns with length-decreasing weighted support constraints. Int J Inf Technol Decis Mak 9(4):575\u2013599","journal-title":"Int J Inf Technol Decis Mak"},{"issue":"1","key":"506_CR41","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.knosys.2010.07.007","volume":"24","author":"U Yun","year":"2011","unstructured":"Yun U, Ryu K (2011) Approximate weight frequent pattern mining with\/without noisy environments. Knowl-Based Syst 24(1):73\u201382","journal-title":"Knowl-Based Syst"},{"key":"506_CR42","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.knosys.2012.02.002","volume":"33","author":"U Yun","year":"2012","unstructured":"Yun U, Shin H, Ryu KH, Yoon E (2012) An efficient mining algorithm for maximal weighted frequent patterns in transactional databases. Knowl-Based Syst 33:53\u201364","journal-title":"Knowl-Based Syst"},{"issue":"5","key":"506_CR43","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"},{"issue":"1","key":"506_CR44","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.knosys.2013.10.011","volume":"55","author":"U Yun","year":"2014","unstructured":"Yun U, Lee G, Ryu K (2014) Mining maximal frequent patterns by considering weight conditions over data streams. Knowl-Based Syst 55(1):49\u201365","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"506_CR45","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","volume":"40","author":"B Vo","year":"2013","unstructured":"Vo B, Coenen F, Le B (2013) A new method for mining frequent weighted itemsets based on WIT-trees. Expert Syst Appl 40(4):1256\u20131264","journal-title":"Expert Syst Appl"},{"issue":"3","key":"506_CR46","first-page":"984","volume":"7","author":"X Zhang","year":"2011","unstructured":"Zhang X, Zhang Y (2011) Sliding-window top-k pattern mining on uncertain streams. J Comput Inf Syst 7(3):984\u2013992","journal-title":"J Comput Inf Syst"},{"key":"506_CR47","first-page":"1205","volume-title":"International conference on data mining (ICDM)","author":"J Zou","year":"2010","unstructured":"Zou J, Xiao J, Hou R, Wang Y (2010) Frequent instruction sequential pattern mining in hardware sample data. In: International conference on data mining (ICDM), Dec 2010, pp 1205\u20131210"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0506-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-013-0506-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0506-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:16:55Z","timestamp":1565126215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-013-0506-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,22]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["506"],"URL":"https:\/\/doi.org\/10.1007\/s10489-013-0506-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,22]]}}}