{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:19:32Z","timestamp":1764688772777},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T00:00:00Z","timestamp":1279756800000},"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":[[2011,10]]},"DOI":"10.1007\/s10115-010-0329-5","type":"journal-article","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T08:56:38Z","timestamp":1279702598000},"page":"55-80","source":"Crossref","is-referenced-by-count":18,"title":["Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression"],"prefix":"10.1007","volume":"29","author":[{"given":"Fabian","family":"Moerchen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Thies","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred","family":"Ultsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,22]]},"reference":[{"key":"329_CR1","unstructured":"Afrati F, Gionis A, Mannila H (2004) Approximating a collection of frequent sets, In: Proceedings of 10th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. ACM Press, pp 12\u201319"},{"key":"329_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 ACM SIGMOD international conference on Management of Data. ACM Press, pp 207\u2013216.","DOI":"10.1145\/170036.170072"},{"key":"329_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Yu PS and Chen ASP (eds) Proceedings of 11th international conference on data engineering. pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"329_CR4","unstructured":"Asuncion A, Newman D (2007) UCI machine learning repository. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"329_CR5","unstructured":"Beil F, Ester M, Xu X (2002) Frequent term-based text clustering, In: Proceedings of 8th international conference on knowledge discovery and data mining. pp 436\u2013442"},{"issue":"1","key":"329_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10115-009-0212-4","volume":"21","author":"M Boley","year":"2009","unstructured":"Boley M, Grosskreutz H (2009) Approximating the number of frequent sets in dense data. Knowl Inf Syst 21(1): 65\u201389","journal-title":"Knowl Inf Syst"},{"key":"329_CR7","unstructured":"Bonchi F, Lucchese C (2005) Pushing tougher constraints in frequent pattern mining, In: Proceedings of Pacific-Asia conference on knowledge discovery and data Mining. pp 114\u2013124"},{"issue":"2","key":"329_CR8","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/s10115-005-0201-1","volume":"9","author":"F Bonchi","year":"2006","unstructured":"Bonchi F, Lucchese C (2006) On condensed representations of constrained frequent patterns. Knowl Inf Syst 9(2): 180\u2013201","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"329_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.datak.2006.02.006","volume":"60","author":"F Bonchi","year":"2007","unstructured":"Bonchi F, Lucchese C (2007) Extending the state-of-the-art of constraint-based pattern discovery. Data Min Knowl Discov 60(2): 377\u2013399","journal-title":"Data Min Knowl Discov"},{"key":"329_CR10","unstructured":"Boulicaut J-F, Bykowski A (2000) Frequent closures as a concise representation for binary data mining. In: Proceedings of Pacific-Asia conference on knowledge discovery and data mining. pp 62\u201373"},{"issue":"1","key":"329_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J-F Boulicaut","year":"2003","unstructured":"Boulicaut J-F, Bykowski A, Rigotti C (2003) Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min Knowl Discov 7(1): 5\u201322","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"329_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10115-008-0136-4","volume":"18","author":"B Bringmann","year":"2009","unstructured":"Bringmann B, Zimmermann A (2009) One in a million: picking the right patterns. Knowl Inf Syst 18(1): 61\u201381","journal-title":"Knowl Inf Syst"},{"key":"329_CR13","doi-asserted-by":"crossref","unstructured":"Bykowski A, Rigotti C (2001) A condensed representation to find frequent patterns. In: Proceedings of 20th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems. ACM Press, pp 267\u2013273","DOI":"10.1145\/375551.375604"},{"key":"329_CR14","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: Proceedings of 6th European conference on principles of data mining and knowledge discovery. Springer, pp 74\u201385","DOI":"10.1007\/3-540-45681-3_7"},{"key":"329_CR15","unstructured":"Calders T, Goethals B (2003) Minimal k-free representations of frequent sets, In: Proceedings of 7th European conference on principles and practice of knowledge discovery in databases. Springer, pp 71\u201382"},{"issue":"1","key":"329_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10618-006-0054-6","volume":"14","author":"T Calders","year":"2007","unstructured":"Calders T, Goethals B (2007) Non-derivable itemset mining. Data Min Knowl Discov 14(1): 171\u2013206","journal-title":"Data Min Knowl Discov"},{"key":"329_CR17","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B, Mampaey M (2007) Mining itemsets in the presence of missing values. In: Proceedings of international symposium on applied computing. ACM, pp 404\u2013408","DOI":"10.1145\/1244002.1244097"},{"key":"329_CR18","doi-asserted-by":"crossref","unstructured":"Calders T, Rigotti C, Boulicaut J-F (2006) A survey on condensed representations for frequent sets. In: Constraint-based mining and inductive databases. pp 64\u201380","DOI":"10.1007\/11615576_4"},{"key":"329_CR19","doi-asserted-by":"crossref","unstructured":"Cheng H, Yan X, Han J, Hsu C (2007) Discriminative frequent pattern analysis for effective classification. In: Proceedings of IEEE international conference on data engineering. pp 716\u2013725","DOI":"10.1109\/ICDE.2007.367917"},{"key":"329_CR20","doi-asserted-by":"crossref","unstructured":"Cheng H, Yu PS, Han J (2006) AC-Close: efficiently mining approximate closed itemsets by core pattern recovery. In: Proceedings of IEEE international conference on data mining. IEEE pp 839\u2013844","DOI":"10.1109\/ICDM.2006.10"},{"key":"329_CR21","doi-asserted-by":"crossref","unstructured":"Cheng H, Yu PS, Han J (2008) Approximate frequent itemset mining in the presence of random noise. In: Soft computing for knowledge discovery and data Mining. Springer, pp 363\u2013389","DOI":"10.1007\/978-0-387-69935-6_15"},{"key":"329_CR22","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Ng W (2006) \u03b4-tolerance closed frequent itemsets. In: Proceedings of 6th IEEE international conference on data mining. IEEE Press, pp 139\u2013148","DOI":"10.1109\/ICDM.2006.1"},{"key":"329_CR23","unstructured":"Coenen F (2003) The LUCS-KDD discretised\/normalised ARM and CARM data library. http:\/\/www.csc.liv.ac.uk\/~frans\/KDD\/Software\/LUCS_KDD_DN\/"},{"key":"329_CR24","doi-asserted-by":"crossref","unstructured":"De Raedt L, Guns T, Nijssen S (2008) Constraint programming for itemset mining. In: Proceedings of 14th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 204\u2013212","DOI":"10.1145\/1401890.1401919"},{"issue":"1","key":"329_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10618-006-0057-3","volume":"15","author":"C Faloutsos","year":"2007","unstructured":"Faloutsos C, Megalooikonomou V (2007) On data mining, compression, and kolmogorov complexity. Data Min Knowl Discov 15(1): 3\u201320","journal-title":"Data Min Knowl Discov"},{"key":"329_CR26","doi-asserted-by":"crossref","unstructured":"Fung B, Wang K, Ester M (2003) Hierarchical document clustering using frequent itemsets, In: Proceedings of SIAM international conference on data mining","DOI":"10.1137\/1.9781611972733.6"},{"key":"329_CR27","unstructured":"Gallo A, De Bie T, Cristianini N (2007) Mini: Mining informative non-redundant itemsets, In: Proceedings of European symposium on principles of data mining and knowledge Discovery. pp 438\u2013445"},{"key":"329_CR28","unstructured":"Garriga G (2005) Summarizing sequential data with closed partial orders. In: Proceedings of 5th SIAM international conference on data mining. SIAM, pp 380\u2013391"},{"key":"329_CR29","doi-asserted-by":"crossref","unstructured":"Garriga G, Kralj P, Lavrac N (2006) Closed sets for labeled data. In: Proceedings of European conference on principles and practice of knowledge discovery in databases. pp 163\u2013174","DOI":"10.1007\/11871637_19"},{"key":"329_CR30","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielik\u00e4inen T (2004) Tiling databases. In: Proceedings of discovery science. pp 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"key":"329_CR31","doi-asserted-by":"crossref","unstructured":"Goethals B, Zaki M (2003) FIMI \u201903, frequent itemset mining implementations, In: Proceedings of ICDM 2003 workshop on frequent itemset mining implementations","DOI":"10.1145\/1007730.1007744"},{"key":"329_CR32","volume-title":"Studies in the way of Words","author":"H Grice","year":"1989","unstructured":"Grice H (1989) Studies in the way of Words. Harvard University Press, Cambridge"},{"key":"329_CR33","doi-asserted-by":"crossref","unstructured":"Gupta R, Fang G, Field B, Steinbach M, Kumar V (2008) Quantitative evaluation of approximate frequent pattern mining algorithms. In: Proceedings of 14th ACM SIGKDD international conference on knowledge discovery and data Mining. ACM, pp 301\u2013309","DOI":"10.1145\/1401890.1401930"},{"key":"329_CR34","unstructured":"Han J, Pei J (2001) Pattern growth methods for sequential pattern mining: Principles and extensions, In: Workshop on temporal data mining, 7th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press"},{"key":"329_CR35","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD international conference on management of data. ACM Press, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"issue":"1","key":"329_CR36","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/360402.360421","volume":"2","author":"J Hipp","year":"2000","unstructured":"Hipp J, G\u00fcntzer U, Nakhaeizadeh G (2000) Algorithms for association rule mining\u2014a general survey and comparison. SIGKDD Explor 2(1): 58\u201364","journal-title":"SIGKDD Explor"},{"issue":"1","key":"329_CR37","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10618-006-0049-3","volume":"14","author":"E Keogh","year":"2007","unstructured":"Keogh E, Lonardi S, Ratanamahatana C, Wei L, Lee S, Handley J (2007) Compression-based data mining of sequential data. Data Min Knowl Discov 14(1): 99\u2013129","journal-title":"Data Min Knowl Discov"},{"key":"329_CR38","doi-asserted-by":"crossref","unstructured":"Kohavi R, Brodley C, Frasca B, Mason L, Zheng Z (2000) \u2018KDD-Cup 2000 organizers\u2019 report: Peeling the onion. SIGKDD Explor 2(2): 86\u201398. http:\/\/www.ecn.purdue.edu\/KDDCUP","DOI":"10.1145\/380995.381033"},{"key":"329_CR39","unstructured":"Kryszkiewicz M (2001) Concise representation of frequent patterns based on disjunction-free generators, In: Proceedings of 1st IEEE international conference on data mining. IEEE Press, pp 305\u2013312"},{"key":"329_CR40","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of IEEE international conference on data mining, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"key":"329_CR41","unstructured":"Li J, Li H, Wong L, Pei J, Dong G (2006) Minimum description length principle: generators are preferable to closed patterns. In: Proceedings of AAAI, pp 409\u2013414"},{"key":"329_CR42","unstructured":"Li W, Han J, Pei J (2001) CMAR: Accurate and efficient classification based on multiple class-association rules. In: Proceedings of IEEE international conference on data mining. pp 369\u2013376"},{"key":"329_CR43","unstructured":"Liu B, Hsu W, Ma Y (1998) Integrating classification and association rule mining. In: Proceedings of international conference on knowledge discovery and data mining. pp 80\u201386"},{"issue":"1","key":"329_CR44","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. Knowl Inf Syst 17(1): 35\u201356","journal-title":"Knowl Inf Syst"},{"key":"329_CR45","unstructured":"Liu J, Paulsen S, Wang W, Nobel A, Prins J (2005) Mining approximate frequent itemsets from noisy data. In: Proceedings of 5th international conference data mining. IEEE, pp 721\u2013724"},{"issue":"1","key":"329_CR46","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese C, Orlando S, Perego R (2006a) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1): 21\u201336","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"329_CR47","doi-asserted-by":"crossref","unstructured":"Lucchese C, Orlando S, Perego R (2006b) Mining frequent closed itemsets out of core, In: Proceedings of the 6th SIAM international conference on data mining (SDM\u201906)","DOI":"10.1137\/1.9781611972764.37"},{"key":"329_CR48","doi-asserted-by":"crossref","unstructured":"Lucchese C, Orlando S, Perego R (2007) Parallel mining of frequent closed patterns: harnessing modern computer architectures. In: Proceedings IEEE international conference on data mining","DOI":"10.1109\/ICDM.2007.13"},{"key":"329_CR49","doi-asserted-by":"crossref","unstructured":"Malik H, Kender J (2006) High quality, efficient hierarchical document clustering using closed interesting itemsets. In: Proceedings of IEEE international conference on data mining. pp 991\u2013996","DOI":"10.1109\/ICDM.2006.81"},{"key":"329_CR50","unstructured":"Mielik\u00e4inen T. (2005) Summarization techniques for pattern collections in data mining, PhD thesis, University of Helsinki, Finland"},{"key":"329_CR51","unstructured":"M\u00f6rchen F (2006) Algorithms for time series knowledge mining, In: Proceedings 12th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, pp 668\u2013673"},{"issue":"2","key":"329_CR52","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10618-007-0070-1","volume":"15","author":"F M\u00f6rchen","year":"2007","unstructured":"M\u00f6rchen F, Ultsch A (2007) Efficient mining of understandable patterns from multivariate interval time series. Data Min Knowl Discov 15(2): 181\u2013215","journal-title":"Data Min Knowl Discov"},{"key":"329_CR53","doi-asserted-by":"crossref","unstructured":"Muhonen J, Toivonen H (2006) Closed non-derivable itemsets. In: Proceedings European symposium on principles of data mining and knowledge discovery. pp 601\u2013608","DOI":"10.1007\/11871637_61"},{"key":"329_CR54","doi-asserted-by":"crossref","unstructured":"Ng R, Lakshmanan LV, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of ACM SIGMOD conference on management of Data. ACM, pp 13\u201324","DOI":"10.1145\/276305.276307"},{"key":"329_CR55","doi-asserted-by":"crossref","unstructured":"Nijssen S, Fromont E (2007) Mining optimal decision trees from itemset lattices. In: Proceedings of international conference on knowledge discovery and data mining. ACM, pp 530\u2013539","DOI":"10.1145\/1281192.1281250"},{"key":"329_CR56","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of 7th international conference on database theory. Springer, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"329_CR57","unstructured":"Pei J, Dong G, Zou W, Han J (2002) On computing condensed frequent pattern bases. In: Proceedings of 2nd IEEE international conference on data mining. IEEE Press, pp 378\u2013385"},{"key":"329_CR58","unstructured":"Pei J, Han J, Lakshmanan LVS (2001) Mining frequent itemsets with convertible constraints. In: Proceedings of IEEE international conference on data Engineering. IEEE, pp 433\u2013442"},{"key":"329_CR59","unstructured":"Pei J, Tung AK, Han J (2001) Fault-tolerant frequent pattern mining: problems and challenges. In: Workshop on research issues in data mining and knowledge discovery, 20th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems"},{"issue":"11","key":"329_CR60","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1109\/TKDE.2006.172","volume":"18","author":"J Pei","year":"2006","unstructured":"Pei J, Wang H, Liu J, Wang K, Wang J, Yu P (2006) Discovering frequent closed partial orders from strings. IEEE Trans Knowl Data Eng 18(11): 1467\u20131481","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"329_CR61","unstructured":"Pudi V, Haritsa J (2003) Generalized closed itemsets for association rule mining. In: Proceedings of 19th international conference on data engineering. IEEE Press pp 714\u2013716"},{"key":"329_CR62","doi-asserted-by":"crossref","unstructured":"Sepp\u00e4nen J, Mannila H (2004) Dense itemsets. In: Proceedings of 10th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, pp 683\u2013688","DOI":"10.1145\/1014052.1014140"},{"key":"329_CR63","doi-asserted-by":"crossref","unstructured":"Siebes A (2006) Item sets that compress. In: Proceedings of SIAM Conference on data mining. pp 393\u2013404","DOI":"10.1137\/1.9781611972764.35"},{"key":"329_CR64","doi-asserted-by":"crossref","unstructured":"Song G, Yang D, Cui B, Zheng B, Liu Y, Xie K (2007) CLAIM: An efficient method for relaxed frequent closed itemsets mining over stream data. In: Proceedings of 12th international conference on database systems for advanced applications. Springer, pp 664\u2013675","DOI":"10.1007\/978-3-540-71703-4_56"},{"key":"329_CR65","unstructured":"Srikant R, Vu Q, Agrawal R (1997) Mining association rules with item constraints, In: Proceedings of international conference on knowledge discovery and data mining. ACM, pp 67\u201373"},{"key":"329_CR66","unstructured":"Sripada SG, Reiter E, Hunter J (2003) Generating English summaries of time series data using the Gricean maxims, In: Proceedings of 9th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, pp 187\u2013196"},{"key":"329_CR67","doi-asserted-by":"crossref","unstructured":"Tatti N (2007) Maximum entropy based significance of itemsets. In: Proceedings of IEEE international conference on data mining. pp 312\u2013321","DOI":"10.1109\/ICDM.2007.43"},{"issue":"1","key":"329_CR68","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10115-008-0128-4","volume":"17","author":"N Tatti","year":"2008","unstructured":"Tatti N (2008) Maximum entropy based significance of itemsets. Knowl Inf Syst 17(1): 57\u201377","journal-title":"Knowl Inf Syst"},{"key":"329_CR69","doi-asserted-by":"crossref","unstructured":"Uno T, Arimura H (2007) An efficient polynomial delay algorithm for pseudo frequent itemset mining. In: Proceedings of 10th international conference discovery science. Springer, pp 219\u2013230","DOI":"10.1007\/978-3-540-75488-6_21"},{"key":"329_CR70","unstructured":"Van Leeuwen M, Siebes A (2008) StreamKrimp: Detecting change in data streams. In: Proceedings of European conference on machine learning and principles and practices of knowledge discovery in data. pp 765\u2013774"},{"key":"329_CR71","unstructured":"van Leeuwen M, Vreeken J, Siebes A (2006) Compression picks item sets that matter, In: Proceedings of European conference on principles and practice of knowledge discovery in databases. pp 585\u2013592"},{"key":"329_CR72","doi-asserted-by":"crossref","unstructured":"Vreeken J, Siebes A (2008) Filling in the blanks\u2014Krimp minimisation for missing data. In: Proceedings of 8th IEEE international conference on data mining. pp 1067\u20131072","DOI":"10.1109\/ICDM.2008.40"},{"issue":"11","key":"329_CR73","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/TKDE.2006.179","volume":"18","author":"J Wang","year":"2006","unstructured":"Wang J, Karypis G (2006) On mining instance-centric classification rules. IEEE Trans Knowl Data Eng 18(11): 1497\u20131511","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"329_CR74","doi-asserted-by":"crossref","unstructured":"Wang K, Xu C, Liu B (1999) Clustering transactions using large items. In: Conference on information and knowledge management. pp 483\u2013490","DOI":"10.1145\/319950.320054"},{"issue":"1","key":"329_CR75","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10994-007-5006-x","volume":"68","author":"GI Webb","year":"2007","unstructured":"Webb GI (2007) Discovering significant patterns. Mach Learn 68(1): 1\u201333","journal-title":"Mach Learn"},{"key":"329_CR76","unstructured":"Xin D, Han J, Yan X, Cheng H (2005) Mining compressed frequent-pattern sets. In: Proceedings of 31st international conference on very large data bases. pp 709\u2013720"},{"issue":"1","key":"329_CR77","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/1147234.1147248","volume":"8","author":"SB Yahia","year":"2006","unstructured":"Yahia SB, Hamrouni T, Mephu Nguifo E (2006) Frequent closed itemset based algorithms: a thorough structural and analytical survey. ACM SIGKDD Explor 8(1): 93\u2013104","journal-title":"ACM SIGKDD Explor"},{"key":"329_CR78","unstructured":"Yan X, Cheng H, Han J, Xin D (2005) Summarizing itemset patterns: a profile-based approach, In: Proceedings of 11th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, pp 314\u2013323"},{"key":"329_CR79","unstructured":"Yang C, Fayyad U, Bradley P (2001) Efficient discovery of error-tolerant frequent itemsets in high dimensions, In: Proceedings of 7th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, pp 194\u2013203"},{"key":"329_CR80","doi-asserted-by":"crossref","unstructured":"Yin X, Han J (2003) CPAR: Classification based on predictive association rules. In: Proceedings of SIAM international conference on data mining","DOI":"10.1137\/1.9781611972733.40"},{"issue":"3","key":"329_CR81","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"M Zaki","year":"2004","unstructured":"Zaki M (2004) Mining non-redundant association rules. Data Min Knowl Discov 9(3): 223\u2013248","journal-title":"Data Min Knowl Discov"},{"key":"329_CR82","doi-asserted-by":"crossref","unstructured":"Zaki M, Hsiao C-J (2002) CHARM: An efficient algorithm for closed itemset mining. In: Proceedings of 2nd SIAM international conference on data mining SIAM. pp 457\u2013473","DOI":"10.1137\/1.9781611972726.27"},{"key":"329_CR83","doi-asserted-by":"crossref","unstructured":"Zhao Y, Karypis G (2002) Evaluation of hierarchical clustering algorithms for document datasets. In: Proceedings of 11th Conference of information and knowledge management. pp 515\u2013524","DOI":"10.21236\/ADA439551"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0329-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0329-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0329-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T10:28:16Z","timestamp":1559298496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0329-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,22]]},"references-count":83,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["329"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0329-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,22]]}}}