{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T01:34:48Z","timestamp":1774316088432,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,12,31]],"date-time":"2015-12-31T00:00:00Z","timestamp":1451520000000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10115-015-0907-7","type":"journal-article","created":{"date-parts":[[2015,12,31]],"date-time":"2015-12-31T12:55:12Z","timestamp":1451566512000},"page":"741-762","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Top-K Miner: top-K identical frequent itemsets discovery without user support threshold"],"prefix":"10.1007","volume":"48","author":[{"family":"Saif-Ur-Rehman","sequence":"first","affiliation":[]},{"given":"Jawad","family":"Ashraf","sequence":"additional","affiliation":[]},{"given":"Asad","family":"Habib","sequence":"additional","affiliation":[]},{"given":"Abdus","family":"Salam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,31]]},"reference":[{"key":"907_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM-SIGMOD international conference on management of data (SIGMOD\u201993). Washington, DC, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"907_CR2","unstructured":"Grahne G, Zhu J (2003) High performance mining of maximal frequent itemsets. In: Proceeding of the 2003 SIAM international workshop on high performance data mining. pp 135\u2013143"},{"issue":"6","key":"907_CR3","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1023\/A:1006624031083","volume":"14","author":"W Lee","year":"2000","unstructured":"Lee W, Stolfo SJ, Mok KW (2000) Adaptive intrusion detection: a data mining approach. Artif Intell Rev 14(6):533\u2013567","journal-title":"Artif Intell Rev"},{"key":"907_CR4","doi-asserted-by":"crossref","unstructured":"Pei J, Han J, Mortazavi-Asl B, Zhu H (2000) Mining access patterns efficiently from web logs. In: Proceeding of the 2000 Pacific-Asia conference on knowledge discovery and data mining. Kyoto, Japan, pp 396\u2013407","DOI":"10.1007\/3-540-45571-X_47"},{"key":"907_CR5","doi-asserted-by":"crossref","unstructured":"Holt JD, Chung SM (1999) Efficient mining of association rules in text databases. In: Proceeding of the 1999 international conference on Information and knowledge management. Kansas City, Missouri, pp 234\u2013242","DOI":"10.1145\/319950.319981"},{"key":"907_CR6","unstructured":"Klemettinen M (1999) A knowledge discovery methodology for telecommunication network alarm databases. Ph.D. thesis, University of Helsinki"},{"key":"907_CR7","unstructured":"Satou K, Shibayama G, Ono T, Yamamura Y, Furuichi E, Kuhara S, Takagi T (1997) Finding associations rules on heterogeneous genome data. In: Proceeding of the 1997 Pacific symposium on biocomputing (PSB\u201997). Hawaii, pp 397\u2013408"},{"key":"907_CR8","doi-asserted-by":"crossref","unstructured":"Bayardo RJ (1998) Efficiently mining long patterns from databases. In: Proceeding of the 1998 ACM-SIGMOD international conference on management of data (SIGMOD\u201998). Seattle, WA, pp 85\u201393","DOI":"10.1145\/276304.276313"},{"issue":"11","key":"907_CR9","doi-asserted-by":"crossref","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D Burdick","year":"2005","unstructured":"Burdick D, Calimlim M, Flannick J, Gehrke J, Yiu T (2005) MAFIA: a maximal frequent itemset algorithm. IEEE Trans Knowl Data Eng 17(11):1490\u20131504","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"907_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K Gouda","year":"2005","unstructured":"Gouda K, Zaki MJ (2005) GenMax: an efficient algorithm for mining maximal frequent itemsets. Data Min Knowl Discov 11(3):1\u201320","journal-title":"Data Min Knowl Discov"},{"key":"907_CR11","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceeding of the 7th international conference on database theory (ICDT\u201999). Jerusalem, Israel, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"907_CR12","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proceeding of the 2000 ACM-SIGMOD international workshop data mining and knowledge discovery (DMKD\u201900). Dallas, TX, pp 11\u201320"},{"key":"907_CR13","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Hsiao CJ (2002) CHARM: an efficient algorithm for closed itemset mining. In: Proceeding of the 2002 SIAM international conference on data mining (SDM\u201902). Arlington, VA, pp 457\u2013473","DOI":"10.1137\/1.9781611972726.27"},{"key":"907_CR14","doi-asserted-by":"crossref","unstructured":"Borgelt C, Yang X, Nogales-Cadenas R, Carmona-Saez P, Pascual-Montano A (2011) Finding closed frequent item sets by intersecting transactions. In: Proceedings of the 2011 international conference on extending database technology (EDBT-11). Sweden, Uppsala, pp 367\u2013376","DOI":"10.1145\/1951365.1951410"},{"issue":"1","key":"907_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ins.2007.08.006","volume":"178","author":"T Hu","year":"2008","unstructured":"Hu T, Sung SY, Xiong H, Fu Q (2008) Discovery of maximum length frequent itemsets. Inf Sci Int J 178(1):69\u201387","journal-title":"Inf Sci Int J"},{"key":"907_CR16","doi-asserted-by":"crossref","unstructured":"Zhu F, Yan X, Han J, Yu PS, Cheng H (2007) Mining colossal frequent patterns by core pattern fusion. In: Proceeding of the 2007 international conference on data engineering (ICDE\u201907). Istanbul, Turkey, pp 706\u2013715","DOI":"10.1109\/ICDE.2007.367916"},{"issue":"1","key":"907_CR17","first-page":"304","volume":"10","author":"M Dabbiru","year":"2010","unstructured":"Dabbiru M, Shashi M (2010) An efficient approach to colossal pattern mining. Int J Comput Sci Netw Secur (IJCSNS) 10(1):304\u2013312","journal-title":"Int J Comput Sci Netw Secur (IJCSNS)"},{"key":"907_CR18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.knosys.2012.03.003","volume":"33","author":"MK Sohrabi","year":"2012","unstructured":"Sohrabi MK, Barforoush AA (2012) Efficient colossal pattern mining in high dimensional datasets. Knowl Based Syst 33:41\u201352","journal-title":"Knowl Based Syst"},{"key":"907_CR19","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceeding of the 2000 ACM-SIGMOD international conference on management of data (SIGMOD\u201900). Dallas, TX, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"issue":"1","key":"907_CR20","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 (2007) Frequent pattern mining\u2014current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"issue":"9","key":"907_CR21","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1109\/TKDE.2004.44","volume":"16","author":"YL Cheung","year":"2004","unstructured":"Cheung YL, Fu AWC (2004) Mining frequent itemsets without support threshold: with and without item constraints. IEEE Trans Knowl Data Eng 16(9):1052\u20131069","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"907_CR22","unstructured":"Fu AWC, Kwong RWW, Tang J (2000) Mining N-most interesting itemsets. In: Proceedings of the 2000 international symposium on methodologies for intelligent systems. pp 59\u201367"},{"issue":"1","key":"907_CR23","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1504\/IJBIDM.2005.007320","volume":"1","author":"SC Ngan","year":"2005","unstructured":"Ngan SC, Lam T, Wong RCW, Fu AWC (2005) Mining N-most interesting itemsets without support threshold by the COFI-tree. Int J Bus Intell Data Min 1(1):88\u2013106","journal-title":"Int J Bus Intell Data Min"},{"key":"907_CR24","unstructured":"El-Hajj M, Za\u00efane OR (2003) COFI-tree mining: a new approach to pattern growth with reduced candidacy generation. In: Workshop on frequent itemset mining implementations (FIMI 2003) in conjunction with IEEE-ICDM"},{"issue":"1","key":"907_CR25","first-page":"112","volume":"30","author":"A Salam","year":"2011","unstructured":"Salam A, Khayal M (2011) Mining top-k frequent patterns without minimum support threshold. Knowl Inf Syst 30(1):112\u2013142","journal-title":"Knowl Inf Syst"},{"key":"907_CR26","doi-asserted-by":"crossref","unstructured":"Li Y, Lin Q, Li R, Duan D (2010) TGP: mining top-K frequent closed graph pattern without minimum support. In: Proceeding of the 2010 international conference on advanced data mining and applications (ADMA \u201910). pp 537\u2013548","DOI":"10.1007\/978-3-642-17316-5_51"},{"key":"907_CR27","doi-asserted-by":"crossref","unstructured":"Xie Y, Yu PS (2010) Max-Clique: a top-down graph-based approach to frequent pattern mining. In: Proceeding of the 2010 IEEE international conference on data mining (ICDM \u201910). pp 1139\u20131144","DOI":"10.1109\/ICDM.2010.73"},{"key":"907_CR28","doi-asserted-by":"crossref","unstructured":"Okubo Y, Haraguchi M (2012) Finding top-N colossal patterns based on clique search with dynamic update of graph. In: Proceeding of the 2012 international conference on formal concept analysis (ICFCA\u201912). Springer, pp 244\u2013259","DOI":"10.1007\/978-3-642-29892-9_23"},{"key":"907_CR29","unstructured":"Agrawal R, Mannila H, Srikant R, Toivonen H, Verkamo A (1996) Fast discovery of association rules. In: Fayyad UM, Piatetsky G, Smyth P, Uthurusamy R (eds) Advances in KDD. MIT press"},{"key":"907_CR30","unstructured":"Holsheimer M, Kersten M, Mannila H, Toivonen H (1995) A perspective on database and data mining. In: Proceeding of the 1995 international conference on knowledge discovery and data mining (KDD\u2019 95). pp 150\u2013155"},{"key":"907_CR31","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In: Proceedings of the 2003 ACM-SIGKDD international conference on knowledge discovery and data mining (SIGKDD\u201903). Washington, pp 326\u2013335","DOI":"10.1145\/956750.956788"},{"key":"907_CR32","unstructured":"Frequent itemset mining implementations repository. http:\/\/fimi.cs.helsinki.fi\/"},{"key":"907_CR33","unstructured":"Shen L, Shen H, Pritchard P, Topor R (1998) Finding the N largest itemsets. In: Proceedings of international conference on data mining. pp 211\u2013222"},{"key":"907_CR34","unstructured":"Quang TM, Oyanagi S, Yamazaki K (2006) ExMiner: an efficient algorithm for mining top-K frequent patterns, ADMA 2006, LNAI 4093. pp 436\u2013447"},{"issue":"5","key":"907_CR35","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 (2005) TFP: an efficient algorithm for mining top-K frequent closed itemsets. IEEE Trans Knowl Data Eng 17(5):652\u2013664","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"907_CR36","unstructured":"Hirate Y, Iwahashi E, Yamana H (2004) TF2P-growth: an efficient algorithm for mining frequent patterns without any thresholds. In: Proceedings of ICDM"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0907-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0907-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0907-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T23:59:39Z","timestamp":1748735979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0907-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,31]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["907"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0907-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,31]]}}}