{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:46:56Z","timestamp":1725472016563},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540464914"},{"type":"electronic","value":"9783540464938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11893318_18","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T14:14:10Z","timestamp":1160403250000},"page":"161-172","source":"Crossref","is-referenced-by-count":2,"title":["Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations"],"prefix":"10.1007","author":[{"given":"Taneli","family":"Mielik\u00e4inen","sequence":"first","affiliation":[]},{"given":"Pan\u010de","family":"Panov","sequence":"additional","affiliation":[]},{"given":"Sa\u0161o","family":"D\u017eeroski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) SIGMOD Conference, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/0-387-25465-X_17","volume-title":"The Data Mining and Knowledge Discovery Handbook","author":"B. Goethals","year":"2005","unstructured":"Goethals, B.: Frequent set mining. In: Maimon, O., Rokach, L. (eds.) The Data Mining and Knowledge Discovery Handbook, pp. 377\u2013397. Springer, Heidelberg (2005)"},{"key":"18_CR3","unstructured":"Goethals, B., Zaki, M.J. (eds.): FIMI 2003, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, Melbourne, Florida, USA, December 19, 2003. CEUR Workshop Proceedings, vol.\u00a090 (2003)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo\u00a0Jr., R.J., Goethals, B., Zaki, M.J. (eds.): FIMI 2004, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Brighton, UK, November 1, 2004. CEUR Workshop Proceedings, vol.\u00a0126 (2004)","DOI":"10.1145\/1007730.1007744"},{"key":"18_CR5","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations (extended abstract). In: KDD, pp. 189\u2013194 (1996)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Calders, T., Rigotti, C., Boulicaut, J.F.: A survey on condensed representations for frequent sets. In: [30], pp. 64\u201380","DOI":"10.1007\/11615576_4"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Mielik\u00e4inen, T.: Transaction databases, frequent itemsets, and their condensed representations. In: [31], pp. 139\u2013164","DOI":"10.1007\/11733492_9"},{"key":"18_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11615576","volume-title":"Constraint-Based Mining and Inductive Databases","author":"J.-F. Boulicaut","year":"2006","unstructured":"Boulicaut, J.-F.: Inductive databases and multiple uses of frequent itemsets: The cInQ approach. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol.\u00a03848, pp. 1\u201323. Springer, Heidelberg (2006)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T. Imielinski","year":"1996","unstructured":"Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of the ACM\u00a039, 58\u201364 (1996)","journal-title":"Communications of the ACM"},{"key":"18_CR10","unstructured":"Mannila, H.: Inductive databases and condensed representations for data mining. In: ILPS, pp. 21\u201330 (1997)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Siebes, A.: Data mining in inductive databases. In: [31], pp. 1\u201323","DOI":"10.1007\/11733492_1"},{"key":"18_CR12","first-page":"261","volume":"3","author":"P. Clark","year":"1989","unstructured":"Clark, P., Niblett, T.: The CN2 induction algorithm. Machine Learning\u00a03, 261\u2013283 (1989)","journal-title":"Machine Learning"},{"key":"18_CR13","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1992","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1992)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/321075.321084","volume":"8","author":"M.E. Maron","year":"1961","unstructured":"Maron, M.E.: Automatic indexing: An experimental inquiry. J. ACM\u00a08, 404\u2013417 (1961)","journal-title":"J. ACM"},{"key":"18_CR15","unstructured":"Panov, P., D\u017eeroski, S., Blockeel, H., Lo\u0161kovska, S.: Predictive data mining using itemset frequencies. In: Proceedings of the 8th International Multiconference Information Society, pp. 224\u2013227 (2005)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1145\/293347.293351","volume":"45","author":"M.J. Kearns","year":"1998","unstructured":"Kearns, M.J.: Efficient noise-tolerant learning from statistical queries. J. ACM\u00a045, 983\u20131006 (1998)","journal-title":"J. ACM"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1109\/TKDE.2003.1245281","volume":"15","author":"D. Pavlov","year":"2003","unstructured":"Pavlov, D., Mannila, H., Smyth, P.: Beyond independence: Probabilistic models for query approximation on binary transaction data. IEEE Transactions on Knowledge and Data Engineering\u00a015, 1409\u20131421 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Sepp\u00e4nen, J.K., Mannila, H.: Boolean formulas and frequent sets. In: [30], pp. 348\u2013361","DOI":"10.1007\/11615576_16"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-540-24775-3_58","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T. Mielik\u00e4inen","year":"2004","unstructured":"Mielik\u00e4inen, T.: Separating structure from interestingness. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS, vol.\u00a03056, pp. 476\u2013485. Springer, Heidelberg (2004)"},{"key":"18_CR20","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Vijayaraman, T.M., Buchmann, A.P., Mohan, C., Sarda, N.L. (eds.): VLDB 1996, pp. 134\u2013145 (1996)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1109\/TKDE.2003.1245290","volume":"15","author":"M. Kubat","year":"2003","unstructured":"Kubat, M., Hafez, A., Raghavan, V.V., Lekkala, J.R., Chen, W.K.: Itemset trees for targeted association querying. IEEE Transactions on Knowledge and Data Engineering\u00a015, 1522\u20131534 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"18_CR22","doi-asserted-by":"publisher","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.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov.\u00a08, 53\u201387 (2004)","journal-title":"Data Min. Knowl. Discov."},{"key":"18_CR23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.453","volume":"8","author":"A.W. Moore","year":"1998","unstructured":"Moore, A.W., Lee, M.S.: Cached sufficient statistics for efficient machine learning with large datasets. JAIR\u00a08, 67\u201391 (1998)","journal-title":"JAIR"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Mielik\u00e4inen, T.: Implicit enumeration of patterns. In: [32], pp. 150\u2013172","DOI":"10.1007\/978-3-540-31841-5_9"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11602897_9","volume-title":"Information and Communications Security","author":"S. Laur","year":"2005","unstructured":"Laur, S., Lipmaa, H., Mielik\u00e4inen, T.: Private itemset support counting. In: Qing, S., Mao, W., L\u00f3pez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol.\u00a03783, pp. 97\u2013111. Springer, Heidelberg (2005)"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Mielik\u00e4inen, T.: An automata approach to pattern collections. In: [32], pp. 130\u2013149","DOI":"10.1007\/978-3-540-31841-5_8"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Calders, T., Goethals, B.: Quick inclusion-exclusion. In: [31], pp. 86\u2013103","DOI":"10.1007\/11733492_6"},{"key":"18_CR28","unstructured":"Geerts, F., Goethals, B., Mielik\u00e4inen, T.: What you store is what you get. In: [33], pp. 60\u201369"},{"key":"18_CR29","unstructured":"Mielik\u00e4inen, T.: Finding all occurring patterns of interest. In: [33], pp. 97\u2013106"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","volume-title":"Constraint-Based Mining and Inductive Databases","year":"2006","unstructured":"Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.): Constraint-Based Mining and Inductive Databases. LNCS, vol.\u00a03848. Springer, Heidelberg (2006)"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","volume-title":"Knowledge Discovery in Inductive Databases","year":"2006","unstructured":"Bonchi, F., Boulicaut, J.-F. (eds.): KDID 2005. LNCS, vol.\u00a03933. Springer, Heidelberg (2006)"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","volume-title":"Knowledge Discovery in Inductive Databases","year":"2005","unstructured":"Goethals, B., Siebes, A. (eds.): KDID 2004 (Revised Selected and Invited Papers). LNCS, vol.\u00a03377. Springer, Heidelberg (2005)"},{"key":"18_CR33","unstructured":"Boulicaut, J.F., Dzeroski, S. (eds.): Proceedings of the Second International Workshop on Inductive Databases, Cavtat-Dubrovnik, Croatia, September 22 (2003)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11893318_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:22Z","timestamp":1605642922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11893318_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540464914","9783540464938"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/11893318_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}