{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:39:37Z","timestamp":1725565177255},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220640"},{"type":"electronic","value":"9783540247753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_42","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T23:48:20Z","timestamp":1284162500000},"page":"341-350","source":"Crossref","is-referenced-by-count":16,"title":["DB-Subdue: Database Approach to Graph Mining"],"prefix":"10.1007","author":[{"given":"Sharma","family":"Chakravarthy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramji","family":"Beera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramanathan","family":"Balachandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings 20th International Conference Very Large Databases, VLDB, Chile, pp. 487\u2013499 (1994)"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: ACM SIGMOD International Conference on Management of Data (2000)","DOI":"10.1145\/342009.335372"},{"key":"42_CR3","unstructured":"Thomas, S.: Architectures and Optimizations for integrating Data Mining algorithms with Database Systems, Ph.d Thesis CISE Dept, University of Florida (1998)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Sarawagi, S., Thomas, S., Agrawal, R.: Integrating Mining with Relational Database Systems: Alternatives and Implications. In: SIGMOD, Seattle, pp. 343\u2013354 (1998)","DOI":"10.1145\/276305.276335"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Mishra, P., Chakravarthy, S.: Performance Evaluation and Analysis of SQL 1992 Approaches for Association Rule Mining. In: BNCOD Proceedings, pp. 95\u2013114 (2003)","DOI":"10.1007\/3-540-45073-4_9"},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF00054839","volume":"3","author":"Y.G. Leclerc","year":"1989","unstructured":"Leclerc, Y.G.: Constructing simple stable descriptions for image partitioning. International journal of Computer Vision\u00a03(1), 73\u2013102 (1989)","journal-title":"International journal of Computer Vision"},{"key":"42_CR7","volume-title":"Stochastic Complexity in statistical inquiry","author":"J. Rissanen","year":"1989","unstructured":"Rissanen, J.: Stochastic Complexity in statistical inquiry. World Scientific Publishing Company, Singapore (1989)"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","volume":"80","author":"J.R. Quinlan","year":"1989","unstructured":"Quinlan, J.R., Rivest, R.L.: Inferring decision trees using the minimum description length principle. Information and Computation\u00a080, 227\u2013248 (1989)","journal-title":"Information and Computation"},{"key":"42_CR9","unstructured":"Brazma, A., et al.: Discovering patterns and subfamilies in biosequences. In: Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, pp. 34\u201393 (1996)"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: An Efficient Algorithm for Discovering Frequent Subgraphs, in Technical Report. Department of Computer Science\/Army HPC Research Center, University of Minnesota (2002)","DOI":"10.21236\/ADA439497"},{"key":"42_CR11","volume-title":"A Complete Guide to DB2 Universal Database","author":"D. Chamberlin","year":"1998","unstructured":"Chamberlin, D.: A Complete Guide to DB2 Universal Database. Morgan Kaufmann Publishers, Inc., San Francisco (1998)"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"R.C. Read","year":"1977","unstructured":"Read, R.C., Corneil, D.G.: The graph isomorph disease. Journal of Graph Theory\u00a01, 339\u2013363 (1977)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24775-3_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:56:29Z","timestamp":1605761789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}