{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:53:31Z","timestamp":1667224411111},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T00:00:00Z","timestamp":1113955200000},"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":[[2006,2]]},"DOI":"10.1007\/s10115-005-0201-1","type":"journal-article","created":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T15:01:51Z","timestamp":1114614111000},"page":"180-201","source":"Crossref","is-referenced-by-count":25,"title":["On condensed representations of constrained frequent patterns"],"prefix":"10.1007","volume":"9","author":[{"given":"Francesco","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Lucchese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,4,20]]},"reference":[{"key":"201_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining associations between sets of items in massive databases. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 207\u2013216. Washington, DC","DOI":"10.1145\/170036.170072"},{"key":"201_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large databases, pp 487\u2013499. Santiago de Chile, Chile"},{"key":"201_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo R (1998) Efficiently mining long patterns from databases. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 85\u201393. Seattle, Washington","DOI":"10.1145\/276304.276313"},{"key":"201_CR4","doi-asserted-by":"crossref","unstructured":"Bonchi F, Giannotti F, Mazzanti A, Pedreschi D (2003) Adaptive constraint pushing in frequent pattern mining. In: Proceedings of the 7th European conference on principles and practice of knowledge discovery in databases. Cavtat-Dubrovnik, Croatia. Lecture notes in computer science, 2838, Springer, Berlin Heidelberg New York","DOI":"10.1007\/978-3-540-39804-2_7"},{"key":"201_CR5","doi-asserted-by":"crossref","unstructured":"Bonchi F, Giannotti F, Mazzanti A, Pedreschi D. (2003) ExAnte: anticipated data reduction in constrained pattern mining. In: Proceedings of the 7th European conference on principles and practice of knowledge discovery in databases, Cavtat-Dubrovnik, Croatia. Lecture notes in computer science, 2838. Springer, Berlin Heidelberg New York","DOI":"10.1007\/978-3-540-39804-2_8"},{"key":"201_CR6","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAMiner: optimised level-wise frequent pattern mining with monotone constraints. In: Proceedings of the third IEEE international conference on data mining, ICDM '03, pp. 11\u201318. Melbourne, Florida, USA (2003)","DOI":"10.1109\/ICDM.2003.1250892"},{"key":"201_CR7","doi-asserted-by":"crossref","unstructured":"Bonchi F, Goethals B (2004) FP-Bonsai: the art of growing and pruning small FP-trees. In: Proceedings of advances in knowledge discovery and data mining, 8th Pacific-Asia conference, PAKDD 2004, pp 155\u2013160. Sydney, Australia","DOI":"10.1007\/978-3-540-24775-3_19"},{"key":"201_CR8","doi-asserted-by":"crossref","unstructured":"Boulicaut JF, Jeudy B (2001) Mining free itemsets under constraints. In: Proceedings of international database engineering and applications symposium, IDEAS '01, pp 322-329. Grenoble, France","DOI":"10.1109\/IDEAS.2001.938100"},{"key":"201_CR9","doi-asserted-by":"crossref","unstructured":"Boulicaut JF, Jeudy B (2002) Optimization of association rule mining queries. Intel Data Anal J 6:341\u2013357","DOI":"10.3233\/IDA-2002-6404"},{"key":"201_CR10","doi-asserted-by":"crossref","unstructured":"Bucila C, Gehrke J, Kifer D, White W (2002) DualMiner: a dual-pruning algorithm for itemsets with constraints. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 42\u201351. Edmonton, Alberta, Canada","DOI":"10.1145\/775047.775054"},{"key":"201_CR11","unstructured":"De Raedt L, Kramer S (2001) The levelwise version space algorithm and its application to molecular fragment finding. In: Proceedings of the 17th international joint conference on artificial intelligence, pp 853\u2013862. Seattle, Washington"},{"key":"201_CR12","doi-asserted-by":"crossref","unstructured":"Grahne G, Lakshmanan L, Wang X (2000) Efficient mining of constrained correlated sets. In: Proceedings of the 16th IEEE international conference on data engineering, pp. 512\u2013524. San Diego, California","DOI":"10.1109\/ICDE.2000.839450"},{"key":"201_CR13","doi-asserted-by":"crossref","unstructured":"Han J, Lakshmanan L, Ng R (1999) Constraint-based, multidimensional data mining. Computer 32(8):46\u201350","DOI":"10.1109\/2.781634"},{"key":"201_CR14","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y: Mining frequent patterns without candidate generation. In: Proceedings of 2000 ACM SIGMOD international conference on management of data, pp 1-12. Dallas, Texas","DOI":"10.1145\/342009.335372"},{"key":"201_CR15","doi-asserted-by":"crossref","unstructured":"Jia L, Pei R, Pei D (2003) Tough constraint-based frequent closed itemsets mining. In: Proceedings of the 2003 ACM symposium on applied computing (SAC), pp. 416\u2013420. Melbourne, FL","DOI":"10.1145\/952532.952615"},{"key":"201_CR16","doi-asserted-by":"crossref","unstructured":"Lakshmanan L, Ng R, Han J, Pang A (1999) Optimization of constrained frequent set queries with 2-variable constraints. In: Proceedings ACM SIGMOD international conference on management of data, pp 157\u2013168. Philadelphia, Pennsylvania","DOI":"10.1145\/304182.304196"},{"key":"201_CR17","unstructured":"Lucchese C, Orlando S, Perego R (2004) DCI_Closed: a fast and memory efficient algorithm to mine frequent closed itemsets. In: Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations. Brighton, UK"},{"key":"201_CR18","unstructured":"Mannila H, Toivonen H (1996) Multiple uses of frequent sets and condensed representations: extended abstract. In: Proceedings of the 2nd international conference on knowledge discovery and data mining (KDD-96), pp 189\u2013194"},{"key":"201_CR19","doi-asserted-by":"crossref","unstructured":"Ng R, Lakshmanan L, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings ACM SIGMOD international conference on management of data, pp 13\u201324. Seattle, Washington","DOI":"10.1145\/276304.276307"},{"key":"201_CR20","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the 7th international conference on database theory\u2014ICDT '99, Jerusalem, Israel, 10\u201312 January 1999. Lecture notes in computer science, 1540, pp 398\u2013416. Springer, Berlin Heidelberg New York","DOI":"10.1007\/3-540-49257-7_25"},{"key":"201_CR21","doi-asserted-by":"crossref","unstructured":"Pei J, Han J (2000) Can we push more constraints into frequent pattern mining? In: Proceedings ACM SIGKDD international conference on knowledge discovery and data mining, pp. 350-354, Boston, Massachusetts","DOI":"10.1145\/347090.347166"},{"key":"201_CR22","unstructured":"Pei J, Han J, Lakshmanan L (2001) Mining frequent item sets with convertible constraints. In: Proceedings of the 17th IEEE international conference on data engineering, pp 433\u2013442. Heidelberg, Germany"},{"key":"201_CR23","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proceedings of the ACM SIGMOD workshop on research issues in data mining and knowledge discovery (DMKD), pp 21\u201330"},{"key":"201_CR24","unstructured":"ei J, Han J, Wang J (2003) CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC"},{"key":"201_CR25","unstructured":"Srikant R, Vu Q, Agrawal R (1997) Mining association rules with item constraints. In: Proceedings ACM SIGKDD international conference on knowledge discovery and data mining, pp 67-73. Newport Beach, California"},{"key":"201_CR26","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Hsiao CJ (2002) CHARM: an efficient algorithm for closed itemsets mining. In: Proceedings of the 2nd SIAM international conference on data mining, Arlington, Virginia","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-005-0201-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-005-0201-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-005-0201-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:03:59Z","timestamp":1586228639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-005-0201-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4,20]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s10115-005-0201-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4,20]]}}}