{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:59:48Z","timestamp":1725566388002},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540231080"},{"type":"electronic","value":"9783540301165"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30116-5_7","type":"book-chapter","created":{"date-parts":[[2010,9,17]],"date-time":"2010-09-17T23:34:59Z","timestamp":1284766499000},"page":"39-51","source":"Crossref","is-referenced-by-count":2,"title":["An Experiment on Knowledge Discovery in Chemical Databases"],"prefix":"10.1007","author":[{"given":"Sandra","family":"Berasaluce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Lauren\u00e7o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amedeo","family":"Napoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Niel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/ICDE.1995.380415","volume-title":"Proceedings of the Eleventh International Conference on Data Engineering, (ICDE 1995)","author":"R. Agrawal","year":"1995","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Yu, P.S., Chen, A.L.P. (eds.) Proceedings of the Eleventh International Conference on Data Engineering (ICDE 1995), Taipei, Taiwan, pp. 3\u201314. IEEE Computer Society, Los Alamitos (1995)"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. ACM SIGKDD Explorations\u00a02(2), 66\u201375 (2000)","journal-title":"ACM SIGKDD Explorations"},{"key":"7_CR3","unstructured":"Berasaluce, S.: Fouille de donn\u00e9es at acquisition de connaissances \u00e0 partir de bases de donn\u00e9es de r\u00e9actions chimiques. Th\u00e8se de chimie informatique et th\u00e9orique, Universit\u00e9 Henri Poincar\u00e9 Nancy 1 (2002)"},{"key":"7_CR4","unstructured":"Berasaluce, S., Lauren\u00e7o, C., Napoli, A., Niel, G.: Data mining in reaction databases: extraction of knowledge on chemical functionality transformations. Technical Report A04-R-049, LORIA, Nancy (2004)"},{"key":"7_CR5","unstructured":"Brachman, R.J., Anand, T.: The Process of Knowledge Discovery in Databases. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Mining, Menlo Park, California, pp. 37\u201357. AAAI Press \/ MIT Press (1996)"},{"key":"7_CR6","unstructured":"Chittimoori, R., Holder, L.B., Cook, D.J.: Applying the Subdue substructure discovery system to the chemical toxicity domain. In: Proceedings of the Florida AI Research Symposium, pp. 90\u201394 (1999)"},{"key":"7_CR7","volume-title":"The Logic of Chemical Synthesis","author":"E.J. Corey","year":"1989","unstructured":"Corey, E.J., Cheng, X.M.: The Logic of Chemical Synthesis. John Wiley & Sons, New York (1989)"},{"key":"7_CR8","unstructured":"Dehaspe, L., Toivonen, H., King, R.D.: Finding frequent substructures in chemical compounds. In: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, pp. 30\u201336 (1998)"},{"key":"7_CR9","unstructured":"Fayyad, U., Piatetsky-Shapiro, G., Smyth, P.: Knowledge Discovery and Data Mining: Towards a Unifying Framework. In: Proceedings of the Second International Conference on Knowledge Discovery & Data Mining (KDD 1996), Portland, Oregon, pp. 82\u201388 (1996)"},{"key":"7_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44583-8_11","volume-title":"Conceptual Structures: Broadening the Base","author":"B. Ganter","year":"2001","unstructured":"Ganter, B., Rudolph, S.: Formal Concept Analysis Methods for Dynamic Conceptual Graphs. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol.\u00a02120, pp. 143\u2013156. Springer, Heidelberg (2001)"},{"key":"7_CR11","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, Berlin (1999)"},{"key":"7_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An Apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. Technical Report 02\u2013026, Department of Computer Science, University of Minnesota (2002); To be published in IEEE Transactions on Knowledge and Data Engineering","DOI":"10.21236\/ADA439497"},{"issue":"1\/2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1006\/ijhc.1994.1051","volume":"41","author":"A. Napoli","year":"1994","unstructured":"Napoli, A., Lauren\u00e7o, C., Ducournau, R.: An object-based representation system for organic synthesis planning. International Journal of Human-Computer Studies\u00a041(1\/2), 5\u201332 (1994)","journal-title":"International Journal of Human-Computer Studies"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., 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)"},{"issue":"1","key":"7_CR16","first-page":"25","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Pruning closed itemset lattices for association rules. International Journal of Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"International Journal of Information Systems"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Sena, M., Karypis, G.: SLPMiner: An algorithm for finding frequent sequential patterns using length-decreasing support constraint. Technical Report 02\u2013023, Department of Computer Science, University of Minnesota (2002)","DOI":"10.21236\/ADA438931"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. Journal of Data and Knowledge Engineering\u00a042(2), 189\u2013222 (2002)","journal-title":"Journal of Data and Knowledge Engineering"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1090\/dimacs\/051\/26","volume":"51","author":"P. Vismara","year":"2000","unstructured":"Vismara, P., Lauren\u00e7o, C.: An abstract representation for molecular graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a051, 343\u2013366 (2000)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30116-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:44:06Z","timestamp":1558291446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30116-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231080","9783540301165"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30116-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}