{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:14:23Z","timestamp":1725491663754},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75549-4_14","type":"book-chapter","created":{"date-parts":[[2007,9,28]],"date-time":"2007-09-28T13:13:22Z","timestamp":1190985202000},"page":"223-239","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Mining Under Rich Constraints Derived from Various Datasets"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Soulet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Kl\u00e9ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pp. 432\u2013444 (1994)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Lucchese, C.: Pushing tougher constraints in frequent pattern mining. In: Ho et\u00a0al. pp. 114\u2013124 [7]","DOI":"10.1007\/11430919_15"},{"key":"14_CR3","unstructured":"Borgelt, C.: Efficient implementations of Apriori and Eclat. In: Goethals, Zaki [6]"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.F. Boulicaut","year":"2003","unstructured":"Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery journal\u00a07(1), 5\u201322 (2003)","journal-title":"Data Mining and Knowledge Discovery journal"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1024076020895","volume":"7","author":"C. Bucila","year":"2003","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.M.: Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Min. Knowl. Discov.\u00a07(3), 241\u2013272 (2003)","journal-title":"Data Min. Knowl. Discov."},{"key":"14_CR6","unstructured":"Goethals, B., Zaki, M.J. (eds.): FIMI \u201903, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA, CEUR Workshop Proceedings, vol. 90 (2003), CEUR-WS.org"},{"key":"14_CR7","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Advances in Knowledge Discovery and Data Mining","year":"2005","unstructured":"Ho, T.-B., Cheung, D., Liu, H. (eds.): Advances in Knowledge Discovery and Data Mining, PAKDD 2005. LNCS (LNAI), vol.\u00a03518. Springer, Heidelberg (2005)"},{"key":"14_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/11563983_12","volume-title":"Discovery Science","author":"C. H\u00e9bert","year":"2005","unstructured":"H\u00e9bert, C., Cr\u00e9milleux, B.: Mining frequent \u03b4-free patterns in large databases. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds.) DS 2005. LNCS (LNAI), vol.\u00a03735, pp. 124\u2013136. Springer, Heidelberg (2005)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-540-31841-5_6","volume-title":"Knowledge Discovery in Inductive Databases","author":"B. Jeudy","year":"2005","unstructured":"Jeudy, B., Rioult, F.: Database transposition for constrained (closed) pattern mining. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol.\u00a03377, pp. 89\u2013107. Springer, Heidelberg (2005)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/CBMS.2006.116","volume-title":"CBMS 2006, the 19th IEEE International Symposium on Computer-Based Medical Systems","author":"J. Kl\u00e9ma","year":"2006","unstructured":"Kl\u00e9ma, J., Soulet, A., Cr\u00e9milleux, B., Blachon, S., Gandrillon, O.: Mining plausible patterns from genomic data. In: Lee, D., Nutter, B., Antani, S., Mitra, S., Archibald, J. (eds.) CBMS 2006, the 19th IEEE International Symposium on Computer-Based Medical Systems, Salt Lake City, Utah, pp. 183\u2013188. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"14_CR11","unstructured":"Liu, G., Lu, H., Yu, J.X., Wei, W., Xiao, X.: AFOPT: An efficient implementation of pattern growth approach. In: Goethals, Zaki [6]"},{"issue":"3","key":"14_CR12","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 Mining and Knowledge Discovery\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"14_CR13","unstructured":"Orlando, S., Lucchese, C., Palmerini, P., Perego, R., Silvestri, F.: kDCI: a multi-strategy algorithm for mining frequent sets. In: Goethals, Zaki [6]"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/956750.956832","volume-title":"Proceedings of the 9th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 2003)","author":"F. Pan","year":"2003","unstructured":"Pan, F., Cong, G., Tung, A.K.H., Yang, Y., Zaki, M.J.: CARPENTER: finding closed patterns in long biological datasets. In: Proceedings of the 9th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 2003), Washington, DC, USA, pp. 637\u2013642. ACM Press, New York (2003)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","first-page":"398","volume-title":"Database Theory - ICDT 1999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, T., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"14_CR16","first-page":"433","volume-title":"ICDE","author":"J. Pei","year":"2001","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent item sets with convertible constraints. In: ICDE, pp. 433\u2013442. IEEE Computer Society, Los Alamitos (2001)"},{"key":"14_CR17","first-page":"107","volume-title":"KDID","author":"F. Rioult","year":"2003","unstructured":"Rioult, F., Robardet, C., Blachon, S., Cr\u00e9milleux, B., Gandrillon, O., Boulicaut, J.-F.: Mining concepts from large sage gene expression matrices. In: Boulicaut, J.-F., Dzeroski, S. (eds.) KDID, pp. 107\u2013118. Rudjer Boskovic Institute, Zagreb, Croatia (2003)"},{"issue":"5","key":"14_CR18","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/0306-4573(88)90021-0","volume":"24","author":"G. Salton","year":"1988","unstructured":"Salton, G., Buckley, C.: Term-weighting approaches in automatic text retrieval. Information Processing Management\u00a024(5), 513\u2013523 (1988)","journal-title":"Information Processing Management"},{"key":"14_CR19","unstructured":"Soulet, A.: Un cadre g\u00e9n\u00e9rique de d\u00e9couverte de motifs sous contraintes fond\u00e9es sur des primitives. PhD thesis, Universit\u00e9 de Caen Basse-Normandie, France, 2006 (to appear)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Soulet, A., Cr\u00e9milleux, B.: An efficient framework for mining flexible constraints. In: Ho,, et al. (eds.), pp. 661\u2013671 (2005) [7]","DOI":"10.1007\/11430919_76"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","first-page":"98","volume-title":"KDID 2005","author":"A. Soulet","year":"2006","unstructured":"Soulet, A., Cr\u00e9milleux, B.: Exploiting Virtual Patterns for Automatically Pruning the Search Space. In: Bonchi, F., Boulicaut, J.-F. (eds.) KDID 2005. LNCS, vol.\u00a03933, pp. 98\u2013109. Springer, Heidelberg (2006)"},{"key":"14_CR22","unstructured":"Stadler, B.M.R., Stadler, P.F.: Basic properties of filter convergence spaces (2002)"},{"key":"14_CR23","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Bayardo Jr., R.J., Goethals, B., Zaki, M.J. (eds.) FIMI. CEUR Workshop Proceedings, vol.\u00a0126 (2004), CEUR-WS.org"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1126\/science.270.5235.484","volume":"270","author":"V. Velculescu","year":"1995","unstructured":"Velculescu, V., Zhang, L., Vogelstein, B., Kinzler, K.: Serial analysis of gene expression. Science\u00a0270, 484\u2013487 (1995)","journal-title":"Science"},{"key":"14_CR25","unstructured":"Za\u00efane, O.R., El-Hajj, M.: COFI-tree mining: A new approach to pattern growth with reduced candidacy generation. In: Goethals, Zaki [6]"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Inductive Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75549-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:23:55Z","timestamp":1619519035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75549-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755487"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75549-4_14","relation":{},"subject":[]}}