{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:37:55Z","timestamp":1760708275570},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T00:00:00Z","timestamp":1297728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10115-010-0363-3","type":"journal-article","created":{"date-parts":[[2011,2,14]],"date-time":"2011-02-14T08:41:03Z","timestamp":1297672863000},"page":"57-86","source":"Crossref","is-referenced-by-count":47,"title":["Mining top\u2212k frequent patterns without minimum support threshold"],"prefix":"10.1007","volume":"30","author":[{"given":"Abdus","family":"Salam","sequence":"first","affiliation":[]},{"given":"M. Sikandar Hayat","family":"Khayal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,15]]},"reference":[{"key":"363_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Aggarwal CC, Prasad VVV (2000) Depth first generation of long patterns. In: ACM conference on knowledge discovery and data mining (SIGKDD), pp 108\u2013118","DOI":"10.1145\/347090.347114"},{"key":"363_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami AN (1993) Mining Association Rules Between Sets of Items in Large Databases. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"363_CR3","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large databases (VLDB\u201994), Santiago, Chile. Morgan Kaufmann, pp 487\u2013499"},{"key":"363_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of the 11th international conference on data engineering, Taipei, Taiwan, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"363_CR5","doi-asserted-by":"crossref","unstructured":"Bayardo RJ (1998) Efficiently mining long patterns from databases. In: Proceedings of ACM SIGMOD international conference on management of data","DOI":"10.1145\/276304.276313"},{"key":"363_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"RE Bellman","year":"1958","unstructured":"Bellman RE (1958) On a routing problem. Q Appl Math 16: 87\u201390","journal-title":"Q Appl Math"},{"key":"363_CR7","unstructured":"Borgelt C (2004) Efficient implementations of apriori and eclat. In: 2nd workshop of frequent item set mining implementations, FIMI 2004. Brighton, UK"},{"key":"363_CR8","doi-asserted-by":"crossref","unstructured":"Brin S, Motwani R, Ullman J, Tsur S (1997) Dynamic itemset counting and implication rules for market basket data. In: Proceedings of ACM SIGMOD international conference on management of data. pp 255\u2013264","DOI":"10.1145\/253262.253325"},{"key":"363_CR9","doi-asserted-by":"crossref","unstructured":"Brin S, Motwani R, Silverstein C (1997) Beyond market baskets: generalizing association rules to correlations. In: Proceedings of ACM SIGMOD international conference on management of data. Arizona, pp 255\u2013264","DOI":"10.1145\/253262.253325"},{"key":"363_CR10","doi-asserted-by":"crossref","unstructured":"Burdick D, Calimlim M, Gehrke J (2001) Mafia: a maximal frequent itemset\u00a0algorithm for transactional databases. In: 17th international conference on data engineering (ICDE). Heidelberg, Germany","DOI":"10.1109\/TKDE.2005.183"},{"key":"363_CR11","doi-asserted-by":"crossref","unstructured":"Calders T, Dexters N, Goethals B (2007) Mining frequent itemsets in a stream. In: 2007 seventh IEEE international conference on data mining. pp 83\u201392","DOI":"10.1109\/ICDM.2007.66"},{"key":"363_CR12","unstructured":"Cheung YL, Fu AW (2004) Mining association rules without support threshold: with and without item constraints. In: TKDE"},{"key":"363_CR13","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1007\/s00778-007-0078-6","volume":"17","author":"K Chuang","year":"2008","unstructured":"Chuang K, Huang JL, Chen MS (2008) Mining top-k frequent patterns in the presence of the memory constraint. The VLDB J 17: 1321\u20131344","journal-title":"The VLDB J"},{"key":"363_CR14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10115-007-0115-1","volume":"16","author":"SM Chung","year":"2008","unstructured":"Chung SM, Luo C (2008) Efficient mining of maximal frequent itemsets from databases on a cluster of workstations. Know Inf Syst 16: 359\u2013391","journal-title":"Know Inf Syst"},{"key":"363_CR15","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connection with graphs. Numeriche Mathematik 1: 269\u2013271","journal-title":"Numeriche Mathematik"},{"key":"363_CR16","doi-asserted-by":"crossref","unstructured":"El-Sayed M, Ruiz C, Rundensteiner EA (2004) FS-Miner: efficient and incremental mining of frequent sequence patterns in web logs. In: Proceedings of the 6th annual ACM international workshop on Web information and data management. WIDM \u201804","DOI":"10.1145\/1031453.1031477"},{"issue":"2","key":"363_CR17","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1999","unstructured":"Eppstein D (1999) Finding the k shortest paths. SIAM J Comput 28(2): 652\u2013673","journal-title":"SIAM J Comput"},{"key":"363_CR18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10115-008-0146-2","volume":"19","author":"TP Exarchos","year":"2009","unstructured":"Exarchos TP, Tsipouras MG, Papaloukas C, Fotiadis DI (2009) An optimized sequential pattern matching methodology for sequence classification. Know Inf Syst 19: 249\u2013264","journal-title":"Know Inf Syst"},{"key":"363_CR19","doi-asserted-by":"crossref","unstructured":"Fang G, Deng Z, Ma H (2009) Network Traffic Monitoring Based on Mining Frequent Patterns. In: Sixth international conference on fuzzy systems and knowledge discovery. pp 571\u2013575","DOI":"10.1109\/FSKD.2009.444"},{"issue":"6","key":"363_CR20","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6): 345","journal-title":"Commun ACM"},{"key":"363_CR21","unstructured":"Gouda K, Zaki MJ (2005) GenMax: an efficient algorithm for mining maximal frequent itemsets, data mining and knowledge discovery, 11. Springer Science and Business Media, Netherlands, pp 1\u201320"},{"key":"363_CR22","unstructured":"Grahne G, Zhu J (2003) High performance mining of maximal frequent itemsets. In: Proceeding of the 6th SIAM international workshop on high performance data mining, pp 135\u2013143"},{"issue":"2","key":"363_CR23","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D Gunopulos","year":"2003","unstructured":"Gunopulos D, Khardon R, Mannila H et\u00a0al (2003) Discovering all most specific sentences. ACM Trans Database Syst(TODS) 28(2): 140\u2013174","journal-title":"ACM Trans Database Syst(TODS)"},{"key":"363_CR24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF02345483","volume":"1","author":"P H\u2019ajek","year":"1966","unstructured":"H\u2019ajek P, Havel I, Chytil M (1966) The GUHA method of automatic hypotheses determination. Computing 1: 293\u2013308","journal-title":"Computing"},{"key":"363_CR25","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 Disc 15: 55\u201386","journal-title":"Data Min Knowl Disc"},{"issue":"2","key":"363_CR26","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/380995.381002","volume":"2","author":"J Han","year":"2000","unstructured":"Han J, Pei J (2000) Mining frequent patterns by pattern growth: methodology and implications. SIGKDD Explor 2(2): 14\u201320","journal-title":"SIGKDD Explor"},{"issue":"2","key":"363_CR27","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern SSC4 4(2): 100\u2013107","journal-title":"IEEE Trans Syst Sci Cybern SSC4"},{"issue":"2","key":"363_CR28","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/PL00011664","volume":"3","author":"JD Holt","year":"2001","unstructured":"Holt JD, Chung SM (2001) Multipass algorithms for mining association rules in text databases. Know Inf Syst 3(2): 168\u2013183","journal-title":"Know Inf Syst"},{"issue":"4","key":"363_CR29","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0020-0190(01)00330-1","volume":"83","author":"JD Holt","year":"2002","unstructured":"Holt JD, Chung SM (2002) Mining association rules using inverted hashing and pruning. Inf Process Lett 83(4): 211\u2013220","journal-title":"Inf Process Lett"},{"issue":"1","key":"363_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson DB (1977) Efficient algorithms for shortest paths in sparse networks. J ACM 24(1): 1\u201313","journal-title":"J ACM"},{"key":"363_CR31","unstructured":"Khan A, Khan K, Baharudin BB (2009) Frequent patterns mining of stock data using hybrid clustering association Algorithm. In: International conference on information management and engineering. pp 667\u2013671"},{"key":"363_CR32","doi-asserted-by":"crossref","unstructured":"Keogh E, Lonardi S, Ratanamahatana CA (2004) Towards parameter-free data mining. In: KDD\u201904","DOI":"10.1145\/1014052.1014077"},{"key":"363_CR33","unstructured":"Liu B, Hsu W, Ma Y (1998) Integrating classification and association rule mining. In: Proceedings of the 4th International Conference on knowledge discovery and data mining, New York, pp 80\u201386"},{"key":"363_CR34","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10115-007-0111-5","volume":"17","author":"G Liu","year":"2008","unstructured":"Liu G, Li J, Wong L (2008) A new concise representation of frequent itemsets using generators and a positive border. Know Inf Syst 17: 35\u201356","journal-title":"Know Inf Syst"},{"issue":"3","key":"363_CR35","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H, Verkamo AI (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Discov 1(3): 259\u2013289","journal-title":"Data Min Knowl Discov"},{"key":"363_CR36","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0306-4379(03)00072-3","volume":"29","author":"T Pang-Ning","year":"2004","unstructured":"Pang-Ning T, Vipin K, Jaideep S. (2004) Selecting the right objective measure for association analysis. Inf Syst 29: 293\u2013313","journal-title":"Inf Syst"},{"issue":"5","key":"363_CR37","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1109\/69.634757","volume":"9","author":"JS Park","year":"1997","unstructured":"Park JS, Chen MS, Yu PS (1997) Using a hash-based method with transaction trimming for mining association rules. IEEE Trans Knowl Data Eng 9(5): 813\u2013825","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"363_CR38","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), Israel. pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"363_CR39","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proceedings of the 5th ACM SIGMOD workshop on research issues in data mining and knowledge discovery. pp 21\u201330"},{"key":"363_CR40","first-page":"229","volume-title":"Knowledge discovery in databases","author":"G Piatetsky-Shapiro","year":"1991","unstructured":"Piatetsky-Shapiro G (1991) Discovery, analysis and presentation of strong rules. In: Piatetsky-Shapiro G, Frawley W (eds) Knowledge discovery in databases. MIT Press, Cambridge, MA, pp 229\u2013248"},{"key":"363_CR41","unstructured":"Savasere A, Omiecinski E, Navathe S (1995) An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21st VLDB conference. pp 432\u2013444"},{"key":"363_CR42","unstructured":"Tan PN, Kumar V (2000) Interestingness measures for association patterns: a perspective. In: KDD 2000 workshop on postprocessing in machine learning and data mining. Boston, MA"},{"key":"363_CR43","unstructured":"Tianming H, Sam YS, Hui X, Qian F (2007) Discovery of maximum length frequent itemsets"},{"key":"363_CR44","volume-title":"Information Retrieval","author":"CJ Van Rijsbergen","year":"1979","unstructured":"Van Rijsbergen CJ (1979) Information Retrieval 2nd edn. Butterworths, London","edition":"2"},{"key":"363_CR45","doi-asserted-by":"crossref","unstructured":"Wan L, Liao J, Zhu X (2009) A frequent pattern based framework for event detection in sensor network stream data. In: Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data. SensorKDD \u201809","DOI":"10.1145\/1601966.1601982"},{"key":"363_CR46","doi-asserted-by":"crossref","unstructured":"Wang H, Yang J, Wang W, Yu P (2002) Clustering by pattern similarity in large data sets. In: Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, Wisconsin, pp 394\u2013405","DOI":"10.1145\/564691.564737"},{"key":"363_CR47","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J (2003) CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proceeding of the ACM SIGKDD Intl. Conf. on knowledge discovery and data mining (KDD\u201903), Washington, DC, pp 236\u2013245","DOI":"10.1145\/956750.956779"},{"key":"363_CR48","unstructured":"Wang J, Han J, Lu Y, Tzvetkov P (2005) TFP: an efficient algorithm for mining top-k frequent closed itemsets. In: TKDE"},{"issue":"3","key":"363_CR49","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/1010614.1010616","volume":"22","author":"X Wu","year":"2004","unstructured":"Wu X, Zhang C, Zhang S (2004) Efficient mining of both positive and negative association rules. ACM Trans Information System 22(3): 381\u2013405","journal-title":"ACM Trans Information System"},{"key":"363_CR50","doi-asserted-by":"crossref","unstructured":"Yang G (2004) The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceeding of the ACM SIGKDD Intl. Conf. on knowledge discovery in databases (KDD\u201904), Seattle, WA, pp 344\u2013353","DOI":"10.1145\/1014052.1014091"},{"key":"363_CR51","unstructured":"Zaki MJ, Hsiao CJ (2002) CHARM: An efficient algorithm for closed itemset mining. In: Proceedings of the 2nd SIAM international conference on data mining. pp 12\u201328"},{"key":"363_CR52","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10115-007-0081-7","volume":"15","author":"S Zhang","year":"2008","unstructured":"Zhang S, Wu X, Zhang C, Lu J (2008) Computing the minimum-support for mining frequent patterns. Know Inf Syst 15: 233\u2013257","journal-title":"Know Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0363-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0363-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0363-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T10:44:59Z","timestamp":1559990699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0363-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,15]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["363"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0363-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,15]]}}}