{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:02:48Z","timestamp":1725562968878},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642146398"},{"type":"electronic","value":"9783642146404"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14640-4_1","type":"book-chapter","created":{"date-parts":[[2010,8,14]],"date-time":"2010-08-14T06:41:52Z","timestamp":1281768112000},"page":"1-15","source":"Crossref","is-referenced-by-count":1,"title":["The iZi Project: Easy Prototyping of Interesting Pattern Mining Algorithms"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Flouvat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"De Marchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1117454.1117476","volume":"7","author":"B. Goethals","year":"2005","unstructured":"Goethals, B., Nijssen, S., Zaki, M.J.: Open source data mining: workshop report. SIGKDD Explorations\u00a07, 143\u2013144 (2005)","journal-title":"SIGKDD Explorations"},{"key":"1_CR2","unstructured":"Bayardo Jr., R.J., Zaki, M.J.(eds.): FIMI 2003, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Melbourne, Florida, USA, November 19. CEUR Workshop Proceedings, vol.\u00a090, CEUR-WS.org (2003)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo Jr., 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. CEUR Workshop Proceedings, vol.\u00a0126, CEUR-WS.org (2004)","DOI":"10.1145\/1007730.1007744"},{"key":"1_CR4","unstructured":"Han, J.: Data Mining Group: IlliMine project. University of Illinois Urbana-Champaign Database and Information Systems Laboratory (2005), http:\/\/illimine.cs.uiuc.edu\/"},{"key":"1_CR5","unstructured":"Hasan, M., Chaoji, V., Salem, S., Parimi, N., Zaki, M.: DMTL: A generic data mining template library. In: Workshop on Library-Centric Software Design (LCSD 2005), at OOPSLA 2005 conference, San Diego, California (2005)"},{"key":"1_CR6","volume-title":"Data Mining: Practical machine learning tools and techniques","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)","edition":"2"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1145\/1150402.1150531","volume-title":"KDD","author":"I. Mierswa","year":"2006","unstructured":"Mierswa, I., Wurst, M., Klinkenberg, R., Scholz, M., Euler, T.: Yale: rapid prototyping for complex data mining tasks. In: Eliassi-Rad, T., Ungar, L.H., Craven, M., Gunopulos, D. (eds.) KDD, pp. 935\u2013940. ACM, New York (2006)"},{"key":"1_CR8","first-page":"159","volume-title":"ICDE","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., Giannotti, F., Lucchese, C., Orlando, S., Perego, R., Trasarti, R.: Conquest: a constraint-based querying system for exploratory pattern discovery. In: Liu, L., Reuter, A., Whang, K.Y., Zhang, J. (eds.) ICDE, p. 159. IEEE Computer Society, Los Alamitos (2006)"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1145\/1401890.1402019","volume-title":"KDD","author":"H. Blockeel","year":"2008","unstructured":"Blockeel, H., Calders, T., Fromont, \u00c9., Goethals, B., Prado, A., Robardet, C.: An inductive database prototype based on virtual mining views. In: Li, Y., Liu, B., Sarawagi, S. (eds.) KDD, pp. 1061\u20131064. ACM, New York (2008)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Discov.\u00a01, 241\u2013258 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"1_CR11","first-page":"207","volume-title":"SIGMOD Conference","author":"R. Agrawal","year":"1993","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. ACM Press, New York (1993)"},{"key":"1_CR12","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations (extended abstract). In: KDD, pp. 189\u2013194 (1996)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Koeller, A., Rundensteiner, E.A.: Heuristic strategies for inclusion dependency discovery. In: Meersman, R., Tari, Z. (eds.) OTM 2004, Part II. LNCS, vol.\u00a03291, pp. 891\u2013908. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-30469-2_5"},{"key":"1_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11615576_5","volume-title":"Constraint-Based Mining and Inductive Databases","author":"F. De Marchi","year":"2006","unstructured":"De Marchi, F., Flouvat, F., Petit, J.M.: Adaptive strategies for mining the positive border of interesting patterns: Application to inclusion dependencies in databases. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol.\u00a03848, pp. 81\u2013101. Springer, Heidelberg (2006)"},{"key":"1_CR15","first-page":"319","volume":"2","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1987)","journal-title":"Machine Learning"},{"key":"1_CR16","first-page":"306","volume-title":"ESEC\/SIGSOFT FSE","author":"Z. Li","year":"2005","unstructured":"Li, Z., Zhou, Y.: Pr-miner: automatically extracting implicit programming rules and detecting violations in large software code. In: Wermelinger, M., Gall, H. (eds.) ESEC\/SIGSOFT FSE, pp. 306\u2013315. ACM, New York (2005)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11546849_42","volume-title":"Data Warehousing and Knowledge Discovery","author":"A. Casali","year":"2005","unstructured":"Casali, A., Cicchetti, R., Lakhal, L.: Essential patterns: A perfect cover of frequent patterns. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol.\u00a03589, pp. 428\u2013437. Springer, Heidelberg (2005)"},{"key":"1_CR18","unstructured":"Gschwind, T.: Pstl-a c++ persistent standard template library. In: COOTS, pp. 147\u2013158. USENIX (2001)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: KDD, pp. 283\u2013286 (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"1_CR20","first-page":"487","volume-title":"VLDB","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D. Gunopulos","year":"2003","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharm, R.S.: Discovering all most specific sentences. ACM Trans. Database Syst.\u00a028, 140\u2013174 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"1_CR22","unstructured":"Flouvat, F., De Marchi, F., Petit, J.M.: ABS: Adaptive Borders Search of frequent itemsets. In: [3]"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/342009.335372","volume-title":"SIGMOD Conference","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J.F., Bernstein, P.A. (eds.) SIGMOD Conference, pp. 1\u201312. ACM, New York (2000)"},{"key":"1_CR24","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: Lcm: An efficient algorithm for enumerating frequent closed item sets. In: [2]"},{"key":"1_CR25","unstructured":"Bodon, F.: Surprising results of trie-based fim algorithms. In: [3]"},{"key":"1_CR26","first-page":"139","volume":"12","author":"P.A. Flach","year":"1999","unstructured":"Flach, P.A., Savnik, I.: Database dependency discovery: A machine learning approach. AI Commun.\u00a012, 139\u2013160 (1999)","journal-title":"AI Commun."},{"key":"1_CR27","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-00685-2_2","volume":"12","author":"H. Jaudoin","year":"2009","unstructured":"Jaudoin, H., Flouvat, F., Petit, J.M., Toumani, F.: Towards a scalable query rewriting algorithm in presence of value constraints. Journal on Data Semantics\u00a012, 37\u201365 (2009)","journal-title":"Journal on Data Semantics"},{"key":"1_CR28","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/S0019-9958(83)80002-3","volume":"56","author":"J.C. Mitchell","year":"1983","unstructured":"Mitchell, J.C.: The implication problem for functional and inclusion dependencies. Information and Control\u00a056, 154\u2013173 (1983)","journal-title":"Information and Control"},{"key":"1_CR30","unstructured":"Goethals, B.: Frequent itemset mining implementations repository, http:\/\/fimi.cs.helsinki.fi\/"},{"key":"1_CR31","first-page":"691","volume-title":"VLDB","author":"Y. Sismanis","year":"2006","unstructured":"Sismanis, Y., Brown, P., Haas, P.J., Reinwald, B.: Gordian: Efficient and scalable discovery of composite keys. In: Dayal, U., Whang, K.Y., Lomet, D.B., Alonso, G., Lohman, G.M., Kersten, M.L., Cha, S.K., Kim, Y.K. (eds.) VLDB, pp. 691\u2013702. ACM, New York (2006)"},{"key":"1_CR32","unstructured":"Goethals, B.: Apriori implementation. University of Antwerp, http:\/\/www.adrem.ua.ac.be\/~goethals\/"},{"key":"1_CR33","unstructured":"Borgelt, C.: Recursion pruning for the apriori algorithm. In: [3]"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-48298-9_31","volume-title":"Data Warehousing and Knowledge Discovery","author":"J.F. Boulicaut","year":"1999","unstructured":"Boulicaut, J.F., Klemettinen, M., Mannila, H.: Modeling kdd processes within the inductive database framework. In: Mohania, M.K., Tjoa, A.M. (eds.) DaWaK 1999. LNCS, vol.\u00a01676, pp. 293\u2013302. Springer, Heidelberg (1999)"},{"key":"1_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)"},{"key":"1_CR36","first-page":"4","volume":"21","author":"S. Chaudhuri","year":"1998","unstructured":"Chaudhuri, S.: Data mining and database systems: Where is the intersection? IEEE Data Eng. Bull.\u00a021, 4\u20138 (1998)","journal-title":"IEEE Data Eng. Bull."}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Applied Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14640-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T14:21:22Z","timestamp":1711722082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14640-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146398","9783642146404"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14640-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}